Paper

{
  "raw_xml": "<entry>\n    <id>http://arxiv.org/abs/2603.15051v1</id>\n    <title>Thinking in Latents: Adaptive Anchor Refinement for Implicit Reasoning in LLMs</title>\n    <updated>2026-03-16T10:06:05Z</updated>\n    <link href='https://arxiv.org/abs/2603.15051v1' rel='alternate' type='text/html'/>\n    <link href='https://arxiv.org/pdf/2603.15051v1' rel='related' title='pdf' type='application/pdf'/>\n    <summary>Token-level Chain-of-Thought (CoT) prompting has become a standard way to elicit multi-step reasoning in large language models (LLMs), especially for mathematical word problems. However, generating long intermediate traces increases output length and inference cost, and can be inefficient when the model could arrive at the correct answer without extensive verbalization. This has motivated latent-space reasoning approaches that shift computation into hidden representations and only emit a final answer. Yet, many latent reasoning methods depend on a fixed number of latent refinement steps at inference, adding another hyperparameter that must be tuned across models and datasets to balance accuracy and efficiency. We introduce AdaAnchor, a latent reasoning framework that performs silent iterative computation by refining a set of latent anchor vectors attached to the input. AdaAnchor further incorporates an adaptive halting mechanism that monitors anchor stability across iterations and terminates refinement once the anchor dynamics converge, allocating fewer steps to easier instances while reserving additional refinement steps for harder ones under a shared maximum-step budget. Our empirical evaluation across three mathematical word-problem benchmarks shows that AdaAnchor with adaptive halting yields accuracy gains of up to 5% over fixed-step latent refinement while reducing average latent refinement steps by 48-60% under the same maximum-step budget. Compared to standard reasoning baselines, AdaAnchor achieves large reductions in generated tokens (92-93%) by moving computation into silent latent refinement, offering a different accuracy-efficiency trade-off with substantially lower output-token usage.</summary>\n    <category scheme='http://arxiv.org/schemas/atom' term='cs.CL'/>\n    <category scheme='http://arxiv.org/schemas/atom' term='cs.AI'/>\n    <category scheme='http://arxiv.org/schemas/atom' term='cs.LG'/>\n    <published>2026-03-16T10:06:05Z</published>\n    <arxiv:comment>Accepted at ICLR 2026, LIT Workshop</arxiv:comment>\n    <arxiv:primary_category term='cs.CL'/>\n    <author>\n      <name>Disha Sheshanarayana</name>\n    </author>\n    <author>\n      <name>Rajat Subhra Pal</name>\n    </author>\n    <author>\n      <name>Manjira Sinha</name>\n    </author>\n    <author>\n      <name>Tirthankar Dasgupta</name>\n    </author>\n  </entry>"
}