arXiv (All)
open access
Information Gain-based Rollout Policy Optimization: An Adaptive Tree-Structured Rollout Approach for Multi-Turn Search Agents
Reinforcement learning (RL) improves large language model (LLM) agents on long-horizon search tasks that require multiple intermediate decisions before a final outcome. However, rollout budgets are often allocated without assessing intermediate-state utility, which can waste computation on unpromisi
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
- Reinforcement Learning in Operational Research: A Technical Review and Practical Roadmap#1051153
- Reinforcement Learning in Operational Research: A Technical Review and Practical Roadmap#1028696
- SAPO: Single-Rollout Autoregressive Policy Optimization for Agentic Reinforcement Learning#793880
- SAPO: Single-Rollout Autoregressive Policy Optimization for Agentic Reinforcement Learning#789861
- Using memory to accelerate planning#1078977
Record · ID 1233914
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