paper-with-me

Papers

Adaptive Test-Time Compute Allocation with Evolving In-Context Demonstrations

2026-04-22 · Bowen Zuo, Dongruo Zhou, Yinglun Zhu arxiv

While scaling test-time compute can substantially improve model performance, existing approaches either rely on static compute allocation or sample from fixed generation distributions. In this work, we introduce a test-time compute allocation framework that jointly adapts where computation is spent and how generation is performed. Our method begins with a warm-up phase that identifies easy queries and assembles an initial pool of question-response pairs from the test set itself. An adaptive phase then concentrates further computation on unresolved queries while reshaping their generation distributions through evolving in-context demonstrations -- conditioning each generation on successful responses from semantically related queries rather than resampling from a fixed distribution. Experiments across math, coding, and reasoning benchmarks demonstrate that our approach consistently outperforms existing baselines while consuming substantially less inference-time compute.

📄 PDF Abstract BibTeX arXiv:2604.21018

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Adaptive Reinforcement Learning for Dynamic Configuration Allocation in Pre-Production Testing

2025-10-02 · Yu Zhu arxiv

Ensuring reliability in modern software systems requires rigorous pre-production testing across highly heterogeneous and evolving environments. Because exhaustive evaluation is infeasible, practitioners must decide how t…

Reinforcement Learning

ELASTIC: Efficiently Learning to Adaptively Scale Test-Time Compute for Generative Control Policies

2026-06-30 · Andrew Zou Li, Gokul Swamy, Yonatan Bisk, Andrea Bajcsy arxiv

Generative control policies (GCPs), such as diffusion policies and flow-based vision-language-action models, enable test-time scaling in robot control. Test-time compute can be allocated along two axes: sequential scalin…

Reinforcement LearningRobot Manipulation

ODAR: Principled Adaptive Routing for LLM Reasoning via Active Inference

2026-02-27 · Siyuan Ma, Bo Gao, Xiaojun Jia, Simeng Qin 외 arxiv

The paradigm of large language model (LLM) reasoning is shifting from parameter scaling to test-time compute scaling, yet many existing approaches still rely on uniform brute-force sampling (for example, fixed best-of-N …

Understanding Dynamic Compute Allocation in Recurrent Transformers

2026-02-09 · Ibraheem Muhammad Moosa, Suhas Lohit, Ye Wang, Moitreya Chatterjee 외 arxiv

Token-level adaptive computation seeks to reduce inference cost by allocating more computation to harder tokens and less to easier ones. However, prior work is primarily evaluated on natural-language benchmarks using tas…

Adaptive Test-Time Compute Allocation via Learned Heuristics over Categorical Structure

2026-02-03 · Shuhui Qu arxiv

Test-time computation has become a primary driver of progress in large language model (LLM) reasoning, but it is increasingly bottlenecked by expensive verification. In many reasoning systems, a large fraction of verifie…