$R^3$-Bench is introduced, which evaluates six-problem suites under shared budgets across mathematics, competitive programming, and abstract reasoning in tool-free and agentic settings, and exposes a persistent gap between demonstrated competence and shared-budget realization.
Abstract
In cognitive science, resource rationality asks how an agent should allocate limited computation to maximize expected value. Most reasoning and agent benchmarks use independent per-task budgets; existing shared-budget studies do not calibrate suite performance against the same model's demonstrated single-problem competence. We introduce $R^3$-Bench, which evaluates six-problem suites under shared budgets across mathematics, competitive programming, and abstract reasoning in tool-free and agentic settings. Matched single-problem response curves define an offline empirical oracle over observed successes. Across 72 main-table cells for six models, the oracle mean matches or exceeds the contest mean in all cells and is strictly higher in 71. Under moderate tool-free pressure, equal-allocation replay also exceeds contest performance for four of six models. Trajectory diagnostics reveal limited strategy updating and pressure-dependent failure patterns. In a three-model diagnostic under strong agentic pressure, at least one fixed scheduler exceeds the contest mean in six of nine cells, but no policy dominates across domains. These results expose a persistent gap between demonstrated competence and shared-budget realization.
EcoAgent-Bench is introduced, in which every task specifies priced actions and an explicit budget, and results show that completion under a budget and economical action selection are distinct properties.
Jie Wu, Ming Gong, Feixiang Cheng et al.· 1 citation
Multi-agent large language model (LLM) systems can improve reasoning by spending more computation, but deployment requires deciding when extra collaboration is worth its cost, so confidence can support initial escalation, while protocol-specific cost-aware routing remains unresolved.
Chih-Hsuan Yang, Jingyan Jiang, Cheng-Hau Yang et al.· 0 citations
VEX$^2$, a verbal exploration--exploitation scheduler that uses a language model to jointly select policies and allocate the remaining trial budget is proposed, and VEX$^2$ is the only evaluated update to achieve positive observed success-rate gains over retry in all six settings.
Yu Bai, Yukai Miao, Dawei Wang et al.· 0 citations
This work proposes DualViewEval, an agent benchmark compression method that jointly exploits outcome and process relations to learn an exact-size miniset and predict the full-benchmark scores, and achieves the best results in all datasets.
Xin-Shuai Guo, Jun-Jie Wu, Dolly Deng et al.· 0 citations
By periodically pruning unpromising trajectories and immediately branching from high-quality prefixes, Gambit dynamically concentrates compute onto the most promising reasoning traces via a light-weight scorer probing hidden states while maintaining continuous high hardware utilization.
Lijie Yang, Hongyin Luo, Jia-Wei Zhao et al.· 0 citations
Standard evaluation of large language models is challenged by varying the token generation budget, i.e., the maximum tokens a model may produce, across seven levels, evaluating four models on three reasoning benchmarks, and finding three findings that argue for budget-conditioned evaluation protocols.
Rodrigo Guedes de Souza, Alison R. Panisson· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.