Statistical Complexity of Soft Bellman Residual Minimization
cs.LG
Submitted: 2025-08-26
Updated: 2026-11-09
Terminology
Sources
- Deep Reinforcement Learning and the Deadly Triad
- An Empirical Risk Minimization Approach for Offline Inverse RL and Dynamic Discrete Choice Model
- Extreme Q-Learning: MaxEnt RL without Entropy
- Global Convergence and Variance-Reduced Optimization for a Class of Nonconvex-Nonconcave Minimax Problems
- Error bounds, PL condition, and quadratic growth for weakly convex functions, and linear convergences of proximal point methods
- Handbook of Convergence Theorems for (Stochastic) Gradient Methods
- Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-\L{}ojasiewicz Condition
Related papers
- A Physics-Regulated Neural Framework for Learning 3D Grain Growth Dynamics
- FlexMoE: Learning One-for-All Multi-Budget Expert Pruning for Flexible MoE Deployment
- OptiMind: Improving Small Language Models for Optimization Modeling through Formulation Guidance and Multi-Turn Learning
- Staying in the Sweet Spot: Boost Reasoning Evolution via Responsive Rollout Difficulty Manipulation
- Examining the Impact of Data and Training Methods on Emergent and Subliminal Misalignment
- Rethinking Black-Box On-Policy Distillation: A Rubric-based Analysis