mlsanityData to 14 Oct 2026

Combinatorial Multivariant Multi-Armed Bandits with Applications to Episodic Reinforcement Learning and Beyond

arXiv 2406.01386 ↗First posted 3 Jun 2024cs.LGcited by 7

On the map: Deep reinforcement learning methods → RL theory and sample complexity

Abstract (arXiv)

We introduce a novel framework of combinatorial multi-armed bandits (CMAB) with multivariant and probabilistically triggering arms (CMAB-MT), where the outcome of each arm is a d-dimensional multivariant random variable and the feedback follows a general arm triggering process. Compared with existing CMAB works, CMAB-MT not only enhances the modeling power but also allows improved results by leveraging distinct statistical properties for multivariant random variables. For CMAB-MT, we propose a general 1-norm multivariant and triggering probability-modulated smoothness condition, and an optimistic CUCB-MT algorithm built upon this condition. Our framework can include many important problems as applications, such as episodic reinforcement learning (RL) and probabilistic maximum coverage for goods distribution, all of which meet the above smoothness condition and achieve matching or improved regret bounds compared to existing works. Through our new framework, we build the first connection between the episodic RL and CMAB literature, by offering a new angle to solve the episodic RL through the lens of CMAB, which may encourage more interactions between these two important directions.

Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Placed in RL theory and sample complexity, one of 15 directions in Deep reinforcement learning methods. Builds on 37 of its 61 references that are in the map. First posted on arXiv 3 Jun 2024.

Builds on

37 of 61 references.

References · 37

  1. 2019Provably Efficient Reinforcement Learning with Linear Function Approximationcited by 520
  2. 2017Minimax Regret Bounds for Reinforcement Learningcited by 503
  3. 2019Introduction to Multi-Armed Banditscited by 481
  4. 2016Contextual Decision Processes with Low Bellman Rank are PAC-Learnablecited by 292
  5. 2021Bellman Eluder Dimension: New Rich Classes of RL Problems, and Sample-Efficient Algorithmscited by 223
  6. 2021The Statistical Complexity of Interactive Decision Makingcited by 218
  7. 2019Tighter Problem-Dependent Regret Bounds in Reinforcement Learning without Domain Knowledge using Value Function Boundscited by 195
  8. 2021Bilinear Classes: A Structural Framework for Provable Generalization in RLcited by 178
  9. 2017Unifying PAC and Regret: Uniform PAC Bounds for Episodic Reinforcement Learningcited by 176
  10. 2019Non-Asymptotic Gap-Dependent Regret Bounds for Tabular MDPscited by 105
  11. 2020Is Reinforcement Learning More Difficult Than Bandits? A Near-optimal Algorithm Escaping the Curse of Horizoncited by 99
  12. 2014Combinatorial Multi-Armed Bandit and Its Extension to Probabilistically Triggered Armscited by 79
25 more
  1. 2018Thompson Sampling for Combinatorial Semi-Banditscited by 78
  2. 2015Cascading Bandits: Learning to Rank in the Cascade Modelcited by 77
  3. 2019Beating Stochastic and Adversarial Semi-bandits Optimally and Simultaneouslycited by 53
  4. 2021Breaking the Sample Complexity Barrier to Regret-Optimal Model-Free Reinforcement Learningcited by 53
  5. 2020A Unifying View of Optimism in Episodic Reinforcement Learningcited by 52
  6. 2021UCB Momentum Q-learning: Correcting the bias without forgettingcited by 46
  7. 2022GEC: A Unified Framework for Interactive Decision Making in MDP, POMDP, and Beyondcited by 46
  8. 2017Improving Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms and Its Applicationscited by 45
  9. 2023Settling the Sample Complexity of Online Reinforcement Learningcited by 45
  10. 2015Combinatorial Cascading Banditscited by 40
  11. 2021Beyond Value-Function Gaps: Improved Instance-Dependent Regret Bounds for Episodic Reinforcement Learningcited by 34
  12. 2016Combinatorial semi-bandit with known covariancecited by 24
  13. 2023Maximize to Explore: One Objective Function Fusing Estimation, Planning, and Explorationcited by 20
  14. 2019Combinatorial Bandits with Relative Feedbackcited by 19
  15. 2023A Framework for Adapting Offline Algorithms to Solve Combinatorial Multi-Armed Bandit Problems with Bandit Feedbackcited by 19
  16. 2023Contextual Combinatorial Bandits with Probabilistically Triggered Armscited by 18
  17. 2023Combinatorial Neural Banditscited by 16
  18. 2022Batch-Size Independent Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms or Independent Armscited by 15
  19. 2019Batch-Size Independent Regret Bounds for the Combinatorial Multi-Armed Bandit Problemcited by 14
  20. 2021Nearly Optimal Policy Optimization with Stable at Any Time Guaranteecited by 13
  21. 2023Bandit Multi-linear DR-Submodular Maximization and Its Applications on Adversarial Submodular Banditscited by 13
  22. 2021Combinatorial Multi-armed Bandits for Resource Allocationcited by 10
  23. 2021Multi-layered Network Exploration via Random Walks: From Offline Optimization to Online Learningcited by 6
  24. 2023When Combinatorial Thompson Sampling meets Approximation Regretcited by 6
  25. 2020Online Competitive Influence Maximizationcited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 6; 2026: 1.

7 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026Unified Framework of Distributional Regret in Multi-Armed Bandits and Reinforcement Learning
  2. 2024GINO-Q: Learning an Asymptotically Optimal Index Policy for Restless Multi-armed Bandits
  3. 2024Combinatorial Rising Bandits
  4. 2021Combinatorial Bandits without Total Order for Arms
  5. 2024Selective Reviews of Bandit Problems in AI via a Statistical View
  6. 2025Non-Stationary Restless Multi-Armed Bandits with Provable Guarantee
  7. 2024Provably Efficient Reinforcement Learning for Adversarial Restless Multi-Armed Bandits with Unknown Transitions and Bandit Feedback
  8. 2025Networked Restless Multi-Arm Bandits with Reinforcement Learning