1 citations · 2 across the 4 of their papers we have counts for
4 papers
Efficient Convex Optimization Requires Superlinear Memory
Annie Marsden, Vatsal Sharan, Aaron Sidford +1
We show that any memory-constrained, first-order algorithm which minimizes -dimensional, -Lipschitz convex functions over the unit ball to accuracy using…
Big-Step-Little-Step: Efficient Gradient Methods for Objectives with Multiple Scales
Jonathan Kelner, Annie Marsden, Vatsal Sharan +3
We provide new gradient-based methods for efficiently solving a broad class of ill-conditioned optimization problems. We consider the problem of minimizing a function $f : \mathbb{…
On Misspecification in Prediction Problems and Robustness via Improper Learning
Annie Marsden, John Duchi, Gregory Valiant
We study probabilistic prediction games when the underlying model is misspecified, investigating the consequences of predicting using an incorrect parametric model. We show that fo…
Sequential Matrix Completion
Annie Marsden, Sergio Bacallado
We propose a novel algorithm for sequential matrix completion in a recommender system setting, where the th entry of the matrix corresponds to a user 's rating of product…