Regret Bounds for Robust Online Decision Making

arXiv:2504.06820 · cs.LG · Submitted 2025-04-09 · Read on arXiv

cs.LG

Submitted: 2025-04-09

Updated: 2025-06-26

Terminology

• Regret — 75× in this paper · explained in 3 episodes
• Reinforcement Learning — 22× in this paper · explained in 4 episodes
• Calibration — 20× in this paper · explained in 7 episodes
• Robust Universal Estimator — 6× in this paper
• Reward Function — 4× in this paper · explained in 2 episodes
• Online Reinforcement Learning — 3× in this paper · explained in 2 episodes
• Action Space — 2× in this paper · explained in 1 episode
• Minimax Regret — 2× in this paper · explained in 2 episodes
• Sample Complexity — 2× in this paper · explained in 15 episodes
• Accuracy — 1× in this paper · explained in 1 episode
• Actor — 1× in this paper · explained in 3 episodes
• Adaptation — 1× in this paper · explained in 1 episode
• Core — 1× in this paper · explained in 2 episodes
• EMMA — 1× in this paper · explained in 2 episodes
• Formal Methods — 1× in this paper · explained in 3 episodes
• Generalization — 1× in this paper · explained in 13 episodes
• Generative Model — 1× in this paper · explained in 2 episodes
• Robust Markov Decision Process — 1× in this paper
• Verification — 1× in this paper · explained in 2 episodes

Sources

• The Statistical Complexity of Interactive Decision Making
• Forecasting using incomplete models

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