- Rating
- 1
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The paper presents GBFSGS, a grammar constrained decoding algorithm building off of the prior work of ASAp that aligns the conditioned distribution with the underlying distribution. The paper claims better convergence results than ASAp.
Critical strengths
None
Critical weaknesses
The paper is poorly written and appear unfinished. The main presented algorithm is cut off, which makes it difficult to assess this work. The text explanation is not precise nor detailed enough to explain the algorithm nor provide a convincing argument and proof for convergence. The key equations defining the prior work the algorithm is based on appear malformed, showing the not-entailed symbol. There is inconsistent notation leading to undefined values such as . The paper breaks ICLR formatting requirements by using a tiny font for the figure captions. The work also claims a reduction in memory, but does not provide metrics measuring memory usage. Additionally, the improvement of the final expectation over the ASAp baseline is not a lot, putting into question the impact and significance of the findings.
Questions for authors
- How is (faster) convergence guaranteed? Could the authors provide a proof?