Fetching the paper…
Reading the bibliography…
We improve the efficiency of algorithms for stochastic \emph{combinatorial semi-bandits}.
On the abstract properties of linear dependence
Whitney, H · 1935
Earlier work this paper cites.
Some aspects of the sequential design of experiments
Robbins, H · 1952
Earlier work this paper cites.
Transversals and matroid partition
Edmonds, J. and Fulkerson, D · 1965
Earlier work this paper cites.
Applications of Menger’s graph theorem
Perfect, H · 1968
Earlier work this paper cites.
Comments on bases in dependence structures
Brualdi, R. A · 1969
Earlier work this paper cites.
Matroids and the Greedy Algorithm
Edmonds, J · 1971
Earlier work this paper cites.
An analysis of approximations for maximizing submodular set functions-I
Nemhauser, G. L., Wolsey, L. A., and Fisher, M. L · 1978
Earlier work this paper cites.
Asymptotically efficient adaptive allocation rules
Lai, T. L. and Robbins, H · 1985
Earlier work this paper cites.
Finite-time analysis of the multiarmed bandit problem
Auer, P., Cesa-Bianchi, N., and Fischer, P · 2002
Earlier work this paper cites.
Submodular functions and optimization
Fujishige, S · 2005
Earlier work this paper cites.
A survey of combinatorial optimization problems in multicast routing, 2005
Oliveira, C. A. and Pardalos, P. M · 2005
Earlier work this paper cites.
Combinatorial Optimization: Polyhedra and Efficiency
Schrijver, A · 2008
Earlier work this paper cites.
Hedging structured concepts
Koolen, W., Warmuth, M. K., and Kivinen, J · 2010
Earlier work this paper cites.
Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints
Lee, J., Mirrokni, V. S., Nagarajan, V., and Sviridenko, M · 2010
Earlier work this paper cites.
A contextual-bandit approach to personalized news article recommendation
Li, L., Chu, W., Langford, J., and Schapire, R. E · 2010
Cited alongside, same era.
Efficient Minimization of Decomposable Submodular Functions
Stobbe, P. and Krause, A · 2010
Cited alongside, same era.
Learning with Submodular Functions: A Convex Optimization Perspective
Bach, F · 2011
Cited alongside, same era.
Submodular function maximization
Krause, A. and Golovin, D · 2011
Cited alongside, same era.
Combinatorial bandits
Cesa-Bianchi, N. and Lugosi, G · 2012
Cited alongside, same era.
A tight combinatorial algorithm for submodular maximization subject to a matroid constraint
Filmus, Y. and Ward, J · 2012
Cited alongside, same era.
Regret in online combinatorial optimization
Audibert, J.-Y., Bubeck, S., and Lugosi, G · 2014
Later among the works it cites.
Combinatorial Multi-Armed Bandit and Its Extension to Probabilistically Triggered Arms
Chen, W., Wang, Y., Yuan, Y., and Wang, Q · 2014
Later among the works it cites.
Matroid bandits: Fast combinatorial optimization with learning
Kveton, B., Wen, Z., Ashkan, A., Eydgahi, H., and Eriksson, B · 2014
Later among the works it cites.
Optimal regret minimization in posted-price auctions with strategic buyers
Mohri, M. and Munoz, A · 2014
Later among the works it cites.
Efficient crowdsourcing of unknown experts using bounded multi-armed bandits
Tran-Thanh, L., Stein, S., Rogers, A., and Jennings, N. R · 2014
Later among the works it cites.
Combinatorial bandits revisited
Combes, R., Shahi, M. S. T. M., Proutiere, A., and Others · 2015
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Combinatorial network optimization with unknown variables: Multi-armed bandits with linear rewards and individual observations
Gai, Y., Krishnamachari, B., and Jain, R · 2012
Cited alongside, same era.
Polymatroid Optimization, Submodularity, and Joint Replenishment Games
He, S., Zhang, J., and Zhang, S · 2012
Cited alongside, same era.
Combinatorial Multi-Armed Bandit: General Framework and Applications
Chen, W., Wang, Y., and Yuan, Y · 2013
Cited alongside, same era.
Multi-Armed Bandit with Budget Constraint and Variable Costs
Ding, W., Qin, T., Zhang, X.-d., and Liu, T.-y · 2013
Cited alongside, same era.
An efficient algorithm for learning with semi-bandit feedback
Neu, G. and Bartók, G · 2013
Cited alongside, same era.
Learning to Optimize Via Posterior Sampling
Russo, D. and Van Roy, B · 2013
Cited alongside, same era.
Later among the works it cites.
Tight regret bounds for stochastic combinatorial semi-bandits
Kveton, B., Wen, Z., Ashkan, A., and Szepesvari, C · 2015
Later among the works it cites.
Combinatorial semi-bandit with known covariance
Degenne, R. and Perchet, V · 2016
Later among the works it cites.
An information-theoretic analysis of thompson sampling
Russo, D. and Roy, B. V · 2016
Later among the works it cites.
An Optimal Algorithm for Stochastic Matroid Bandit Optimization
Talebi, M. S. and Proutiere, A · 2016
Later among the works it cites.
Scalable Generalized Linear Bandits: Online Computation and Hashing
Jun, K.-S., Bhargava, A., Nowak, R., and Willett, R · 2017
Later among the works it cites.
Efficient Bandit Combinatorial Optimization Algorithm with Zero-suppressed Binary Decision Diagrams
Sakaue, S., Ishihata, M., and Minato, S.-i · 2018
Later among the works it cites.
Thompson Sampling for Combinatorial Semi-Bandits
Wang, S. and Chen, W · 2018
Later among the works it cites.