Title: LEARNING TO PONDER: ADAPTIVE REASONING IN LATENT SPACE
Primary area: generative models
Keywords: Adaptive Computation, Test-Time Compute, Dynamic Inference, Fractional Reasoning, Latent Steering, Group Relative Policy Optimization, Value-Free Reinforcement Learning, Large Language Models, Efficient Inference, Compute–Accuracy Trade-off

Abstract: Test-time compute has emerged as a key paradigm for enhancing LLM reasoning, yet prevailing approaches like Best-of-$N$ and majority voting apply uniform depth across inputs, wasting computation on simple queries while potentially under-thinking complex ones.  We present FR‑Ponder, a single‑graph, backbone‑training‑free framework that allocates instance‑adaptive reasoning compute via latent steering. A  less than 1M‑param controller observes hidden states and decides to halt or apply a small ponder step by adding a pre‑computed steering vector to frozen representations. Our method extracts the latent steering vector associated with deeper reasoning outputs and direct IO from LLM and re-applies it through a tunable scaling factor, allowing the model to adapt its reasoning depth to the complexity of each input. To balance performance and computational cost, we employ Group Relative Policy Optimization (GRPO) as a reward signal to adaptively regulate reasoning depth, achieving task accuracy while mitigating overreasoning. Through curriculum learning and careful reward engineering, FR-Ponder learns calibrated compute allocation correlated with problem difficulty. On GSM8K and MATH, FR‑Ponder improves the compute–accuracy frontier, delivering lower FLOPs with better matched accuracy and comparing favorably to early‑exit baselines, without modifying backbone weights. Analyses visualize interpretable steering directions and show learned compute allocation correlates with problem difficulty.