EPIG-Tree: Compute-Optimal Branching for Gradient-Efficient Reinforcement Learning
cs.LG, cs.AI
Submitted: 2026-09-17
Updated: 2026-09-17
Comments: 12 pages, 8 figures
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models
- TreeRL: LLM Reinforcement Learning with On-Policy Tree Search
- TreePO: Bridging the Gap of Policy Optimization and Efficacy and Inference Efficiency with Heuristic Tree-based Modeling
- Proximal Policy Optimization Algorithms
- The Entropy Mechanism of Reinforcement Learning for Reasoning Language Models
- Beyond the 80/20 Rule: High-Entropy Minority Tokens Drive Effective Reinforcement Learning for LLM Reasoning
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: Local-Consistency Optimisation for Bayesian Neural Networks
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks