213 citations · 229 across the 2 of their papers we have counts for
2 papers
cs.LG2009★ 16 cited
A Stochastic View of Optimal Regret through Minimax Duality
Jacob Abernethy, Alekh Agarwal, Peter L. Bartlett +1
We study the regret of optimal strategies for online convex optimization games. Using von Neumann's minimax theorem, we show that the optimal regret in this adversarial setting is…
cs.LG2008★ 213 cited
A New Approach to Collaborative Filtering: Operator Estimation with Spectral Regularization
Jacob Abernethy, Francis Bach, Theodoros Evgeniou +1
We present a general approach for collaborative filtering (CF) using spectral regularization to learn linear operators from "users" to the "objects" they rate. Recent low-rank type…