arXiv (All)
open access
Optimizing Anytime Reasoning via Budget Relative Policy Optimization
Scaling test-time compute is crucial for enhancing the reasoning capabilities of large language models (LLMs). Existing approaches typically employ reinforcement learning (RL) to maximize a verifiable reward obtained at the end of reasoning traces. However, such methods optimize only the final perfo
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Apriel-Reasoner: RL Post-Training for General-Purpose and Efficient Reasoning#984141
- On the Pitfalls of Verbalized Confidence Priors for Calibrating Large Reasoning Models#1116801
- LSR-Ben: A Logical and Scientific Reasoning Benchmark for Evaluating Process Reward Models#1143744
- Not All Reasoning Generalizes: A Case Study on Learning Generalizable Reasoning Strategies in RLVR#1520911
- Learned Reporting Preferences in RLVR Can Conflict with the Current Request#1131788
Record · ID 1534881
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive