Semi-definite programs represent a frontier of efficient computation. Wh...
Even as machine learning exceeds human-level performance on many
applica...
We analyze the bit complexity of efficient algorithms for fundamental
op...
We analyze Riemannian Hamiltonian Monte Carlo (RHMC) for sampling a poly...
We study the computational complexity of two related problems: recoverin...
We present a polynomial-time algorithm for robustly learning an unknown
...
We study the convergence rate of discretized Riemannian Hamiltonian Mont...
We refine the recent breakthrough technique of Klartag and Lehec to obta...
We study approximation algorithms for the socially fair (ℓ_p,
k)-cluster...
We study a unified approach and algorithm for constructive discrepancy
m...
We study the Riemannian Langevin Algorithm for the problem of sampling f...
The k-cap (or k-winners-take-all) process on a graph works as follows: i...
We demonstrate for the first time that ill-conditioned, non-smooth,
cons...
The success of gradient descent in ML and especially for learning neural...
In lifelong learning, the tasks (or classes) to be learned arrive
sequen...
Assemblies are patterns of coordinated firing across large populations o...
The technique of modifying the geometry of a problem from Euclidean to
H...
The current complexity of regression is nearly linear in the complexity ...
We give a short, self-contained proof of the interior point method and i...
We give a polynomial-time algorithm for the problem of robustly estimati...
We show that the the volume of a convex body in ℝ^n in the
general membe...
We consider the communication complexity of a number of distributed
opti...
We study Hamiltonian Monte Carlo (HMC) for sampling from a strongly
logc...
We prove a convergence guarantee on the unadjusted Langevin algorithm fo...
Sampling logconcave functions arising in statistics and machine learning...
The Kannan-Lovász-Simonovits conjecture says that the Cheeger constant o...
How can we approximate sparse graphs and sequences of sparse graphs (wit...
We give the first rigorous proof of the convergence of Riemannian Hamilt...
We consider the problem of minimizing a convex function over a convex se...
We propose a primitive called PJOIN, for "predictive join," which combin...
We present a simple, general technique for reducing the sample complexit...