Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published 2010 | Published
Book Section - Chapter Open

Online Learning of Assignments

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.

Additional Information

© 2010 Neural Information Processing Systems Foundation. This work was supported in part by Microsoft Corporation through a gift as well as through the Center for Computational Thinking at Carnegie Mellon, by NSF ITR grant CCR-0122581 (The Aladdin Center), and by ONR grant N00014-09-1-1044.

Attached Files

Published - 3719-online-learning-of-assignments.pdf

Files

3719-online-learning-of-assignments.pdf
Files (250.2 kB)
Name Size Download all
md5:d6f81f96da24c09179021fa2e123298d
250.2 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
January 13, 2024