Cover Image

Why Most Optimism Bandit Algorithms Have the Same Regret Analysis: A Simple Unifying Theorem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Krishnamurthy, Vikram
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Systems and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Finite Sample and Large Deviations Analysis of Stochastic Gradient Algorithm with Correlated Noise
by: Yin, George, et al.
Published: (2024)

Structured Reinforcement Learning for Incentivized Stochastic Covert Optimization
by: Jain, Adit, et al.
Published: (2024)

Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds
by: Güçlü, Arda, et al.
Published: (2024)

Interacting Large Language Model Agents. Interpretable Models and Social Learning
by: Jain, Adit, et al.
Published: (2024)

Optimism as Risk-Seeking in Multi-Agent Reinforcement Learning
by: Zhang, Runyu, et al.
Published: (2025)

Bandit Algorithms for Deep Brain Stimulation
by: Gupta, Arkaprava, et al.
Published: (2026)

Regret Analysis: a control perspective
by: Gibson, Travis E., et al.
Published: (2025)

Faster Q-Learning Algorithms for Restless Bandits
by: Kakarapalli, Parvish, et al.
Published: (2024)

Any-Time Regret-Guaranteed Algorithm for Control of Linear Quadratic Systems
by: Chekan, Jafar Abbaszadeh, et al.
Published: (2024)

A Short and Unified Convergence Analysis of the SAG, SAGA, and IAG Algorithms
by: Zhu, Feng, et al.
Published: (2026)

Whittle Index Learning Algorithms for Restless Bandits with Constant Stepsizes
by: Mittal, Vishesh, et al.
Published: (2024)

Cautious Optimism: A Meta-Algorithm for Near-Constant Regret in General Games
by: Soleymani, Ashkan, et al.
Published: (2025)

Nonasymptotic Regret Analysis of Adaptive Linear Quadratic Control with Model Misspecification
by: Lee, Bruce D., et al.
Published: (2023)

Risk-Aware Decision Making in Restless Bandits: Theory and Algorithms for Planning and Learning
by: Akbarzadeh, Nima, et al.
Published: (2024)

Regret Analysis of Policy Optimization over Submanifolds for Linearly Constrained Online LQG
by: Chang, Ting-Jui, et al.
Published: (2024)

Regret Analysis of Multi-task Representation Learning for Linear-Quadratic Adaptive Control
by: Lee, Bruce D., et al.
Published: (2024)

Decentralized Upper Confidence Bound Algorithms for Homogeneous Multi-Agent Multi-Armed Bandits
by: Zhu, Jingxuan, et al.
Published: (2021)

Large Deviations Analysis For Regret Minimizing Stochastic Approximation Algorithms
by: Qian, Hongjiang, et al.
Published: (2024)

Cooperative Multi-Agent Graph Bandits: UCB Algorithm and Regret Analysis
by: Paschalidis, Phevos, et al.
Published: (2024)

Almost Surely $\sqrt{T}$ Regret for Adaptive LQR
by: Lu, Yiwen, et al.
Published: (2023)

Regret Bounds for Expected Improvement Algorithms in Gaussian Process Bandit Optimization
by: Tran-The, Hung, et al.
Published: (2022)

Learning Decentralized Linear Quadratic Regulators with $\sqrt{T}$ Regret
by: Ye, Lintao, et al.
Published: (2022)

A Simple Finite-Time Analysis of TD Learning with Linear Function Approximation
by: Mitra, Aritra
Published: (2024)

Achieving Tractable Minimax Optimal Regret in Average Reward MDPs
by: Boone, Victor, et al.
Published: (2024)

Learning to Sparsify Stochastic Linear Bandits
by: Wang, Zhengmiao, et al.
Published: (2026)

Improved Regret Bound for Safe Reinforcement Learning via Tighter Cost Pessimism and Reward Optimism
by: Yu, Kihyun, et al.
Published: (2024)

Logarithmic Regret and Polynomial Scaling in Online Multi-step-ahead Prediction
by: Qian, Jiachen, et al.
Published: (2025)

Malliavin Calculus with Weak Derivatives for Counterfactual Stochastic Optimization
by: Krishnamurthy, Vikram, et al.
Published: (2025)

Distributionally Robust Regret Optimal Control Under Moment-Based Ambiguity Sets
by: Taha, Feras Al, et al.
Published: (2025)

Identification and Adaptive Control of Markov Jump Systems: Sample Complexity and Regret Bounds
by: Sattar, Yahya, et al.
Published: (2021)

Online Nonstochastic Prediction: Logarithmic Regret via Predictive Online Least Squares
by: Pai, Chih-Fan, et al.
Published: (2026)

Byzantine-Resilient Decentralized Multi-Armed Bandits
by: Zhu, Jingxuan, et al.
Published: (2023)

Explore-then-Commit for Nonstationary Linear Bandits with Latent Dynamics
by: Choi, Sunmook, et al.
Published: (2025)

A Survey on Universal Approximation Theorems
by: Augustine, Midhun T
Published: (2024)

Foundations of Safe Online Reinforcement Learning in the Linear Quadratic Regulator: $\sqrt{T}$-Regret
by: Schiffer, Benjamin, et al.
Published: (2025)

Approximate Thompson Sampling for Learning Linear Quadratic Regulators with $O(\sqrt{T})$ Regret
by: Kim, Yeoneung, et al.
Published: (2024)

Multi-Agent Stage-wise Conservative Linear Bandits
by: Afsharrad, Amirhossein, et al.
Published: (2025)

Cost-Ordered Feasibility for Multi-Armed Bandits with Cost Subsidy
by: Juneja, Ishank, et al.
Published: (2026)

Analysis of the Identifying Regulation with Adversarial Surrogates Algorithm
by: Teichner, Ron, et al.
Published: (2024)

Multi-agent Multi-armed Bandits with Minimum Reward Guarantee Fairness
by: Manupriya, Piyushi, et al.
Published: (2025)