- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes Latent Thought Flow (LTF), a method for latent reasoning in LLMs. LTF learns variable-length continuous latent trajectories using a GFlowNet objective, plus rewards combining answer quality and reasoning cost. It adds entropy-weighted subtrajectory balance and an auxiliary reference-prior regularizer, to encourge concise but useful latent reasoning paths. Experiments ({four models} X {arithmetic, symbolic reasoning, planning, code generation benchmarks}) report consistent accuracy and latency improvements over explicit CoT and several latent reasoning baselines.
Critical strengths
The empirical gains are consistent across several tasks and model sizes. For example, Table 1 reports the 1B model's average accuracy increases from 55.56% to 59.68% over ReGuLaR while latency decreases from 124.56 to 118.12 ms. Measuring acutal latency plus reasoning length makes the evidence more convincing.
Critical weaknesses
-
The experimental comparison isn't fully convincing. The explicit CoT baseline is implausibly weak. For example, LLaMA-3.1-8B gets 19% on GSM8K-Aug, far below commonly reported number for this model, which can get ~40% even with No-CoT and bump to ~70% with CoT-SFT (similar for other model sizes). Also, there is no CoT-SFT baseline, as the paper repeatedly claims superior accuracy-efficiency tradeoffs over explicit CoT, but avoids comparing against explicit CoT-SFT. Comparing a fine-tuned latent model against zero-shot prompting creates an artificially weak baseline.
-
The length penalty is hard to interpret. Different length trajectories have densities on spaces of different dimension, so without a clear base measure and consistent treatment of Jacobians, the weight of cost relative to the log-density terms in Eq. 14 can depend on the arbitrary scale of . Without a ablation, it is unclear whether the penalty drives short trajectories. The ablations also point the same way. DB, TB and SubTB share the same balance fixed point for a fixed reward, but DB and TB produce trajectories about 4x longer than SubTB (7.28 and 7.51 vs. 1.90). If all three reach the same fixed target, their length distributions will match. Without the reference prior, LTF remains more accurate than ReGuLaR (59.25 vs. 55.56) but uses longer trajectories (2.75 vs. 2.04). Thus, the efficiency gain over ReGuLaR appears coming from the prior and the choice of balance loss, not from reward-proportional sampling.
Questions for authors
See weaknesses. I will raise my score if any of above gets properly addressed/explained.
3 comments
Thanks for clarifying. The stronger 8B CoT result needs a latency comparison to support the efficiency claim. Also, clipping differs from the truncated Gaussian in the paper, do the density calculations account for this? I’ll keep my score for now.
Thanks for the followup. The latency results make the trade-off clear, and the explanation addresses my concern. I’ll raise my score to 3.
Thanks for the added experiments. They help address several of my concerns. However, Appendix C.3 says no 1B responses hit the 256-token limit, so the budget explanation remains unclear. Did the experiments also use the bounded sampler assumed in the theory? I would appreciate clarification on these points. For now, I will keep my score.