arXiv (All)
open access
EPIG-Tree: Compute-Optimal Branching for Gradient-Efficient Reinforcement Learning
Reward-based reinforcement learning for language models, exemplified by Group Relative Policy Optimization (GRPO), collapses an entire stochastic trajectory into a single scalar reward. This is clean and scalable, but it explores and allocates reward inefficiently: a trajectory may contain many caus
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
- Exploring More, Reasoning Better: Stepwise Risk-Sensitive GRPO for Diffusion Language Models#1155596
- Targeting Pivotal Decisions for Credit Assignment in Agentic Reinforcement Learning#1131020
- Learning POMDP World Models from Observations with Language-Model Priors#180661
- Fast-Slow Thinking RM: Efficient Integration of Scalar and Generative Reward Models#1116235
- Multiscale Reward Hedging from Correct Demonstrations#1077929
Record · ID 1033786
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