Individual Regret in Cooperative Stochastic Multi-Armed Bandits
Fuente:
arXiv
Saved in:
| Main Authors: | Barnea, Idan, Lancewicki, Tal, Mansour, Yishay |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Near-optimal Regret Using Policy Optimization in Online MDPs with Aggregate Bandit Feedback
by: Lancewicki, Tal, et al.
Published: (2025)
by: Lancewicki, Tal, et al.
Published: (2025)
Collaborating in Multi-Armed Bandits with Strategic Agents
by: Barnea, Idan, et al.
Published: (2026)
by: Barnea, Idan, et al.
Published: (2026)
Improved Best-of-Both-Worlds Regret for Bandits with Delayed Feedback
by: Schlisselberg, Ofir, et al.
Published: (2025)
by: Schlisselberg, Ofir, et al.
Published: (2025)
The Horizon Threshold in Cooperative Multi-Agent Reward-Free Exploration
by: Barnea, Idan, et al.
Published: (2026)
by: Barnea, Idan, et al.
Published: (2026)
Online Learning in MDPs with Partially Adversarial Transitions and Losses
by: Schlisselberg, Ofir, et al.
Published: (2026)
by: Schlisselberg, Ofir, et al.
Published: (2026)
Batch Ensemble for Variance Dependent Regret in Stochastic Bandits
by: Cassel, Asaf, et al.
Published: (2024)
by: Cassel, Asaf, et al.
Published: (2024)
Regret Minimization and Convergence to Equilibria in General-sum Markov Games
by: Erez, Liad, et al.
Published: (2022)
by: Erez, Liad, et al.
Published: (2022)
Optimal Regret for Policy Optimization in Contextual Bandits
by: Levy, Orin, et al.
Published: (2026)
by: Levy, Orin, et al.
Published: (2026)
Delay as Payoff in MAB
by: Schlisselberg, Ofir, et al.
Published: (2024)
by: Schlisselberg, Ofir, et al.
Published: (2024)
Regret Bounds for Adversarial Contextual Bandits with General Function Approximation and Delayed Feedback
by: Levy, Orin, et al.
Published: (2025)
by: Levy, Orin, et al.
Published: (2025)
Eluder-based Regret for Stochastic Contextual MDPs
by: Levy, Orin, et al.
Published: (2022)
by: Levy, Orin, et al.
Published: (2022)
Non-stochastic Bandits With Evolving Observations
by: Bar-On, Yogev, et al.
Published: (2024)
by: Bar-On, Yogev, et al.
Published: (2024)
Stochastic Multi-Objective Multi-Armed Bandits: Regret Definition and Algorithm
by: Davoodi, Mansoor, et al.
Published: (2025)
by: Davoodi, Mansoor, et al.
Published: (2025)
A Characterization of Semi-Supervised Adversarially-Robust PAC Learnability
by: Attias, Idan, et al.
Published: (2022)
by: Attias, Idan, et al.
Published: (2022)
Understanding Memory-Regret Trade-Off for Streaming Stochastic Multi-Armed Bandits
by: He, Yuchen, et al.
Published: (2024)
by: He, Yuchen, et al.
Published: (2024)
Graph-Dependent Regret Bounds in Multi-Armed Bandits with Interference
by: Jamshidi, Fateme, et al.
Published: (2025)
by: Jamshidi, Fateme, et al.
Published: (2025)
Collaborative Min-Max Regret in Grouped Multi-Armed Bandits
by: Blanchard, Moïse, et al.
Published: (2025)
by: Blanchard, Moïse, et al.
Published: (2025)
Unified Framework of Distributional Regret in Multi-Armed Bandits and Reinforcement Learning
by: Lee, Harin, et al.
Published: (2026)
by: Lee, Harin, et al.
Published: (2026)
Near-Optimal Regret for KL-Regularized Multi-Armed Bandits
by: Ji, Kaixuan, et al.
Published: (2026)
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)
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)
by: Yang, Junwen, et al.
Published: (2024)
Stochastic Multi-Armed Bandits with Limited Control Variates
by: Verma, Arun, et al.
Published: (2026)
by: Verma, Arun, et al.
Published: (2026)
Near-Optimal Regret for Policy Optimization in Contextual MDPs with General Offline Function Approximation
by: Levy, Orin, et al.
Published: (2026)
by: Levy, Orin, et al.
Published: (2026)
Unlearning Offline Stochastic Multi-Armed Bandits
by: Ye, Zichun, et al.
Published: (2026)
by: Ye, Zichun, et al.
Published: (2026)
Tight Gap-Dependent Memory-Regret Trade-Off for Single-Pass Streaming Stochastic Multi-Armed Bandits
by: Ye, Zichun, et al.
Published: (2025)
by: Ye, Zichun, et al.
Published: (2025)
Stealthy Adversarial Attacks on Stochastic Multi-Armed Bandits
by: Wang, Zhiwei, et al.
Published: (2024)
by: Wang, Zhiwei, et al.
Published: (2024)
Towards Noise-Resilient Quantum Multi-Armed and Stochastic Linear Bandits
by: Chen, Zhuoyue, et al.
Published: (2026)
by: Chen, Zhuoyue, et al.
Published: (2026)
Multi-Armed Bandits with Interference
by: Jia, Su, et al.
Published: (2024)
by: Jia, Su, et al.
Published: (2024)
Imprecise Multi-Armed Bandits
by: Kosoy, Vanessa
Published: (2024)
by: Kosoy, Vanessa
Published: (2024)
Meet Me at the Arm: The Cooperative Multi-Armed Bandits Problem with Shareable Arms
by: Hu, Xinyi, et al.
Published: (2025)
by: Hu, Xinyi, et al.
Published: (2025)
The Real Price of Bandit Information in Multiclass Classification
by: Erez, Liad, et al.
Published: (2024)
by: Erez, Liad, et al.
Published: (2024)
Fast Rates for Bandit PAC Multiclass Classification
by: Erez, Liad, et al.
Published: (2024)
by: Erez, Liad, et al.
Published: (2024)
Rising Rested MAB with Linear Drift
by: Amichay, Omer, et al.
Published: (2025)
by: Amichay, Omer, et al.
Published: (2025)
Fast Inference via Hierarchical Speculative Decoding
by: Mohri, Clara, et al.
Published: (2025)
by: Mohri, Clara, et al.
Published: (2025)
Flickering Multi-Armed Bandits
by: Chakraborty, Sourav, et al.
Published: (2026)
by: Chakraborty, Sourav, et al.
Published: (2026)
Competing Bandits: The Perils of Exploration Under Competition
by: Aridor, Guy, et al.
Published: (2020)
by: Aridor, Guy, et al.
Published: (2020)
Cooperative Multi-Agent Graph Bandits: UCB Algorithm and Regret Analysis
by: Paschalidis, Phevos, et al.
Published: (2024)
by: Paschalidis, Phevos, et al.
Published: (2024)
Multi-Armed Bandits with Network Interference
by: Agarwal, Abhineet, et al.
Published: (2024)
by: Agarwal, Abhineet, et al.
Published: (2024)
Modeling Attrition in Recommender Systems with Departing Bandits
by: Ben-Porat, Omer, et al.
Published: (2022)
by: Ben-Porat, Omer, et al.
Published: (2022)
p-Mean Regret for Stochastic Bandits
by: Krishna, Anand, et al.
Published: (2024)
by: Krishna, Anand, et al.
Published: (2024)
Similar Items
-
Near-optimal Regret Using Policy Optimization in Online MDPs with Aggregate Bandit Feedback
by: Lancewicki, Tal, et al.
Published: (2025) -
Collaborating in Multi-Armed Bandits with Strategic Agents
by: Barnea, Idan, et al.
Published: (2026) -
Improved Best-of-Both-Worlds Regret for Bandits with Delayed Feedback
by: Schlisselberg, Ofir, et al.
Published: (2025) -
The Horizon Threshold in Cooperative Multi-Agent Reward-Free Exploration
by: Barnea, Idan, et al.
Published: (2026) -
Online Learning in MDPs with Partially Adversarial Transitions and Losses
by: Schlisselberg, Ofir, et al.
Published: (2026)