Distributionally robust optimization: A review
H Rahimian, S Mehrotra - arXiv preprint arXiv:1908.05659, 2019 - arxiv.org
The concepts of risk-aversion, chance-constrained optimization, and robust optimization
have developed significantly over the last decade. Statistical learning community has also …
have developed significantly over the last decade. Statistical learning community has also …
Unbalanced optimal transport, from theory to numerics
Optimal Transport (OT) has recently emerged as a central tool in data sciences to compare
in a geometrically faithful way point clouds and more generally probability distributions. The …
in a geometrically faithful way point clouds and more generally probability distributions. The …
Diffusion models are minimax optimal distribution estimators
While efficient distribution learning is no doubt behind the groundbreaking success of
diffusion modeling, its theoretical guarantees are quite limited. In this paper, we provide the …
diffusion modeling, its theoretical guarantees are quite limited. In this paper, we provide the …
Faster Wasserstein distance estimation with the Sinkhorn divergence
The squared Wasserstein distance is a natural quantity to compare probability distributions
in a non-parametric setting. This quantity is usually estimated with the plug-in estimator …
in a non-parametric setting. This quantity is usually estimated with the plug-in estimator …
Tree mover's distance: Bridging graph metrics and stability of graph neural networks
Understanding generalization and robustness of machine learning models fundamentally
relies on assuming an appropriate metric on the data space. Identifying such a metric is …
relies on assuming an appropriate metric on the data space. Identifying such a metric is …
Distributionally robust optimization and generalization in kernel methods
Distributionally robust optimization (DRO) has attracted attention in machine learning due to
its connections to regularization, generalization, and robustness. Existing work has …
its connections to regularization, generalization, and robustness. Existing work has …
Estimation of wasserstein distances in the spiked transport model
J Niles-Weed, P Rigollet - Bernoulli, 2022 - projecteuclid.org
Estimation of Wasserstein distances in the Spiked Transport Model Page 1 Bernoulli 28(4),
2022, 2663–2688 https://doi.org/10.3150/21-BEJ1433 Estimation of Wasserstein distances …
2022, 2663–2688 https://doi.org/10.3150/21-BEJ1433 Estimation of Wasserstein distances …
Convergence and concentration of empirical measures under Wasserstein distance in unbounded functional spaces
J Lei - 2020 - projecteuclid.org
We provide upper bounds of the expected Wasserstein distance between a probability
measure and its empirical version, generalizing recent results for finite dimensional …
measure and its empirical version, generalizing recent results for finite dimensional …
Minimax estimation of smooth optimal transport maps
JC Hütter, P Rigollet - 2021 - projecteuclid.org
The supplementary materials contain more background on convex functions, wavelets and
empirical processes, as well as tools to prove lower bounds, alternative assumptions based …
empirical processes, as well as tools to prove lower bounds, alternative assumptions based …
How well generative adversarial networks learn distributions
T Liang - Journal of Machine Learning Research, 2021 - jmlr.org
This paper studies the rates of convergence for learning distributions implicitly with the
adversarial framework and Generative Adversarial Networks (GANs), which subsume …
adversarial framework and Generative Adversarial Networks (GANs), which subsume …