Cover Image

Data-Driven Upper Confidence Bounds with Near-Optimal Regret for Heavy-Tailed Bandits

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Tamás, Ambrus, Szentpéteri, Szabolcs, Csáji, Balázs Csanád
Format:	Preprint
Published:	2024
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Distribution-Free Confidence Ellipsoids for Ridge Regression with PAC Bounds
by: Szentpéteri, Szabolcs, et al.
Published: (2026)

Finite Sample Analysis of Distribution-Free Confidence Ellipsoids for Linear Regression
by: Szentpéteri, Szabolcs, et al.
Published: (2024)

Resampled Confidence Regions with Exponential Shrinkage for the Regression Function of Binary Classification
by: Tamás, Ambrus, et al.
Published: (2023)

Finite-Sample Identification of Linear Regression Models with Residual-Permuted Sums
by: Szentpéteri, Szabolcs, et al.
Published: (2024)

Sample Complexity of the Sign-Perturbed Sums Identification Method: Scalar Case
by: Szentpéteri, Szabolcs, et al.
Published: (2024)

Sample Complexity of the Sign-Perturbed Sums Method
by: Szentpéteri, Szabolcs, et al.
Published: (2024)

Recursive Estimation of Conditional Kernel Mean Embeddings
by: Tamás, Ambrus, et al.
Published: (2023)

On Rate-Optimal Partitioning Classification from Observable and from Privatised Data
by: Csáji, Balázs Csanád, et al.
Published: (2023)

Non-Asymptotic State-Space Identification of Closed-Loop Stochastic Linear Systems using Instrumental Variables
by: Szentpéteri, Szabolcs, et al.
Published: (2023)

Derandomizing Simultaneous Confidence Regions for Band-Limited Functions by Improved Norm Bounds and Majority-Voting Schemes
by: Csáji, Balázs Csanád, et al.
Published: (2025)

Improving Kernel-Based Nonasymptotic Simultaneous Confidence Bands
by: Csáji, Balázs Csanád, et al.
Published: (2024)

Gaussian Process Upper Confidence Bound Achieves Nearly-Optimal Regret in Noise-Free Gaussian Process Bandits
by: Iwazaki, Shogo
Published: (2025)

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

Single Image Inpainting and Super-Resolution with Simultaneous Uncertainty Guarantees by Universal Reproducing Kernels
by: Horváth, Bálint, et al.
Published: (2025)

$(ε, u)$-Adaptive Regret Minimization in Heavy-Tailed Bandits
by: Genalti, Gianmarco, et al.
Published: (2023)

Improved Regret Bounds of (Multinomial) Logistic Bandits via Regret-to-Confidence-Set Conversion
by: Lee, Junghyun, et al.
Published: (2023)

Near-Optimal Regret in Adversarial Kernel Bandits
by: Zhang, Yu-Jie, et al.
Published: (2026)

Regret Analysis for Randomized Gaussian Process Upper Confidence Bound
by: Takeno, Shion, et al.
Published: (2024)

Improved Regret Bounds for Gaussian Process Upper Confidence Bound in Bayesian Optimization
by: Iwazaki, Shogo
Published: (2025)

Nearly Minimax Optimal Regret for Multinomial Logistic Bandit
by: Lee, Joongkyu, et al.
Published: (2024)

Regret Tail Characterization of Optimal Bandit Algorithms with Generic Rewards
by: Panda, Subhodip, et al.
Published: (2026)

Near-optimal Per-Action Regret Bounds for Sleeping Bandits
by: Nguyen, Quan, et al.
Published: (2024)

Near-Optimal Regret in Linear MDPs with Aggregate Bandit Feedback
by: Cassel, Asaf, et al.
Published: (2024)

Catoni-Style Change Point Detection for Regret Minimization in Non-Stationary Heavy-Tailed Bandits
by: Genalti, Gianmarco, et al.
Published: (2025)

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

Tackling Heavy-Tailed Rewards in Reinforcement Learning with Function Approximation: Minimax Optimal and Instance-Dependent Regret Bounds
by: Huang, Jiayi, et al.
Published: (2023)

Near-Optimal Regret for Efficient Stochastic Combinatorial Semi-Bandits
by: Ye, Zichun, et al.
Published: (2025)

Near-Optimal Regret for Distributed Adversarial Bandits: A Black-Box Approach
by: Qiu, Hao, et al.
Published: (2026)

Near-Optimal Regret for KL-Regularized Multi-Armed Bandits
by: Ji, Kaixuan, et al.
Published: (2026)

Causal Bandit Over Unknown Graphs: Upper Confidence Bounds With Backdoor Adjustment
by: Zhao, Yijia, et al.
Published: (2025)

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

Optimal Regret for Single Index Bandits
by: Dey, Devdan, 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)

Improved Regret Bounds for Bandits with Expert Advice
by: Cesa-Bianchi, Nicolò, et al.
Published: (2024)

Upper Counterfactual Confidence Bounds: a New Optimism Principle for Contextual Bandits
by: Xu, Yunbei, et al.
Published: (2020)

Satisficing Regret Minimization in Bandits: Constant Rate and Light-Tailed Distribution
by: Feng, Qing, et al.
Published: (2024)

Threshold-Based Optimal Arm Selection in Monotonic Bandits: Regret Lower Bounds and Algorithms
by: Varude, Chanakya, et al.
Published: (2025)

Near-Optimal Streaming Heavy-Tailed Statistical Estimation with Clipped SGD
by: Das, Aniket, et al.
Published: (2024)

Bayesian Optimization from Human Feedback: Near-Optimal Regret Bounds
by: Kayal, Aya, et al.
Published: (2025)

On Lai's Upper Confidence Bound in Multi-Armed Bandits
by: Ren, Huachen, et al.
Published: (2024)