Combinatorial Multivariant Multi-Armed Bandits with Applications to Episodic Reinforcement Learning and Beyond
Xutong Liu, Siwei Wang, Jinhang Zuo, Han Zhong, Xuchuang Wang, Zhiyong Wang, Shuai Li, Mohammad Hajiesmaili, John C. S. Lui, Wei Chen
Abstract
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 -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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers3
- Near-Optimal Online Deployment and Routing for Streaming LLMsShaoang Li, Jian LiICLR 2026 · 3 citations
- DOPPLER: Dual-Policy Learning for Device Assignment in Asynchronous Dataflow GraphsXinyu Yao, Daniel Bourgeois, Abhinav Jain, Yuxin Tang et al.ICLR 2026
- Offline Learning for Combinatorial Multi-armed BanditsXutong Liu, Xiangxiang Dai, Jinhang Zuo, Siwei Wang et al.ICML 2025
Builds on12
- A Unifying View of Optimism in Episodic Reinforcement LearningGergely Neu, Ciara Pike-BurkeNeurIPS 2020 · 79 citations
- Breaking the Sample Complexity Barrier to Regret-Optimal Model-Free Reinforcement LearningGen Li, Laixi Shi, Yuxin Chen, Yuantao Gu et al.NeurIPS 2021 · 71 citations
- UCB Momentum Q-learning: Correcting the bias without forgettingPierre Ménard, Omar Darwiche Domingues, Xuedong Shang, Michal ValkoICML 2021 · 53 citations
- Batch-Size Independent Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms or Independent ArmsXutong Liu, Jinhang Zuo, Siwei Wang, Carlee Joe-Wong et al.NeurIPS 2022 · 31 citations
- Maximize to Explore: One Objective Function Fusing Estimation, Planning, and ExplorationZhihan Liu, Miao Lu, Wei Xiong, Han Zhong et al.NeurIPS 2023 · 30 citations
Related papers
- Contextual Combinatorial Bandits with Probabilistically Triggered ArmsXutong Liu, Jinhang Zuo, Siwei Wang, John C. S. Lui et al.ICML 2023 · 26 citations
- Uplifting BanditsYu-Guan Hsieh, Shiva Prasad Kasiviswanathan, Branislav KvetonNeurIPS 2022 · 2 citations
- Robust Contextual Combinatorial Multi-Armed Bandits for Unreliable Network SystemsJunkai Wang, Xutong Liu, Jinhang Zuo, Yuedong XuINFOCOM 2025 · 1 citation
- Statistical Efficiency of Thompson Sampling for Combinatorial Semi-BanditsPierre Perrault, Etienne Boursier, Michal Valko, Vianney PerchetNeurIPS 2020 · 45 citations
- Adversarial Attacks on Combinatorial Multi-Armed BanditsRishab Balasubramanian, Jiawei Li, Prasad Tadepalli, Huazheng Wang et al.ICML 2024 · 4 citations
