arXiv CS
open access
OPTS-TTPO: Enhancing Finite-Sample Policy-Gradient Learning with Tree Search
The policy-gradient theorem gives the exact gradient under the current policy, but finite on-policy samples may miss rare high-return trajectories. We study whether tree search improves their coverage within a fixed budget while controlling gradient bias. We introduce On-Policy Parallel Tree Search
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
- OPTS-TTPO: Enhancing Finite-Sample Policy-Gradient Learning with Tree Search#1145202
- A Fast and Effective Solution to the Problem of Look-ahead Bias in LLMs#1076018
- Generalizing HVAC Control With Domain Randomized Reinforcement Learning#973447
- Eliciting ESG Preferences for Reinforcement Learning-Based Portfolio Optimization#924820
- Eliciting ESG Preferences for Reinforcement Learning-Based Portfolio Optimization#920586
Record · ID 1136849
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