Related papers: Sample complexity for divergence regularized optim…
While the convergence behaviors of stochastic gradient methods are well understood \emph{in expectation}, there still exist many gaps in the understanding of their convergence with \emph{high probability}, where the convergence rate has a…
In Bayesian statistics, a continuity property of the posterior distribution with respect to the observable variable is crucial as it expresses well-posedness, i.e., stability with respect to errors in the measurement of data. Essentially,…
In this paper, we introduce methods from convex optimization to solve the multimarginal transport type problems arise in the context of density functional theory. Convex relaxations are used to provide outer approximation to the set of…
Recently there has been a surge of interest in understanding implicit regularization properties of iterative gradient-based optimization algorithms. In this paper, we study the statistical guarantees on the excess risk achieved by…
We study the problem of differentially private stochastic convex optimization (DP-SCO) with heavy-tailed gradients, where we assume a $k^{\text{th}}$-moment bound on the Lipschitz constants of sample functions rather than a uniform bound.…
Semi-discrete optimal transport problems, which evaluate the Wasserstein distance between a discrete and a generic (possibly non-discrete) probability measure, are believed to be computationally hard. Even though such problems are…
We prove upper bounds on the $L^\infty$-Wasserstein distance from optimal transport between strongly log-concave probability densities and log-Lipschitz perturbations. In the simplest setting, such a bound amounts to a transport-information…
Entropic Brenier maps are regularized analogues of Brenier maps (optimal transport maps) which converge to Brenier maps as the regularization parameter shrinks. In this work, we prove quantitative stability bounds between entropic Brenier…
We develop a higher regularity theory for general quasilinear elliptic equations and systems in divergence form with random coefficients. The main result is a large-scale $L^\infty$-type estimate for the gradient of a solution. The estimate…
This paper is devoted to variational problems on the set of probability measures which involve optimal transport between unequal dimensional spaces. In particular, we study the minimization of a functional consisting of the sum of a term…
We prove decay estimates in the interior for solutions to elliptic equations in divergence form with Lipschitz continuous coefficients. The estimates explicitly depend on the distance from the boundary and on suitable notions of frequency…
We prove existence of an optimal transport map in the Monge-Kantorovich problem associated to a cost $c(x,y)$ which is not finite everywhere, but coincides with $|x-y|^2$ if the displacement $y-x$ belongs to a given convex set $C$ and it is…
Multi-marginal optimal transport (MOT) is a generalization of optimal transport to multiple marginals. Optimal transport has evolved into an important tool in many machine learning applications, and its multi-marginal extension opens up for…
In this paper, we study two problems: (1) estimation of a $d$-dimensional log-concave distribution and (2) bounded multivariate convex regression with random design with an underlying log-concave density or a compactly supported…
We establish improved hypoelliptic estimates on the solutions of kinetic transport equations, using a suitable decomposition of the phase space. Our main result shows that the relative compactness in all variables of a bounded family…
We study the iteration complexity of Lipschitz convex optimization problems satisfying a general error bound. We show that for this class of problems, subgradient descent with either Polyak stepsizes or decaying stepsizes achieves minimax…
The aim of this short note is to extend the recent variational proof of partial regularity for optimal transport maps to the case of continuous densities.
Estimating Wasserstein distances between two high-dimensional densities suffers from the curse of dimensionality: one needs an exponential (wrt dimension) number of samples to ensure that the distance between two empirical measures is…
The quadratically regularized optimal transport problem is empirically known to have sparse solutions: its optimal coupling $\pi_{\varepsilon}$ has sparse support for small regularization parameter $\varepsilon$, in contrast to entropic…
The optimal transport problem has recently developed into a powerful framework for various applications in estimation and control. Many of the recent advances in the theory and application of optimal transport are based on regularizing the…