Regret Analysis of Retry-Based Bandits

arXiv:2605.20854 · cs.LG · Submitted 2026-05-20 · Read on arXiv

cs.LG

Submitted: 2026-05-20

Updated: 2026-09-29

Terminology

• Regret — 4× in this paper · explained in 3 episodes
• Reinforcement Learning — 1× in this paper · explained in 4 episodes

Sources

• The Best of N Worlds: Aligning Reinforcement Learning with Best-of-N Sampling via max@k Optimisation
• A Tutorial on Bayesian Optimization of Expensive Cost Functions, with Application to Active User Modeling and Hierarchical Reinforcement Learning
• Pass@k Training for Adaptively Balancing Exploration and Exploitation of Large Reasoning Models
• Adam: A Method for Stochastic Optimization
• Retry Policy Gradients in Continuous Action Spaces

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