31 citations · 37 across the 2 of their papers we have counts for
Showing cs.LGShow all
2 papers · 1 filter
cs.LG2012★ 31 cited
No-Regret Algorithms for Unconstrained Online Convex Optimization
Matthew Streeter, H. Brendan McMahan
Some of the most compelling applications of online convex optimization, including online prediction and classification, are unconstrained: the natural feasible set is R^n. Existing…
cs.LG2009★ 6 cited
Online Learning of Assignments that Maximize Submodular Functions
Daniel Golovin, Andreas Krause, Matthew Streeter
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 applica…