5 papers
Fast, Parallel, Query-Efficient Binary Classification
Ishani Karmarkar, Liam O'Carroll, Aaron Sidford
We study the fundamental classification problem of computing a separating hyperplane for a binary-labeled dataset of size with normalized -dimensional features. Letting $Φ\…
Solving Matrix Games with Near-Optimal Matvec Complexity
Ishani Karmarkar, Liam O'Carroll, Aaron Sidford
We study the problem of computing an -approximate Nash equilibrium of a two-player, bilinear game with a bounded payoff matrix , when the players…
Solving Zero-Sum Games with Fewer Matrix-Vector Products
Ishani Karmarkar, Liam O'Carroll, Aaron Sidford
In this paper we consider the problem of computing an -approximate Nash Equilibrium of a zero-sum game in a payoff matrix with -bounded en…
Isotropic Noise in Stochastic and Quantum Convex Optimization
Annie Marsden, Liam O'Carroll, Aaron Sidford +1
We consider the problem of minimizing a -dimensional Lipschitz convex function using a stochastic gradient oracle. We introduce and motivate a setting where the noise of the sto…
Extracting Dual Solutions via Primal Optimizers
Yair Carmon, Arun Jambulapati, Liam O'Carroll +1
We provide a general method to convert a "primal" black-box algorithm for solving regularized convex-concave minimax optimization problems into an algorithm for solving the associa…