- Rating
- 2(+1)
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes TERSE, a GRPO-style RLVR reward for efficient LLM reasoning. The main insight is that length is not the only metric for measuring reasoning conciseness. Reasoning trajectories of the same length may have different degrees of redundancy. Its main contribution is using the gzip compressibility of a trace's raw bytes as a redundancy signal that needs no auxiliary model, lexicon, reference answer, or extra inference. The experiments show that TERSE raises average accuracy across five math benchmarks by 7.8 points while cutting response length by 54.4% at 1.5B, and by 3.4 points with a 37.4% cut at 7B.
Critical strengths
- The method is simple and cheap. There is no auxiliary model and no extra forward pass; the overhead is negligible, and it is easy to reproduce and plug into existing pipelines.
- Well-motivated design. Residualization and difficulty bucketing each address a specific failure mode, and the ablations confirm both.
Critical weaknesses
- Baselines were copied, not rerun. All baseline numbers come from the ARLCP paper rather than being retrained under TERSE's own setup, which weakens the comparison.
- gzip cannot catch semantic repetition: it can only recognize literal repetition. If the same meaning is restated in different words, it is very likely unable to detect it, and this limitation is not discussed much in the text. This may lead to reward hacking in the model: the model's reasoning redundancy is not reduced; it merely repeats the same information using different expressions.
Questions for authors
- Can the baseline be reproduced and tested again? At the very least, the open-source models from these papers should be tested under the same experimental environment and configuration. Deviations in data across different papers caused by differences in environments, verifiers, etc., may be larger than the improvement margin of the method.
- Although the motivation of the method emphasizes redundancy, the experiments only test the model’s accuracy and reasoning length. Could redundancy evaluation metrics be added? In particular, testing semantic redundancy would help address the second point in the weaknesses.
3 comments
Response to Reviewer mDsV: Weakness2 and Q2
Weakness2: gzip cannot catch semantic repetition: it can only recognize literal repetition. [...]. the model's reasoning redundancy is not reduced; it merely repeats the same information using different expressions.
The reward is not compressibility alone. It spends a fixed budget on two terms, a length penalty and a residual-compressibility penalty, and on any prompt that the model solves more often than not, the length term is the larger of the two. A step that is reworded rather than removed still occupies tokens, so it still pays that larger penalty and avoids only the smaller one, while removing it avoids both. The reward therefore does not favour rewording, and rewording cannot account for the length reductions we report, since restating content in different words leaves the trace about as long as before.
Q2: Although the motivation of the method emphasizes redundancy, the experiments only test the model’s accuracy and reasoning length. Could redundancy evaluation metrics be added? In particular, testing semantic redundancy would help address the second point in the weaknesses.
Two things are worth separating. What the method sets out to remove is content that does not help reach the answer. What the signal is built to detect is one pattern of that content, where the trace goes back over material it has already produced. That pattern is readable from the bytes, and it is the purest case of waste, since a detour at least works on the problem while restating a settled step does not.
The evaluation should measure the first of those, and accuracy and length do measure it when they are read together. Cutting tokens alone shows nothing, as NoThinking cuts 81.0% of them and loses 12.8 points of accuracy, which removes reasoning rather than waste. What is informative is a large reduction with no accuracy loss on any benchmark. At 1.5B we remove 54.4% of the tokens while accuracy rises by 7.8 points and stays at or above the base model on all five benchmarks, and no other method in Table 2 does both. The tokens we removed were not contributing to the answers.
Thank you for your response. The new experiments increase the credibility of the paper. However, the use of gzip is more like a heuristic approach, and its usefulness is only demonstrated by outcome metrics such as accuracy and length, lacking a more detailed experimental analysis of it. I will raise the score to 2
Response to Reviewer mDsV: Q1
The baseline numbers in Table 2 are taken from ARLCP. To check that the comparison does not depend on their reported values, we have evaluated the public checkpoints of Vanilla, NoThinking, TLMRE, AdaptThink, and LASER under our own pipeline, and trained ARLCP from scratch in our environment. The results agree with the reported values for every method we could rerun (see table below). The paper reports one seed. We have since run a second seed at both scales.