research
∙
06/20/2023
Learning Costs for Structured Monge Displacements
Optimal transport theory has provided machine learning with several tool...
share
research
∙
05/17/2023
The Adversarial Consistency of Surrogate Risks for Binary Classification
We study the consistency of surrogate risks for robust binary classifica...
research
∙
02/28/2023
Sharp thresholds in inference of planted subgraphs
A major question in the study of the Erdős–Rényi random graph is to unde...
research
∙
02/23/2023
Asymptotic confidence sets for random linear programs
Motivated by the statistical analysis of the discrete optimal transport ...
research
∙
01/26/2023
Minimax estimation of discontinuous optimal transport maps: The semi-discrete case
We consider the problem of estimating the optimal transport map between ...
research
∙
12/07/2022
Optimal transport map estimation in general function spaces
We consider the problem of estimating the optimal transport map between ...
research
∙
10/29/2022
Perturbation Analysis of Neural Collapse
Training deep neural networks for classification often includes minimizi...
research
∙
09/22/2022
A second moment proof of the spread lemma
This note concerns a well-known result which we term the “spread lemma,”...
research
∙
09/07/2022
On the Second Kahn–Kalai Conjecture
For any given graph H, we are interested in p_crit(H), the minimal p suc...
research
∙
07/15/2022
Weak limits of entropy regularized Optimal Transport; potentials, plans and divergences
This work deals with the asymptotic distribution of both potentials and ...
research
∙
06/26/2022
The Sketched Wasserstein Distance for mixture distributions
The Sketched Wasserstein Distance (W^S) is a new probability distance sp...
research
∙
06/18/2022
The Consistency of Adversarial Training for Binary Classification
Robustness to adversarial perturbations is of paramount concern in moder...
research
∙
06/13/2022
Asymptotics of smoothed Wasserstein distances in the small noise regime
We study the behavior of the Wasserstein-2 distance between discrete mea...
research
∙
06/01/2022
Distributional Convergence of the Sliced Wasserstein Process
Motivated by the statistical and computational challenges of computing W...
research
∙
04/19/2022
An improved central limit theorem and fast convergence rates for entropic transportation costs
We prove a central limit theorem for the entropic transportation cost be...
research
∙
02/17/2022
Debiaser Beware: Pitfalls of Centering Regularized Transport Maps
Estimating optimal transport (OT) maps (a.k.a. Monge maps) between two m...
research
∙
12/14/2021
The multirank likelihood and cyclically monotone Monte Carlo: a semiparametric approach to CCA
Many analyses of multivariate data are focused on evaluating the depende...
research
∙
09/24/2021
Entropic estimation of optimal transport maps
We develop a computationally tractable method for estimating the optimal...
research
∙
07/26/2021
Plugin Estimation of Smooth Optimal Transport Maps
We analyze a number of natural estimators for the optimal transport map ...
research
∙
07/12/2021
Strong recovery of geometric planted matchings
We study the problem of efficiently recovering the matching between an u...
research
∙
06/24/2021
Sharp Convergence Rates for Empirical Optimal Transport with Smooth Costs
We revisit the question of characterizing the convergence rate of plug-i...
research
∙
06/22/2021
Asymptotics for semi-discrete entropic optimal transport
We compute exact second-order asymptotics for the cost of an optimal sol...
research
∙
02/24/2021
It was "all" for "nothing": sharp phase transitions for noiseless discrete channels
We establish a phase transition known as the "all-or-nothing" phenomenon...
research
∙
02/06/2021
Streaming k-PCA: Efficient guarantees for Oja's algorithm, beyond rank-one updates
We analyze Oja's algorithm for streaming k-PCA and prove that it achieve...
research
∙
01/11/2021
The Discrepancy of Random Rectangular Matrices
A recent approach to the Beck-Fiala conjecture, a fundamental problem in...
research
∙
07/22/2020
The All-or-Nothing Phenomenon in Sparse Tensor PCA
We study the statistical problem of estimating a rank-one sparse tensor ...
research
∙
06/30/2020
Early-Learning Regularization Prevents Memorization of Noisy Labels
We propose a novel framework to perform classification via deep learning...
research
∙
06/30/2020
Sinkhorn EM: An Expectation-Maximization algorithm based on entropic optimal transport
We study Sinkhorn EM (sEM), a variant of the expectation maximization (E...
research
∙
02/08/2020
Supervised Quantile Normalization for Low-rank Matrix Approximation
Low rank matrix factorization is a fundamental building block in machine...
research
∙
09/16/2019
