Optimal Multi-Reward Reinforcement Learning
cs.LG, stat.ML
Submitted: 2026-09-29
Updated: 2026-09-29
Terminology
Sources
- Posterior sampling for reinforcement learning: worst-case regret bounds
- Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDP
- Contextual Markov Decision Processes
- Empirical Bernstein Bounds and Sample Variance Penalization
- Improved Bounds for Reward-Agnostic and Reward-Free Exploration
- Is Long Horizon Reinforcement Learning More Difficult Than Short Horizon Reinforcement Learning?
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