Thompson Sampling for Combinatorial Semi-Bandits

13 March 2018

Papers citing "Thompson Sampling for Combinatorial Semi-Bandits"

29 / 79 papers shown

Title
Online Influence Maximization under Linear Threshold Model Shuai Li Fang-yuan Kong Kejie Tang Qizhi Li Wei Chen 15 38 0 12 Nov 2020
Restless-UCB, an Efficient and Low-complexity Algorithm for Online Restless Bandits Siwei Wang Longbo Huang John C. S. Lui OffRL 29 38 0 05 Nov 2020
Adaptive Combinatorial Allocation Maximilian Kasy A. Teytelboym 8 3 0 04 Nov 2020
Experimental Design for Regret Minimization in Linear Bandits Andrew Wagenmaker Julian Katz-Samuels Kevin G. Jamieson 9 16 0 01 Nov 2020
Lenient Regret for Multi-Armed Bandits Nadav Merlis Shie Mannor 8 7 0 10 Aug 2020
Variable Selection via Thompson Sampling Yi Liu Veronika Rockova 13 15 0 01 Jul 2020
Online Competitive Influence Maximization Jinhang Zuo Xutong Liu Carlee Joe-Wong John C. S. Lui Wei Chen 11 11 0 24 Jun 2020
Stochastic Network Utility Maximization with Unknown Utilities: Multi-Armed Bandits Approach Arun Verma M. Hanawal 18 8 0 17 Jun 2020
Statistical Efficiency of Thompson Sampling for Combinatorial Semi-Bandits Pierre Perrault Etienne Boursier Vianney Perchet Michal Valko 18 37 0 11 Jun 2020
Thompson Sampling for Combinatorial Semi-bandits with Sleeping Arms and Long-Term Fairness Constraints Zhiming Huang Yifan Xu Bingshan Hu Qipeng Wang Jianping Pan 8 9 0 14 May 2020
MOTS: Minimax Optimal Thompson Sampling Tianyuan Jin Pan Xu Jieming Shi Xiaokui Xiao Quanquan Gu 31 30 0 03 Mar 2020
An Online Learning Framework for Energy-Efficient Navigation of Electric Vehicles Niklas Åkerblom Yuxin Chen M. Chehreghani 21 15 0 03 Mar 2020
Statistically Efficient, Polynomial Time Algorithms for Combinatorial Semi Bandits Thibaut Cuvelier Richard Combes É. Gourdin 6 21 0 17 Feb 2020
Tight Lower Bounds for Combinatorial Multi-Armed Bandits Nadav Merlis Shie Mannor 11 16 0 13 Feb 2020
On Thompson Sampling for Smoother-than-Lipschitz Bandits James A. Grant David S. Leslie 20 7 0 08 Jan 2020
Unsupervised Online Feature Selection for Cost-Sensitive Medical Diagnosis Arun Verma M. Hanawal N. Hemachandra OOD 12 5 0 25 Dec 2019
Censored Semi-Bandits: A Framework for Resource Allocation with Censored Feedback Arun Verma M. Hanawal A. Rajkumar Raman Sankaran 18 17 0 04 Sep 2019
A Near-Optimal Change-Detection Based Algorithm for Piecewise-Stationary Combinatorial Semi-Bandits Huozhi Zhou Lingda Wang Lav Varshney Ee-Peng Lim 20 18 0 27 Aug 2019
Thompson Sampling for Combinatorial Network Optimization in Unknown Environments Alihan Huyuk Cem Tekin 27 16 0 07 Jul 2019
Adaptive Sensor Placement for Continuous Spaces James A Grant A. Boukouvalas Ryan-Rhys Griffiths David S Leslie Sattar Vakili Enrique Munoz de Cote 21 13 0 16 May 2019
Batch-Size Independent Regret Bounds for the Combinatorial Multi-Armed Bandit Problem Nadav Merlis Shie Mannor 22 26 0 08 May 2019
Exploiting Structure of Uncertainty for Efficient Matroid Semi-Bandits Pierre Perrault Vianney Perchet Michal Valko 17 1 0 11 Feb 2019
A Practical Algorithm for Multiplayer Bandits when Arm Means Vary Among Players Etienne Boursier E. Kaufmann Abbas Mehrabian Vianney Perchet 14 61 0 04 Feb 2019
Thompson Sampling for a Fatigue-aware Online Recommendation System Yunjuan Wang Theja Tulabandhula 13 4 0 23 Jan 2019
Adaptive Policies for Perimeter Surveillance Problems James A. Grant David S. Leslie K. Glazebrook R. Szechtman Adam N. Letchford 24 13 0 04 Oct 2018
Thompson Sampling Algorithms for Cascading Bandits Zixin Zhong Wang Chi Cheung Vincent Y. F. Tan 14 14 0 02 Oct 2018
Analysis of Thompson Sampling for Combinatorial Multi-armed Bandit with Probabilistically Triggered Arms Alihan Huyuk Cem Tekin 17 13 0 07 Sep 2018
Finding the bandit in a graph: Sequential search-and-stop Pierre Perrault Vianney Perchet Michal Valko 9 6 0 06 Jun 2018
Matroid Bandits: Fast Combinatorial Optimization with Learning B. Kveton Zheng Wen Azin Ashkan Hoda Eydgahi Brian Eriksson 46 119 0 20 Mar 2014