Online Learning of Assignments that Maximize Submodular Functions

Details Online Learning of Assignments that Maximize Submodular Functions Online Learning of Assignments that Maximize Submodular Functions

2009-08-05

arxiv.org/abs/0908.0772v1

Computer Science

Learning

12 pages

Scientific paper

Which ads should we display in sponsored search in order to maximize our revenue? How should we dynamically rank information sources to maximize value of information? These applications exhibit strong diminishing returns: Selection of redundant ads and information sources decreases their marginal utility. 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.

Affiliated with

Also associated with

No associations

Rating

Online Learning of Assignments that Maximize Submodular Functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Online Learning of Assignments that Maximize Submodular Functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Online Learning of Assignments that Maximize Submodular Functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-705444