141 citations · 285 across the 14 of their papers we have counts for
Showing 2012Show 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.AI2012★ 32 cited
New Techniques for Algorithm Portfolio Design
Matthew Streeter, Stephen F. Smith
We present and evaluate new techniques for designing algorithm portfolios. In our view, the problem has both a scheduling aspect and a machine learning aspect. Prior work has large…