Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales
Search
Open menu
Home
Papers
1410.0949
Cited By
v1
v2
v3 (latest)
Tight Regret Bounds for Stochastic Combinatorial Semi-Bandits
International Conference on Artificial Intelligence and Statistics (AISTATS), 2014
3 October 2014
Branislav Kveton
Zheng Wen
Azin Ashkan
Csaba Szepesvári
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Tight Regret Bounds for Stochastic Combinatorial Semi-Bandits"
22 / 22 papers shown
Fully Dynamic Online Selection through Online Contention Resolution Schemes
AAAI Conference on Artificial Intelligence (AAAI), 2023
Vashist Avadhanula
A. Celli
Riccardo Colini-Baldeschi
S. Leonardi
M. Russo
300
1
0
08 Jan 2023
Batch-Size Independent Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms or Independent Arms
Neural Information Processing Systems (NeurIPS), 2022
Xutong Liu
Jinhang Zuo
Siwei Wang
Carlee Joe-Wong
John C. S. Lui
Wei Chen
415
28
0
31 Aug 2022
Online Learning of Independent Cascade Models with Node-level Feedback
Mathematics of Operations Research (MOR), 2021
Shuoguang Yang
Van-Anh Truong
301
6
0
06 Sep 2021
Combinatorial Pure Exploration with Full-bandit Feedback and Beyond: Solving Combinatorial Optimization under Uncertainty with Limited Observation
Yuko Kuroki
Junya Honda
Masashi Sugiyama
OffRL
384
1
0
31 Dec 2020
Statistically Efficient, Polynomial Time Algorithms for Combinatorial Semi Bandits
Proceedings of the ACM on Measurement and Analysis of Computing Systems (POMACS), 2020
Thibaut Cuvelier
Richard Combes
É. Gourdin
286
24
0
17 Feb 2020
Contextual Combinatorial Conservative Bandits
Xiaojin Zhang
Shuai Li
Weiwen Liu
Shengyu Zhang
171
7
0
26 Nov 2019
Top-k Combinatorial Bandits with Full-Bandit Feedback
International Conference on Algorithmic Learning Theory (ALT), 2019
Idan Rejwan
Yishay Mansour
365
58
0
28 May 2019
A Practical Algorithm for Multiplayer Bandits when Arm Means Vary Among Players
Etienne Boursier
E. Kaufmann
Abbas Mehrabian
Vianney Perchet
500
67
0
04 Feb 2019
Online Learning for Measuring Incentive Compatibility in Ad Auctions
Zhe Feng
Okke Schrijvers
Eric Sodomka
203
22
0
21 Jan 2019
Thompson Sampling Algorithms for Cascading Bandits
Zixin Zhong
Wang Chi Cheung
Vincent Y. F. Tan
450
18
0
02 Oct 2018
Offline Evaluation of Ranking Policies with Click Models
Shuai Li
Yasin Abbasi-Yadkori
Branislav Kveton
S. Muthukrishnan
Vishwa Vinay
Zheng Wen
CML
OffRL
178
73
0
27 Apr 2018
Multi-Armed Bandits on Partially Revealed Unit Interval Graphs
Xiao Xu
Sattar Vakili
Qing Zhao
A. Swami
237
6
0
12 Feb 2018
Trend Detection based Regret Minimization for Bandit Problems
Paresh Nakhe
Rebecca Reiffenhäuser
66
0
0
15 Sep 2017
Combinatorial Semi-Bandits with Knapsacks
Karthik Abinav Sankararaman
Aleksandrs Slivkins
331
58
0
23 May 2017
Combinatorial semi-bandit with known covariance
Rémy Degenne
Vianney Perchet
206
51
0
06 Dec 2016
Combinatorial Multi-Armed Bandit with General Reward Functions
Wei Chen
Wei Hu
Fu Li
Jiacheng Li
Yu Liu
Pinyan Lu
419
147
0
20 Oct 2016
Phased Exploration with Greedy Exploitation in Stochastic Combinatorial Partial Monitoring Games
Neural Information Processing Systems (NeurIPS), 2016
Sougata Chaudhuri
Ambuj Tewari
192
21
0
23 Aug 2016
Cascading Bandits for Large-Scale Recommendation Problems
Shi Zong
Hao Ni
Kenny Sung
Nan Rosemary Ke
Zheng Wen
Branislav Kveton
357
129
0
17 Mar 2016
Combinatorial Cascading Bandits
Neural Information Processing Systems (NeurIPS), 2015
Branislav Kveton
Zheng Wen
Azin Ashkan
Csaba Szepesvári
337
114
0
15 Jul 2015
Networked Stochastic Multi-Armed Bandits with Combinatorial Strategies
Shaojie Tang
Yaqin Zhou
209
11
0
20 Mar 2015
Contextual Semibandits via Supervised Learning Oracles
A. Krishnamurthy
Alekh Agarwal
Miroslav Dudík
OffRL
541
23
0
20 Feb 2015
Combinatorial Multi-Armed Bandit and Its Extension to Probabilistically Triggered Arms
Journal of machine learning research (JMLR), 2014
Wei Chen
Yajun Wang
Yang Yuan
Qinshi Wang
618
305
0
31 Jul 2014
1
Page 1 of 1
