Matroid bandits: Fast combinatorial optimization with learning

Uncertainty in Artificial Intelligence - Proceedings of the 30th Conference, UAI 2014

Volumn , Issue , 2014, Pages 420-429

  Kveton, Branislav ^a   Wen, Zheng ^a   Ashkan, Azin ^a   Eydgahi, Hoda ^a   Eriksson, Brian ^a  

^a Technicolor Research   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMBINATORIAL OPTIMIZATION; COMPUTATIONAL EFFICIENCY; PROBLEM SOLVING; STOCHASTIC SYSTEMS;

ALGORITHM FOR SOLVING; LOWER BOUNDS; MODULAR FUNCTIONS; PARTITION MATROID; QUANTITIES OF INTERESTS; REAL-WORLD PROBLEM; SUBLINEAR; UPPER BOUND;

COMBINATORIAL MATHEMATICS;

EID: 84923299004     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (26)

1. KIVA. http://build.kiva.org/docs/data, 2013.
2. Jean-Yves Audibert, Sebastien Bubeck, and Gabor Lugosi. Regret in online combinatorial optimization. Mathematics of Operations Research, 39(1):31-45, 2014.
3. Peter Auer, Nicolo Cesa-Bianchi, and Paul Fischer. Finite-time analysis of the multiarmed bandit problem. Machine Learning, 47:235-256, 2002.
4. Sébastien Bubeck and Nicolò Cesa-Bianchi. Regret analysis of stochastic and nonstochastic multi-armed bandit problems. Foundations and Trends in Machine Learning, 2012.
5. Nicolò Cesa-Bianchi and Gábor Lugosi. Combinatorial bandits. Journal of Computer and System Sciences, 78(5):1404-1422, 2012.
6. Wei Chen, Yajun Wang, and Yang Yuan. Combinatorial multi-armed bandit: General framework and applications. In Proceedings of the 30th International Conference on Machine Learning, pages 151-159, 2013.
7. Baek-Young Choi, Sue Moon, Zhi-Li Zhang, Konstantina Papagiannaki, and Christophe Diot. Analysis of point-to-point packet delay in an operational network. In Proceedings of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies, 2004.
8. Jack Edmonds. Matroids and the greedy algorithm. Mathematical Programming, 1(1):127-136, 1971.
9. Jack Edmonds and Delbert Ray Fulkerson. Transversals and matroid partition. Journal of Research of the National Bureau of Standards, 69B(3):147-153, 1965.
10. Victor Gabillon, Branislav Kveton, ZhengWen, Brian Eriksson, and S. Muthukrishnan. Adaptive submodular maximization in bandit setting. In Advances in Neural Information Processing Systems 26, pages 2697-2705, 2013.
11. Victor Gabillon, Branislav Kveton, ZhengWen, Brian Eriksson, and S. Muthukrishnan. Large-scale optimistic adaptive submodularity. In Proceedings of the 28th AAAI Conference on Artificial Intelligence, 2014.
12. Yi Gai, Bhaskar Krishnamachari, and Rahul Jain. Combinatorial network optimization with unknown variables: Multi-armed bandits with linear rewards and individual observations. IEEE/ACM Transactions on Networking, 20(5):1466-1478, 2012.
13. Andrew Guillory and Jeff Bilmes. Online submodular set cover, ranking, and repeated active learning. In Advances in Neural Information Processing Systems 24, pages 1107-1115, 2011.
14. Naoki Katoh. Combinatorial optimization algorithms in resource allocation problems. Encyclopedia of Optimization, pages 259-264, 2001.
15. T. L. Lai and Herbert Robbins. Asymptotically efficient adaptive allocation rules. Advances in Applied Mathematics, 6(1):4-22, 1985.
16. Shyong Lam and Jon Herlocker. MovieLens 1M Dataset. http://www.grouplens.org/node/12, 2012.
17. Rémi Munos. The optimistic principle applied to games, optimization, and planning: Towards foundations of Monte-Carlo tree search. Foundations and Trends in Machine Learning, 2012.
18. G. L. Nemhauser, L. A.Wolsey, and M. L. Fisher. An analysis of approximations for maximizing submodular set functions-I. Mathematical Programming, 14(1):265-294, 1978.
19. Gergely Neu and Gábor Bartók. An efficient algorithm for learning with semi-bandit feedback. In Proceedings of the 24th International Conference on Algorithmic Learning Theory, pages 234-248, 2013.
20. Carlos Oliveira and Panos Pardalos. A survey of combinatorial optimization problems in multicast routing. Computers and Operations Research, 32(8):1953-1981, 2005.
21. James Oxley. Matroid Theory. Oxford University Press, New York, NY, 2011.
22. Christos Papadimitriou and Kenneth Steiglitz. Combinatorial Optimization. Dover Publications, Mineola, NY, 1998.
23. Neil Spring, Ratul Mahajan, and David Wetherall. Measuring ISP topologies with Rocketfuel. IEEE / ACM Transactions on Networking, 12(1):2-16, 2004.
24. Zheng Wen, Branislav Kveton, Brian Eriksson, and Sandilya Bhamidipati. Sequential Bayesian search. In Proceedings of the 30th International Conference on Machine Learning, pages 977-983, 2013.
25. Hassler Whitney. On the abstract properties of linear dependence. American Journal of Mathematics, 57(3):509-533, 1935.
26. Yisong Yue and Carlos Guestrin. Linear submodular bandits and their application to diversified retrieval. In Advances in Neural Information Processing Systems 24, pages 2483-2491, 2011.