Large-scale optimistic adaptive submodularity

Proceedings of the National Conference on Artificial Intelligence

Volumn 3, Issue , 2014, Pages 1816-1823

  Gabillon, Victor ^a   Kveton, Branislav ^b   Wen, Zheng ^c   Eriksson, Brian ^b   Muthukrishnan, S ^d  

^a INRIA   (France)

^b Technicolor Labs   (United States)

^c Stanford University   (United States)

^d RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SUBMODULARITY;

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

References (26)

1. Abbasi-Yadkori, Y.; Pal, D.; and Szepesvari, C. 2011. Improved algorithms for linear stochastic bandits. In Advances in Neural Information Processing Systems 24, 2312-2320.
2. Auer, P. 2002. Using confidence bounds for exploitationexploration trade-offs. Journal of Machine Learning Research 3:397-22.
3. Bhamidipati, S.; Kveton, B.; and Muthukrishnan, S. 2013. Minimal interaction search: Multi-way search with item categories. In Proceedings of AAAI Workshop on Intelligent Techniques for Web Personalization and Recommendation.
4. Butko, N., and Movellan, J. 2009. Optimal scanning for faster object detection. In Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
5. Dani, V.; Hayes, T.; and Kakade, S. 2008. Stochastic linear optimization under bandit feedback. In Proceedings of the 21st Annual Conference on Learning Theory, 355-366.
6. Filippi, S.; Cappé, O.; Garivier, A.; and Szepesvári, C. 2010. Parametric bandits: The generalized linear case. In Advances in Neural Information Processing Systems 23, 586-594.
7. Filippi, S. 2010. Optimistic Strategies in Reinforcement Learning. Ph. D. Dissertation, École nationale supérieure des télécommunications - ENST.
8. Gabillon, V.; Kveton, B.; Wen, Z.; Eriksson, B.; and Muthukrishnan, S. 2013. Adaptive submodular maximization in bandit setting. In Advances in Neural Information Processing Systems 26, 2697-2705.
9. Golovin, D., and Krause, A. 2011. Adaptive submodularity: Theory and applications in active learning and stochastic optimization. Journal of Artificial Intelligence Research 42:427-486.
10. Guillory, A., and Bilmes, J. 2011. Simultaneous learning and covering with adversarial noise. In Proceedings of the 28th International Conference on Machine Learning, 369-376.
11. Kempe, D.; Kleinberg, J.; and Tardos, É. 2003. Maximizing the spread of influence through a social network. In Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 137-146.
12. Koren, Y.; Bell, R.; and Volinsky, C. 2009. Matrix factorization techniques for recommender systems. IEEE Computer 42(8):30-37.
13. Krause, A.; Singh, A. P.; and Guestrin, C. 2008. Nearoptimal sensor placements in Gaussian processes: Theory, efficient algorithms and empirical studies. Journal of Machine Learning Research 9:235-284.
14. Lam, S., and Herlocker, J. 2013. MovieLens 1M Dataset. http://www.grouplens.org/node/12.
15. Li, L.; Chu, W.; Langford, J.; and Schapire, R. 2010. A contextual-bandit approach to personalized news article recommendation. In Proceedings of the 19th International Conference on World Wide Web.
16. McCullagh, P., and Nelder, J. A. 1989. Generalized Linear Models. Chapman & Hall.
17. Nemhauser, G. L.; Wolsey, L. A.; and Fisher, M. L. 1978. An analysis of approximations for maximizing submodular set functions - I. Mathematical Programming 14(1):265-294.
18. 2013. Netflix. http://www.netflix.com.
19. Pineau, J.; Gordon, G.; and Thrun, S. 2003. Point-based value iteration: An anytime algorithm for POMDPs. In Proceedings of the 18th International Joint Conference on Artificial Intelligence, 1025-1032.
20. Sondik, E. 1971. The Optimal Control of Partially Observable Markov Decision Processes. Ph. D. Dissertation, Stanford University.
21. Sutton, R., and Barto, A. 1998. Reinforcement Learning: An Introduction. Cambridge, MA: MIT Press.
22. Tarabanis, K.; Allen, P.; and Tsai, R. 1995. A survey of sensor planning in computer vision. IEEE Transactions on Robotics and Automation 11(1):86-104.
23. UCSD. 2013. MPLab GENKI Database. http://mplab.ucsd.edu.
24. Vijayanarasimhan, S., and Kapoor, A. 2010. Visual recognition and detection under bounded computational resources. In Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
25. Wen, Z.; Kveton, B.; Eriksson, B.; and Bhamidipati, S. 2013. Sequential Bayesian search. In Proceedings of the 30th International Conference on Machine Learning, 977-983.
26. Yue, Y., and Guestrin, C. 2011. Linear submodular bandits and their application to diversified retrieval. In Advances in Neural Information Processing Systems 24, 2483-2491.