We give a new framework for solving the fundamental problem of low-rank
...
Discrepancy theory provides powerful tools for producing higher-quality
...
We present a simplified exposition of some pieces of [Gilyén, Su, Low, a...
The development of efficient sampling algorithms catering to non-Euclide...
We give a quantum algorithm for computing an ϵ-approximate Nash
equilibr...
We introduce a new tool for stochastic convex optimization (SCO): a
Rewe...
We propose a new framework for differentially private optimization of co...
Box-simplex games are a family of bilinear minimax objectives which
enca...
We study parallel sampling algorithms for classes of distributions defin...
Sparse recovery is one of the most fundamental and well-studied inverse
...
We design accelerated algorithms with improved rates for several fundame...
We study fast algorithms for statistical regression problems under the s...
We study the problem of list-decodable mean estimation, where an adversa...
We give lower bounds on the performance of two of the most popular sampl...
Traditionally, robust statistics has focused on designing estimators tol...
We show that standard extragradient methods (i.e. mirror prox and dual
e...
We provide algorithms with improved pass and space complexities for
appr...
We give algorithms for sampling several structured logconcave families t...
We develop primal-dual coordinate methods for solving bilinear saddle-po...
Classical iterative algorithms for linear system solving and regression ...
We develop two methods for the following fundamental statistical task: g...
We consider sampling from composite densities on ℝ^d of the form
dπ(x) ∝...
Consider an oracle which takes a point x and returns the minimizer of a
...
We give the first approximation algorithm for mixed packing and covering...
We show that the gradient norm ∇ f(x) for x ∼(-f(x)),
where f is strongl...
We present a randomized primal-dual algorithm that solves the problem
_x...
Optimal transportation, or computing the Wasserstein or “earth mover's”
...
We show that a simple randomized sketch of the matrix multiplicative wei...
In this paper we provide faster algorithms for approximately solving
ℓ_∞...
Word embedding is a useful approach to capture co-occurrence structures ...