nips nips2009 nips2009-181 nips2009-181-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Matthew Streeter, Daniel Golovin, Andreas Krause
Abstract: Which ads should we display in sponsored search in order to maximize our revenue? How should we dynamically rank information sources to maximize the value of the ranking? These applications exhibit strong diminishing returns: Redundancy decreases the marginal utility of each ad or information source. We show that these and other problems can be formalized as repeatedly selecting an assignment of items to positions to maximize a sequence of monotone submodular functions that arrive one by one. We present an efficient algorithm for this general problem and analyze it in the no-regret model. Our algorithm possesses strong theoretical guarantees, such as a performance ratio that converges to the optimal constant of 1 − 1/e. We empirically evaluate our algorithm on two real-world online optimization problems on the web: ad allocation with submodular utilities, and dynamically ranking blogs to detect information cascades. 1
[1] Gagan Aggarwal, Jon Feldman, S. Muthukrishnan, and Martin P´ l. Sponsored search auctions with a markovian users. In WINE, pages 621–628, 2008. o
[2] Peter Auer, Nicol` Cesa-Bianchi, Yoav Freund, and Robert E. Schapire. The nonstochastic multiarmed bandit problem. SIAM Journal on Computing, 32(1):48–77, 2002.
[3] Avrim Blum and Yishay Mansour. From external to internal regret. Journal of Machine Learning Research, 8:1307–1324, 2007.
[4] Gruia Calinescu, Chandra Chekuri, Martin P´ l, and Jan Vondr´ k. Maximizing a submodular set function a a subject to a matroid constraint. SIAM Journal on Computing. To appear.
[5] Nicol` Cesa-Bianchi, Yoav Freund, David Haussler, David P. Helmbold, Robert E. Schapire, and Manfred K. o Warmuth. How to use expert advice. J. ACM, 44(3):427–485, 1997.
[6] Benjamin Edelman, Michael Ostrovsky, and Michael Schwarz. Internet advertising and the generalized second price auction: Selling billions of dollars worth of keywords. American Economic Review, 97(1):242– 259, 2007.
[7] Jon Feldman and S. Muthukrishnan. Algorithmic methods for sponsored search advertising. In Zhen Liu and Cathy H. Xia, editors, Performance Modeling and Engineering. 2008.
[8] Marshall L. Fisher, George L. Nemhauser, and Laurence A. Wolsey. An analysis of approximations for maximizing submodular set functions - II. Mathematical Programming Study, (8):73–87, 1978.
[9] Daniel Golovin, Andreas Krause, and Matthew Streeter. Online learning of assignments that maximize submodular functions. CoRR, abs/0908.0772, 2009.
[10] Sham M. Kakade, Adam Tauman Kalai, and Katrina Ligett. Playing games with approximation algorithms. In STOC, pages 546–555, 2007.
[11] Andreas Krause and Carlos Guestrin. Beyond convexity: Submodularity in machine learning. Tutorial at ICML 2008. http://www.select.cs.cmu.edu/tutorials/icml08submodularity.html.
[12] S´ bastien Lahaie, David M. Pennock, Amin Saberi, and Rakesh V. Vohra. Sponsored search auctions. In e Noam Nisan, Tim Roughgarden, Eva Tardos, and Vijay V. Vazirani, editors, Algorithmic Game Theory. Cambridge University Press, New York, NY, USA, 2007.
[13] Jure Leskovec, Andreas Krause, Carlos Guestrin, Christos Faloutsos, Jeanne VanBriesen, and Natalie Glance. Cost-effective outbreak detection in networks. In KDD, pages 420–429, 2007.
[14] Vahab Mirrokni, Michael Schapira, and Jan Vondr´ k. Tight information-theoretic lower bounds for welfare a maximization in combinatorial auctions. In EC, pages 70–77, 2008.
[15] George L. Nemhauser, Laurence A. Wolsey, and Marshall L. Fisher. An analysis of approximations for maximizing submodular set functions - I. Mathematical Programming, 14(1):265–294, 1978.
[16] Filip Radlinski, Robert Kleinberg, and Thorsten Joachims. Learning diverse rankings with multi-armed bandits. In ICML, pages 784–791, 2008.
[17] Matthew Streeter and Daniel Golovin. An online algorithm for maximizing submodular functions. Technical Report CMU-CS-07-171, Carnegie Mellon University, 2007.
[18] Matthew Streeter and Daniel Golovin. An online algorithm for maximizing submodular functions. In NIPS, pages 1577–1584, 2008.
[19] Jan Vondr´ k. Submodularity in Combinatorial Optimization. PhD thesis, Charles University, Prague, a Czech Republic, 2007.
[20] Jan Vondr´ k. Optimal approximation for the submodular welfare problem in the value oracle model. In a STOC, pages 67–74, 2008. 9