arXiv Machine Learning

Statistical Inference for Adversarial Training: Central Limit Theorems via Optimal Transport

The paper rigorously analyzes the statistical and learning-theoretic properties of adversarial training models for classification, focusing on empirical optimal partial transport. It establishes two central limit theorems—one centered at the expected empirical value and another at the population value with smoothing—by leveraging the uniqueness of optimal potentials across various optimal transport formulations and empirical process theory. In the binary setting, the authors prove uniqueness of the optimal potential via a connection to multi-marginal optimal transport, and as additional results they derive stability of the saddle point, sample complexity, and concentration bounds for generalization error.

arXiv Statistics ML
Sep 28

Brenier Meets Adversarial Training: Optimal Transport Geometry for Robust Learning

The paper introduces a penalized distributionally robust optimization framework that allows an adversary to choose any distribution while incurring a Wasserstein penalty for deviating from the empirical distribution. It shows that the adversary’s problem can be reformulated as optimizing transport maps that push empirical samples to adversarial ones, proving that optimal maps are cyclically monotone. The authors argue that standard per-sample adversarial training violates this property and propose two remedies—multi-start particle ascent and input-convex neural network parameterization—to enforce cyclical monotonicity, demonstrating improved robustness and generalization in experiments on regression, image classification, and control tasks.

By Alireza Abdollahpoorrostam, Ehsan Sharifian, Buse \c{S}en, Marco Cuturi, Daniel Kuhn
arXiv AI
Jun 16

Optimal Transport for Machine Learners

arXiv:2505. 06589v2 Announce Type: replace-cross Abstract: Modern machine learning repeatedly manipulates probability measures: empirical datasets, generated samples, latent distributions, class-conditional laws, particle systems, weights of wide networks and attention patterns.

By Gabriel Peyr\'e
arXiv Machine Learning
Oct 9

Barron Optimal Transport I: Generative Modeling

The paper introduces a new optimal transport framework that uses the Barron energy—an intrinsic neural network complexity measure—instead of the traditional kinetic energy. By modeling transport as deep residual networks that map a reference distribution to a target distribution, the authors define a new metric on probability measures and analyze its properties for generative modeling. They demonstrate that diffusion generative models are suboptimal in this Barron geometry and explore how adaptivity can improve alternative generative approaches.

By Evan Dogariu, Joan Bruna
arXiv AI
Nov 6

Deep Barycentric Regression for Optimal Transport Map Estimation and Its Statistical Optimality

The paper introduces BROT, a two-step method for estimating optimal transport maps. First, it computes the unregularized OT plan, then fits a deep neural network to the resulting barycentric targets using least-squares regression. The authors prove that, under standard regularity conditions, BROT achieves the minimax convergence rate for Lipschitz ground-truth OT maps, and demonstrate its effectiveness on synthetic data, an image dataset, and downstream tasks such as single-cell perturbation prediction and unsupervised domain adaptation.

By Kunwoong Kim, Insung Kong, Yongdai Kim
arXiv AI
Sep 10

Deep Barycentric Regression for Optimal Transport Map Estimation and its Statistical Optimality

The paper introduces BROT, a two‑step approach for estimating optimal transport maps. First, it computes the unregularized OT plan, then fits a deep neural network to the resulting barycentric targets using least‑squares regression. The authors prove that, under standard regularity conditions, BROT achieves the minimax convergence rate when the true OT map is Lipschitz, and demonstrate its effectiveness on synthetic data, images, and downstream tasks such as single‑cell perturbation prediction and unsupervised domain adaptation.

By Kunwoong Kim, Insung Kong, Yongdai Kim
arXiv Machine Learning
Nov 2

Exploring Bad Minima in Transfer Learning

The paper investigates whether strong generalization on a source task guarantees transferability to a related target task in transfer learning. The authors hypothesize a negative answer and conduct adversarial attacks on the transfer learning process to find counterexamples. Their empirical results reveal a strong relationship between source-task generalization and transferability, though they do not rule out the possibility that good source generalization is sufficient for successful transfer.

By Mina Remeli