Fetching the paper…
Reading the bibliography…
In this paper, we study the stochastic combinatorial multi-armed bandit (CMAB) framework that allows a general nonlinear reward function, whose expected value may not depend only on the means of the input random variables but possibly on the entire distributions of these variables.
Asymptotic minimax character of the sample distribution function and of the classical multinomial estimator
Aryeh Dvoretzky, Jack Kiefer, and Jacob Wolfowitz · 1956
Earlier work this paper cites.
An analysis of approximations for maximizing submodular set functions – I
George L. Nemhauser, Laurence A. Wolsey, and Marshall L. Fisher · 1978
Earlier work this paper cites.
The foundations of expected utility
P. C. Fishburn · 1982
Earlier work this paper cites.
Asymptotically efficient adaptive allocation rules
Tze Leung Lai and Herbert Robbins · 1985
Earlier work this paper cites.
The tight constant in the dvoretzky-kiefer-wolfowitz inequality
Pascal Massart · 1990
Earlier work this paper cites.
Finite-time analysis of the multiarmed bandit problem
Peter Auer, Nicolo Cesa-Bianchi, and Paul Fischer · 2002
Earlier work this paper cites.
The nonstochastic multiarmed bandit problem
Peter Auer, Nicolo Cesa-Bianchi, Yoav Freund, and Robert E. Schapire · 2002
Earlier work this paper cites.
Asking the right questions: Model-driven optimization using probes
Ashish Goel, Sudipto Guha, and Kamesh Munagala · 2006
Earlier work this paper cites.
An online algorithm for maximizing submodular functions
Matthew Streeter and Daniel Golovin · 2008
Earlier work this paper cites.
Minimax policies for adversarial and stochastic bandits
Jean-Yves Audibert and Sébastien Bubeck · 2009
Cited alongside, same era.
How to probe for an extreme value
Ashish Goel, Sudipto Guha, and Kamesh Munagala · 2010
Cited alongside, same era.
Maximizing expected utility for stochastic combinatorial optimization problems
Jian Li and Amol Deshpande · 2011
Cited alongside, same era.
Regret analysis of stochastic and nonstochastic multi-armed bandit problems
Sébastien Bubeck and Nicolò Cesa-Bianchi · 2012
Cited alongside, same era.
Combinatorial bandits
Nicolo Cesa-Bianchi and Gábor Lugosi · 2012
Cited alongside, same era.
Combinatorial network optimization with unknown variables: Multi-armed bandits with linear rewards and individual observations
Yi Gai, Bhaskar Krishnamachari, and Rahul Jain · 2012
Cited alongside, same era.
Thompson sampling for complex online problems
Aditya Gopalan, Shie Mannor, and Yishay mansour · 2014
Later among the works it cites.
Matroid bandits: Fast combinatorial optimization with learning
Branislav Kveton, Zheng Wen, Azin Ashkan, Hoda Eydgahi, and Brian Eriksson · 2014
Later among the works it cites.
Combinatorial partial monitoring game with linear feedback and its applications
Tian Lin, Bruno Abrahao, Robert Kleinberg, John Lui, and Wei Chen · 2014
Later among the works it cites.
Combinatorial bandits revisited
Richard Combes, M. Sadegh Talebi, Alexandre Proutiere, and Marc Lelarge · 2015
Later among the works it cites.
Combinatorial cascading bandits
Branislav Kveton, Zheng Wen, Azin Ashkan, and Csaba Szepesvári · 2015
Later among the works it cites.
Tight regret bounds for stochastic combinatorial semi-bandits
Branislav Kveton, Zheng Wen, Azin Ashkan, and Csaba Szepesvári · 2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Stochastic combinatorial optimization via poisson approximation
Jian Li and Wen Yuan · 2013
Cited alongside, same era.
A utility equivalence theorem for concave functions
Anand Bhalgat and Sanjeev Khanna · 2014
Cited alongside, same era.
Combinatorial pure exploration of multi-armed bandits
Shouyuan Chen, Tian Lin, Irwin King, Michael R. Lyu, and Wei Chen · 2014
Cited alongside, same era.
Stochastic online greedy learning with semi-bandit feedbacks
Tian Lin, Jian Li, and Wei Chen · 2015
Later among the works it cites.
Combinatorial multi-armed bandit and its extension to probabilistically triggered arms
Wei Chen, Yajun Wang, Yang Yuan, and Qinshi Wang · 2016
Closest in time.
Maximizing expected utility over a knapsack constraint
Jiajin Yu and Shabbir Ahmed · 2016
Closest in time.