Inference-Time Rethinking with Latent Thought Vectors for Math Reasoning
On the map: LLM reasoning → Test-time compute and efficient thinking
Abstract (arXiv)
Standard chain-of-thought reasoning generates a solution in a single forward pass, committing irrevocably to each token and lacking a mechanism to recover from early errors. We introduce Inference-Time Rethinking, a generative framework that enables iterative self-correction by decoupling declarative latent thought vectors from procedural generation. We factorize reasoning into a continuous latent thought vector (what to reason about) and a decoder that verbalizes the trace conditioned on this vector (how to reason). Beyond serving as a declarative buffer, latent thought vectors compress the reasoning structure into a continuous representation that abstracts away surface-level token variability, making gradient-based optimization over reasoning strategies well-posed. Our prior model maps unstructured noise to a learned manifold of valid reasoning patterns, and at test time we employ a Gibbs-style procedure that alternates between generating a candidate trace and optimizing the latent vector to better explain that trace, effectively navigating the latent manifold to refine the reasoning strategy. Training a 0.2B-parameter model from scratch on GSM8K, our method with 30 rethinking iterations surpasses baselines with 10 to 15 times more parameters, including a 3B counterpart. This result demonstrates that effective mathematical reasoning can emerge from sophisticated inference-time computation rather than solely from massive parameter counts.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 15 of its 32 references that are in the map. First posted on arXiv 6 Feb 2026.
Builds on
15 of 32 references.
Closest ancestors · 2
Same direction, newest first
- 2025Think Silently, Think Fast: Dynamic Latent Compression of LLM Reasoning Chains22 May
- 2025Seek in the Dark: Reasoning via Test-Time Instance-Level Policy Gradient in Latent Space19 May
Other references · 13
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2017Proximal Policy Optimization Algorithmscited by 14,441
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 2013Auto-Encoding Variational Bayescited by 3,980
- 2024Qwen2 Technical Reportcited by 2,076
- 2021Are NLP Models really able to Solve Simple Math Word Problems?cited by 861
- 2024Training Large Language Models to Reason in a Continuous Latent Spacecited by 763
- 2024From Explicit CoT to Implicit CoT: Learning to Internalize CoT Step by Stepcited by 225
- 2025CODI: Compressing Chain-of-Thought into Continuous Space via Self-Distillationcited by 216
- 2023Implicit Chain of Thought Reasoning via Knowledge Distillationcited by 165
- 2025Deep Thinking by Markov Chain of Continuous Thoughtscited by 8
1 more
- 2025Generative Actor Criticcited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026Learning to Plan from Random Explorationcited by 0
- 2026Learning to Plan from Random Exploration29 Sep 2026
Similar, not cited
Close in wording, no citation either way
- 2026Efficient Reasoning via Constrained Optimization in Latent Space
- 2026Closing the Loop on Latent Reasoning via Test-Time Reconstruction
- 2026Latent Recurrent Thoughts: Recurrent Refinement of Proposed Latents for Reasoning with Frozen LLMs
- 2025Encode, Think, Decode: Scaling test-time reasoning with recursive latent thoughts
- 2026Geometric Latent Reasoning Induces Shorter Generations in LLMs
- 2026GTS: Inference-Time Scaling of Latent Reasoning with a Learnable Gaussian Thought Sampler
- 2026Thinking in Latents: Adaptive Anchor Refinement for Implicit Reasoning in LLMs
- 2026Latent Reasoning with Supervised Thinking States