Master-slave Deep Architecture for Top-K Multi-armed Bandits with Non-linear Bandit Feedback and Diversity Constraints
Not on the map. Why?
Abstract (arXiv)
We propose a novel master-slave architecture to solve the top-K combinatorial multi-armed bandits problem with non-linear bandit feedback and diversity constraints, which, to the best of our knowledge, is the first combinatorial bandits setting considering diversity constraints under bandit feedback. Specifically, to efficiently explore the combinatorial and constrained action space, we introduce six slave models with distinguished merits to generate diversified samples well balancing rewards and constraints as well as efficiency. Moreover, we propose teacher learning based optimization and the policy co-training technique to boost the performance of the multiple slave models. The master model then collects the elite samples provided by the slave models and selects the best sample estimated by a neural contextual UCB-based network to make a decision with a trade-off between exploration and exploitation. Thanks to the elaborate design of slave models, the co-training mechanism among slave models, and the novel interactions between the master and slave models, our approach significantly surpasses existing state-of-the-art algorithms in both synthetic and real datasets for recommendation tasks. The code is available at: urlhttps://github.com/huanghanchi/Master-slave-Algorithm-for-Top-K-Bandits.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 27 of its 61 references that are in the map. First posted on arXiv 24 Aug 2023.
Builds on
27 of 61 references.
References · 27
- 2015Continuous control with deep reinforcement learningcited by 3,407
- 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,739
- 2016Wide & Deep Learning for Recommender Systemscited by 747
- 2017DeepFM: A Factorization-Machine based Neural Network for CTR Predictioncited by 676
- 2016Neural Combinatorial Optimization with Reinforcement Learningcited by 608
- 2018Reward Constrained Policy Optimizationcited by 417
- 2019Exact Combinatorial Optimization with Graph Convolutional Neural Networkscited by 318
- 2017A Semantic Loss Function for Deep Learning with Symbolic Knowledgecited by 270
- 2019Stochastic Beams and Where to Find Them: The Gumbel-Top-k Trick for Sampling Sequences Without Replacementcited by 211
- 2018Top-K Off-Policy Correction for a REINFORCE Recommender Systemcited by 182
- 2015Deep Reinforcement Learning in Large Discrete Action Spacescited by 161
- 2019Weighted Linear Bandits for Non-Stationary Environmentscited by 86
15 more
- 2019Multi-Agent Game Abstraction via Graph Attention Neural Networkcited by 82
- 2018Learning to Branchcited by 78
- 2015Cascading Bandits: Learning to Rank in the Cascade Modelcited by 77
- 2019Beating Stochastic and Adversarial Semi-bandits Optimally and Simultaneouslycited by 53
- 2013A Gang of Banditscited by 49
- 2020Reinforcement Learning for Variable Selection in a Branch and Bound Algorithmcited by 29
- 2019Top-k Combinatorial Bandits with Full-Bandit Feedbackcited by 28
- 2021SAR-Net: A Scenario-Aware Ranking Network for Personalized Fair Recommendation in Hundreds of Travel Scenarioscited by 23
- 2019Exact-K Recommendation via Maximal Clique Optimizationcited by 14
- 2021Causal Incremental Graph Convolution for Recommender System Retrainingcited by 14
- 2019Censored Semi-Bandits: A Framework for Resource Allocation with Censored Feedbackcited by 13
- 2017Revisiting the Master-Slave Architecture in Multi-Agent Deep Reinforcement Learningcited by 12
- 2019Polynomial-time Algorithms for Multiple-arm Identification with Full-bandit Feedbackcited by 8
- 2019Co-training for Policy Learningcited by 6
- 2019DPPNet: Approximating Determinantal Point Processes with Deep Networkscited by 5
Built on by
Not cited yet.