- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper proposes a new method, REWIND, which constructs a normalized geometric reference distribution based on prediction discrepancies between historical student checkpoints and the current model under the same prefix. This distribution is used to derive positive weights that are clipped and detached from the gradient computation, scaling the original SFT or OPD loss on a per-token basis without altering the learning targets defined by demonstrations or teacher feedback. Experiments are conducted using Qwen3-1.7B and Qwen3-4B to compare REWIND against multiple baselines on mathematical reasoning and coding tasks. The results show that REWIND achieves the highest average scores across both task categories, at both model scales, under both SFT and OPD settings.
Critical strengths
- Theoretically,the REWIND paper introduces a unified approach to leveraging historical information in both SFT and OPD and the authors also analyze the role of competing tokens.
- Experimentally, the authors evaluate REWIND against corresponding baselines across two model scales, mathematical reasoning and coding tasks, REWIND achieves the highest average scores in all four settings. Ablations using Shuffle and Binary demonstrate that the gains do not arise merely from using non-uniform weights, but also depend on the token-level allocation of historical signals.
Critical weaknesses
-
The OPD experiments consider only one training configuration, making it difficult to disentangle the contributions of token-level historical signal allocation, the covariance term, and the competition term to the observed performance improvements.
-
There is a gap between the theoretical analysis and the practical training setup. The teacher-consistency argument in the appendix relies on binary partition weights and fixed prefixes, whereas the actual OPD implementation uses a multi-class partition consisting of top-15 tokens and a tail group. Furthermore, the main experiments use only a single random seed 42, lacking multi-seed results to verify the robustness and stability of the reported improvements.
Questions for authors
-
Have the authors investigated the effectiveness of both methods on novel tasks or datasets, similar to the evaluation in Beyond Log Likelihood: Probability-Based Objectives for Supervised Fine-Tuning across the Model Capability Continuum? In particular, are these methods effective on tasks where the model weak region?
-
Other static weighting methods, such as GCE, can also improve performance on MATH and coding tasks. Does REWIND provide additional gains over these methods?
A kind request before the discussion closes
Dear Reviewer EmFM,
We are sorry to write once more, and we understand how busy this period is.
Your comments have been a great help to us. Working through them has made the paper clearer and stronger, and we are grateful for the care you put into the review and for your positive assessment of our work.
The discussion closes today. If you could find a few minutes to read our rebuttal and leave a short reply, we would be truly grateful. Even one line on whether your concerns have been addressed, or on what remains open, would mean a great deal to us. If anything is unclear, we will reply right away.
Thank you sincerely for your time.
Best regards,
The Authors