Cover Image

Catoni-Style Change Point Detection for Regret Minimization in Non-Stationary Heavy-Tailed Bandits

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Genalti, Gianmarco, Bhatt, Sujay, Gatti, Nicola, Metelli, Alberto Maria
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Bridging Rested and Restless Bandits with Graph-Triggering: Rising and Rotting
by: Genalti, Gianmarco, et al.
Published: (2024)

Autoregressive Bandits
by: Bacchiocchi, Francesco, et al.
Published: (2022)

Data-Dependent Regret Bounds for Constrained MABs
by: Genalti, Gianmarco, et al.
Published: (2025)

Catoni Contextual Bandits are Robust to Heavy-tailed Rewards
by: Ye, Chenlu, et al.
Published: (2025)

Replicable Constrained Bandits
by: Bollini, Matteo, et al.
Published: (2026)

Information Capacity Regret Bounds for Bandits with Mediator Feedback
by: Eldowa, Khaled, et al.
Published: (2024)

A Best-of-Both-Worlds Algorithm for Constrained MDPs with Long-Term Constraints
by: Germano, Jacopo, et al.
Published: (2023)

Generalized Kernelized Bandits: A Novel Self-Normalized Bernstein-Like Dimension-Free Inequality and Regret Bounds
by: Metelli, Alberto Maria, et al.
Published: (2025)

Sliding-Window Thompson Sampling for Non-Stationary Settings
by: Fiandri, Marco, et al.
Published: (2024)

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

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

Regret Minimization for Piecewise Linear Rewards: Contracts, Auctions, and Beyond
by: Bacchiocchi, Francesco, et al.
Published: (2025)

Online Packet Scheduling with Deadlines and Learning
by: Genalti, Gianmarco, et al.
Published: (2026)

Data-Driven Upper Confidence Bounds with Near-Optimal Regret for Heavy-Tailed Bandits
by: Tamás, Ambrus, et al.
Published: (2024)

Bayesian Regret Minimization in Offline Bandits
by: Petrik, Marek, et al.
Published: (2023)

Thompson Sampling-like Algorithms for Stochastic Rising Bandits
by: Fiandri, Marco, et al.
Published: (2025)

Partially Observable Contextual Bandits with Linear Payoffs
by: Zeng, Sihan, et al.
Published: (2024)

Achieving $\widetilde{\mathcal{O}}(\sqrt{T})$ Regret in Average-Reward POMDPs with Known Observation Models
by: Russo, Alessio, et al.
Published: (2025)

No-Regret Reinforcement Learning in Smooth MDPs
by: Maran, Davide, et al.
Published: (2024)

Open Problem: Tight Bounds for Kernelized Multi-Armed Bandits with Bernoulli Rewards
by: Mussi, Marco, et al.
Published: (2024)

Rising Rested Bandits: Lower Bounds and Efficient Algorithms
by: Fiandri, Marco, et al.
Published: (2024)

Efficient Swap Regret Minimization in Combinatorial Bandits
by: Kontogiannis, Andreas, et al.
Published: (2026)

No-Regret is not enough! Bandits with General Constraints through Adaptive Regret Minimization
by: Bernasconi, Martino, et al.
Published: (2024)

Non-Stationary Lipschitz Bandits
by: Nguyen, Nicolas, et al.
Published: (2025)

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

Improved Regret Analysis in Gaussian Process Bandits: Optimality for Noiseless Reward, RKHS norm, and Non-Stationary Variance
by: Iwazaki, Shogo, et al.
Published: (2025)

Optimal Strong Regret and Violation in Constrained MDPs via Policy Optimization
by: Stradi, Francesco Emanuele, et al.
Published: (2024)

Best Arm Identification for Stochastic Rising Bandits
by: Mussi, Marco, et al.
Published: (2023)

Performance Improvement Bounds for Lipschitz Configurable Markov Decision Processes
by: Metelli, Alberto Maria
Published: (2024)

Adaptive Smooth Non-Stationary Bandits
by: Suk, Joe
Published: (2024)

Optimal Dynamic Regret by Transformers for Non-Stationary Reinforcement Learning
by: Chen, Baiyuan, et al.
Published: (2025)

Heavy-Tailed Linear Bandits: Huber Regression with One-Pass Update
by: Wang, Jing, et al.
Published: (2025)

Regret Minimization via Saddle Point Optimization
by: Kirschner, Johannes, et al.
Published: (2024)

Non-Stationary Bandit Learning via Predictive Sampling
by: Liu, Yueyang, et al.
Published: (2022)

Near-Optimal Algorithm for Non-Stationary Kernelized Bandits
by: Iwazaki, Shogo, et al.
Published: (2024)

Best-of-Both-Worlds Policy Optimization for CMDPs with Bandit Feedback
by: Stradi, Francesco Emanuele, et al.
Published: (2024)

Smooth Non-Stationary Bandits
by: Jia, Su, et al.
Published: (2023)

Incentivized Exploration of Non-Stationary Stochastic Bandits
by: Chakraborty, Sourav, et al.
Published: (2024)

Non-Stationary Latent Auto-Regressive Bandits
by: Trella, Anna L., et al.
Published: (2024)