Cover Image

Collaborative Min-Max Regret in Grouped Multi-Armed Bandits

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Blanchard, Moïse, Goyal, Vineet
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

Individual Regret in Cooperative Stochastic Multi-Armed Bandits
by: Barnea, Idan, et al.
Published: (2024)

Graph-Dependent Regret Bounds in Multi-Armed Bandits with Interference
by: Jamshidi, Fateme, et al.
Published: (2025)

Bandit Max-Min Fair Allocation
by: Harada, Tsubasa, et al.
Published: (2025)

Unified Framework of Distributional Regret in Multi-Armed Bandits and Reinforcement Learning
by: Lee, Harin, et al.
Published: (2026)

Collaborating in Multi-Armed Bandits with Strategic Agents
by: Barnea, Idan, et al.
Published: (2026)

Stochastic Multi-Objective Multi-Armed Bandits: Regret Definition and Algorithm
by: Davoodi, Mansoor, et al.
Published: (2025)

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

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

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

Understanding Memory-Regret Trade-Off for Streaming Stochastic Multi-Armed Bandits
by: He, Yuchen, et al.
Published: (2024)

Materials Discovery using Max K-Armed Bandit
by: Kikkawa, Nobuaki, et al.
Published: (2022)

Multi-Armed Bandits with Interference
by: Jia, Su, et al.
Published: (2024)

Imprecise Multi-Armed Bandits
by: Kosoy, Vanessa
Published: (2024)

Agnostic Smoothed Online Learning without Knowledge of the Base Measure
by: Blanchard, Moïse
Published: (2024)

Flickering Multi-Armed Bandits
by: Chakraborty, Sourav, et al.
Published: (2026)

Collaborative Multi-Agent Heterogeneous Multi-Armed Bandits
by: Chawla, Ronshee, et al.
Published: (2023)

Online Min-Max Optimization: From Individual Regrets to Cumulative Saddle Points
by: Vyas, Abhijeet, et al.
Published: (2026)

MNL-Bandit with Knapsacks: a near-optimal algorithm
by: Aznag, Abdellah, et al.
Published: (2021)

Multi-Armed Bandits with Network Interference
by: Agarwal, Abhineet, et al.
Published: (2024)

On the Regularity and Fairness of Combinatorial Multi-Armed Bandit
by: Wu, Xiaoyi, et al.
Published: (2025)

Rising Multi-Armed Bandits with Known Horizons
by: Song, Seockbean, et al.
Published: (2026)

Optimal Streaming Algorithms for Multi-Armed Bandits
by: Jin, Tianyuan, et al.
Published: (2024)

Introduction to Multi-Armed Bandits
by: Slivkins, Aleksandrs
Published: (2019)

Tight Gap-Dependent Memory-Regret Trade-Off for Single-Pass Streaming Stochastic Multi-Armed Bandits
by: Ye, Zichun, et al.
Published: (2025)

Autonomous Drug Design with Multi-Armed Bandits
by: Svensson, Hampus Gummesson, et al.
Published: (2022)

Near-Optimal Privacy-Preserving Learning for Max-Min Fair Multi-Agent Bandits
by: Leshem, Amir
Published: (2023)

MinMaxMin $Q$-learning
by: Soffair, Nitsan, et al.
Published: (2024)

Distributed Algorithms for Multi-Agent Multi-Armed Bandits with Collision
by: Zhou, Daoyuan, et al.
Published: (2025)

Stochastic Multi-Armed Bandits with Limited Control Variates
by: Verma, Arun, et al.
Published: (2026)

Optimism in the Face of Ambiguity Principle for Multi-Armed Bandits
by: Li, Mengmeng, et al.
Published: (2024)

Federated Multi-Armed Bandits Under Byzantine Attacks
by: Saday, Artun, et al.
Published: (2022)

Put CASH on Bandits: A Max K-Armed Problem for Automated Machine Learning
by: Balef, Amir Rezaei, et al.
Published: (2025)

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

Multi-Armed Bandits With Best-Action Queries
by: Bacchiocchi, Francesco, et al.
Published: (2026)

Gradient Descent is Pareto-Optimal in the Oracle Complexity and Memory Tradeoff for Feasibility Problems
by: Blanchard, Moise
Published: (2024)

Adversarial Attacks on Combinatorial Multi-Armed Bandits
by: Balasubramanian, Rishab, et al.
Published: (2023)

Unlearning Offline Stochastic Multi-Armed Bandits
by: Ye, Zichun, et al.
Published: (2026)

Heterogeneous Multi-Player Multi-Armed Bandits Robust To Adversarial Attacks
by: Magesh, Akshayaa, et al.
Published: (2025)

On the Low-Complexity of Fair Learning for Combinatorial Multi-Armed Bandit
by: Wu, Xiaoyi, et al.
Published: (2025)

MARBLE: Multi-Armed Restless Bandits in Latent Markovian Environment
by: Amiri, Mohsen, et al.
Published: (2025)