- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes GradCuit, a test-time latent reasoning method. It optimizes a continuous prefix in an intermediate Transformer layer within the frozen LLM. It uses self-rewards and gradients of continuation-token to update the prefix at test time. Across five backbones, three benchmarks, and two answer formats, it reports 64.5% average accuracy: 6.6pts above CoT and 2.4pts above self-consistency. Ablations examine reward directions, layer placement, and token-level sensitivity.
Critical strengths
- Broad empirical gains. GradCuit improves over CoT in all reported settings and exceeds self-consistency on average. The breadth across model families and answer formats supports its practical value.
- The full method exceeds the fixed-prefix variant by 4.6pts on avg in the boxed answer format. This supports a contribution from latent updates beyond an additional reasoning prompt.
Critical weaknesses
- The credit-assignment and interpretability claims exceed the evidence. Eq. 7 assumes trajectories sampled from the policy, while implementation uses greedy trajectories, its update is therefore a biased estimator for that expectation. The random-direction ablation changes the optimizer and update magnitude, so it doesn't isolate direction quality (a cleaner control should compute the actual Adam update as the full GradCuit, and replace its direction with a random one while retaining its magnitude). Also, large gradient norms on connector tokens show local sensitivity, but don't necessarily establish that those tokens causally explain improved reasoning.
- It reports fewer generation rounds but no wall-clock latency provided. GradCuit requires sequential updates with self-verification and backward passes (these can't be parallelized), while self-consistency can sample candidates in parallel. Fewer rounds alone don't necessarily establish an efficiency advantage.
Questions for authors
See weaknesses.
2 comments
Thanks for adding this comparison. Please make this trade-off clear in the paper and distinguish throughput from per-request latency. I will keep my score at 3.
Thanks for the additional experiments. That addresses most of my concerns. The connector experiment is useful, though it doesn't show these tokens are uniquely important. The timing results support better throughput, but latency versus self-consistency remains unclear. Overall, I will raise my score to 3.