Cover Image

Regret Tail Characterization of Optimal Bandit Algorithms with Generic Rewards

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Panda, Subhodip, Agrawal, Shubhada
Format:	Preprint
Published:	2026
Subjects:	Information Theory Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Improved Regret Bounds for Linear Bandits with Heavy-Tailed Rewards
by: Tajdini, Artin, et al.
Published: (2025)

Optimal Top-Two Method for Best Arm Identification and Fluid Analysis
by: Bandyopadhyay, Agniv, et al.
Published: (2024)

Eventually LIL Regret: Almost Sure $\ln\ln T$ Regret for a sub-Gaussian Mixture on Unbounded Data
by: Agrawal, Shubhada, et al.
Published: (2025)

Cover meets Robbins while Betting on Bounded Data: $\ln n$ Regret and Almost Sure $\ln\ln n$ Regret
by: Agrawal, Shubhada, et al.
Published: (2026)

Asymptotically and Minimax Optimal Regret Bounds for Multi-Armed Bandits with Abstention
by: Yang, Junwen, et al.
Published: (2024)

Optimal Regret of Bernoulli Bandits under Global Differential Privacy
by: Azize, Achraf, et al.
Published: (2025)

Optimal Arm Elimination Algorithms for Combinatorial Bandits
by: Wen, Yuxiao, et al.
Published: (2025)

Regret Bounds for Noise-Free Cascaded Kernelized Bandits
by: Li, Zihan, et al.
Published: (2022)

On Instability of Minimax Optimal Optimism-Based Bandit Algorithms
by: Praharaj, Samya, et al.
Published: (2025)

Statistical Complexity and Optimal Algorithms for Non-linear Ridge Bandits
by: Rajaraman, Nived, et al.
Published: (2023)

Multimodal Bandits: Regret Lower Bounds and Optimal Algorithms
by: Réveillard, William, et al.
Published: (2025)

On Stopping Times of Power-one Sequential Tests: Tight Lower and Upper Bounds
by: Agrawal, Shubhada, et al.
Published: (2025)

Optimal Clustering with Bandit Feedback
by: Yang, Junwen, et al.
Published: (2022)

On the Benefits of Free Exploration for Regret Minimization in Multi-Armed Bandits
by: Hou, Yunlong, et al.
Published: (2026)

Regret Distribution in Stochastic Bandits: Optimal Trade-off between Expectation and Tail Risk
by: Simchi-Levi, David, et al.
Published: (2023)

Order-Optimal Sequential 1-Bit Mean Estimation in General Tail Regimes
by: Lau, Ivan, et al.
Published: (2026)

Dual Representation of Minimum Divergence Under Integral Constraints
by: Shekhar, Shubhanshu, et al.
Published: (2026)

Order Optimal Regret Bounds for Sharpe Ratio Optimization under Thompson Sampling
by: Shah, Mohammad Taha, et al.
Published: (2025)

Optimal Best Arm Identification with Fixed Confidence in Restless Bandits
by: Karthik, P. N., et al.
Published: (2023)

Indexed Minimum Empirical Divergence-Based Algorithms for Linear Bandits
by: Bian, Jie, et al.
Published: (2024)

Conversational Dueling Bandits in Generalized Linear Models
by: Yang, Shuhua, et al.
Published: (2024)

Optimal Variance-Dependent Regret Bounds for Infinite-Horizon MDPs
by: Zamir, Guy, et al.
Published: (2026)

Concentration of General Stochastic Approximation Under Heavy-Tailed Markovian Noise
by: Agrawal, Shubhada, et al.
Published: (2026)

Quantum-Enhanced Neural Contextual Bandit Algorithms
by: Huang, Yuqi, et al.
Published: (2026)

Asymptotically Optimal Sequential Testing with Markovian Data
by: Sethi, Alhad, et al.
Published: (2026)

On the Regret of Coded Caching with Adversarial Requests
by: Nayak, Anupam, et al.
Published: (2024)

Best Arm Identification with Minimal Regret
by: Yang, Junwen, et al.
Published: (2024)

FAST: Feature Aware Similarity Thresholding for Weak Unlearning in Black-Box Generative Models
by: Panda, Subhodip, et al.
Published: (2023)

Assouad, Fano, and Le Cam with Interaction: A Unifying Lower Bound Framework and Characterization for Bandit Learnability
by: Chen, Fan, et al.
Published: (2024)

Restless Linear Bandits
by: Khaleghi, Azadeh
Published: (2024)

Span-Based Optimal Sample Complexity for Weakly Communicating and General Average Reward MDPs
by: Zurek, Matthew, et al.
Published: (2024)

The Conditional Regret-Capacity Theorem for Batch Universal Prediction
by: Bondaschi, Marco, et al.
Published: (2025)

Online Prediction of Stochastic Sequences with High Probability Regret Bounds
by: Frey, Matthias, et al.
Published: (2026)

Complexity as Advantage: A Regret-Based Perspective on Emergent Structure
by: Naparstek, Oshri
Published: (2025)

Minimax-Optimal Reward-Agnostic Exploration in Reinforcement Learning
by: Li, Gen, et al.
Published: (2023)

Batched Kernelized Bandits: Refinements and Extensions
by: Ma, Chenkai, et al.
Published: (2026)

Almost Minimax Optimal Best Arm Identification in Piecewise Stationary Linear Bandits
by: Hou, Yunlong, et al.
Published: (2024)

Markov Chain Variance Estimation: A Stochastic Approximation Approach
by: Agrawal, Shubhada, et al.
Published: (2024)

On the Minimax Regret of Sequential Probability Assignment via Square-Root Entropy
by: Jia, Zeyu, et al.
Published: (2025)

Information-Theoretic Minimax Regret Bounds for Reinforcement Learning based on Duality
by: Bongole, Raghav, et al.
Published: (2024)