PonderLM-3: Adaptive Token-Wise Pondering with Differentiable Masking
On the map: LLM reasoning → Test-time compute and efficient thinking
Abstract (arXiv)
Test-time scaling has shown that allocating more additional computation at inference can improve generation quality, motivating a natural follow-up question: where should this computation be spent? Building on this insight, we introduce PonderLM-3, a pretraining framework for token-wise adaptive pondering that learns to selectively allocate additional computation under purely self-supervised objectives, built on top of the PonderLM-2 backbone. This makes additional inference computation an allocatable per-token resource, so tokens receive more computation only when it is beneficial, rather than paying a uniform extra cost. To make this allocation learnable while maintaining train-inference consistency, PonderLM-3 injects a differentiable attention mask during pretraining and pairs it with a matching hard pruning rule at inference. PonderLM-3 defines a stronger Pareto frontier: compared with existing recursive or adaptive baselines, it achieves lower pretraining perplexity at equal inference FLOPs. On downstream benchmarks, PonderLM-3 attains comparable performance to fixed-step PonderLM-2 under the same maximum number of additional computation steps, while using fewer inference FLOPs in practice. Overall, PonderLM-3 provides an end-to-end differentiable and train-inference consistent framework for token-wise adaptive computation, enabling additional inference compute to be allocated where it is most useful rather than paid uniformly by every token.
Key facts. Cited by 3 papers 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 33 of its 37 references that are in the map. First posted on arXiv 2 Mar 2026.
Builds on
33 of 37 references.
Closest ancestors · 9
Same direction, newest first
- 2025EAGer: Entropy-Aware GEneRation for Adaptive Inference-Time Scaling13 Oct
- 2025Learning to Ponder: Adaptive Reasoning in Latent Space29 Sep
- 2025PonderLM-2: Pretraining LLM with Latent Thoughts in Continuous Space27 Sep
- 2025Deep Think with Confidence21 Aug
- 2025Reasoning with Latent Thoughts: On the Power of Looped Transformers24 Feb
- 2025Inner Thinking Transformer: Leveraging Dynamic Depth Scaling to Foster Adaptive Internal Thinking19 Feb
- 2025Scaling up Test-Time Compute with Latent Reasoning: A Recurrent Depth Approach7 Feb
- 2024Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters6 Aug
- 2023Think before you speak: Training Language Models With Pause Tokens3 Oct
Other references · 24
- 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,302
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
- 2020The Pile: An 800GB Dataset of Diverse Text for Language Modelingcited by 2,346
- 2022Fast Inference from Transformers via Speculative Decodingcited by 1,615
- 2016The LAMBADA dataset: Word prediction requiring a broad discourse contextcited by 960
- 2017RACE: Large-scale ReAding Comprehension Dataset From Examinationscited by 851
- 2024Training Large Language Models to Reason in a Continuous Latent Spacecited by 763
- 2017Crowdsourcing Multiple Choice Science Questionscited by 742
12 more
- 2016Adaptive Computation Time for Recurrent Neural Networkscited by 479
- 2024LayerSkip: Enabling Early Exit Inference and Self-Speculative Decodingcited by 302
- 2022Confident Adaptive Language Modelingcited by 297
- 2024Quiet-STaR: Language Models Can Teach Themselves to Think Before Speakingcited by 292
- 2024Mixture-of-Depths: Dynamically allocating compute in transformer-based language modelscited by 242
- 2023Looped Transformers as Programmable Computerscited by 224
- 2021PonderNet: Learning to Pondercited by 156
- 2025Mixture-of-Recursions: Learning Dynamic Recursive Depths for Adaptive Token-Level Computationcited by 120
- 2024Fast Best-of-N Decoding via Speculative Rejectioncited by 112
- 2025Dynamic Chunking for End-to-End Hierarchical Sequence Modelingcited by 65
- 2023Guiding Language Model Reasoning with Planning Tokenscited by 58
- 2025PonderLM: Pretraining Language Models to Ponder in Continuous Spacecited by 44
Built on by
Citing papers per year: 2026: 3.
3 papers.
Similar, not cited
Close in wording, no citation either way
- 2026AdaPonderLM: Gated Pondering Language Models with Token-Wise Adaptive Depth
- 2025Catch Your Breath: Adaptive Computation for Self-Paced Sequence Production
- 2026Adaptive Test-Time Compute Allocation for Reasoning LLMs via Constrained Policy Optimization
- 2026Compute Where it Counts: Self Optimizing Language Models
- 2026Probe and Skip: Self-Predictive Token Skipping for Efficient Long-Context LLM Inference
- 2025A*-Decoding: Token-Efficient Inference Scaling
- 2026Recirculation
- 2025A Theory of Inference Compute Scaling: Reasoning through Directed Stochastic Skill Search