- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 3
Read review
Paper summary
The paper introduces two techniques for making LM inference more efficient under syntactic constraints: dropping unusable tokens from the LM-head (GRVP) and picking tokens deterministically when the constraints only give you one option, rather than via inference (GGCD). The paper claims that GGCD already exists but that GRVP is novel. The evaluation suggests that GRVP and GGCD reduce inference cost and increase accuracy when compared against baselines.
Critical strengths
Not sure
Critical weaknesses
-
The paper is difficult to read. Terms are frequently used without/before definition/explanation (e.g., the Contributions section, Section 2.1, L97, p_M, R_freq). The statement of Theorem 4.3 is also a bit vague, and the two key algorithms seem underspecified. I also felt that intuition was replaced by propositions, which further obscured things. Finally, it was difficult to locate the key claims being made in the Evaluation section, and it was unclear what was being measured in the experiments.
-
Neither the intro nor the related work section adequately distinguishes this paper's contributions against the prior work. As a result, it is difficult to assess the paper's contributions. The "Constrained Generation" section in the related work suggests that GGCD already exists. As for GRVP, if is novel then the introduction should explain what challenges prevented it from being developed in prior work.
Questions for authors
Besides proofs, what does your work contribute that is not provided by prior work?