Reinforcement Learning for Hierarchical Reasoning Rewards: Minimax-Optimal Rates with Transformers
cs.LG, stat.ML
Submitted: 2026-10-06
Updated: 2026-10-06
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- DeepSeek-V4: Towards Highly Efficient Million-Token Context Intelligence
- DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning
- Kimi k1.5: Scaling Reinforcement Learning with LLMs
- Proximal Policy Optimization Algorithms
- Rewarding Progress: Scaling Automated Process Verifiers for LLM Reasoning
- DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models
- DeepSeekMath-V2: Towards Self-Verifiable Mathematical Reasoning
- When Greedy Sampling Explores: KL-Regularized Contextual Bandits without Eluder-Dimension Dependence
- Fine-Tuning Language Models from Human Preferences
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: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks