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: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:2609.23688v1 Announce Type: new
Abstract: We study norm-constrained linear classification under Eu clidean adversarial perturbations in a Gaussian model with a low-dimen sional informative subs...
By Kunyu Wang, Dehan Wang, Wenjun Chen
arXiv:2610.07162v1 Announce Type: new
Abstract: Deep hedging learns trading policies from historical or simulated market trajectories, yet under nonstationarity these training paths may not represent...
By Philipp J. Schneider, Lukas Looser, Antoine Garin, Shuhan Liu, Daniel Kuhn
arXiv:2605. 09200v2 Announce Type: replace Abstract: We study adversarial noisy bandits given a known function class $\mathcal{F}$.
By Steve Hanneke, Kun Wang
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
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
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
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
arXiv:2607. 00207v1 Announce Type: cross Abstract: We develop a framework for analyzing the learning dynamics of $\ell_2$-adversarial training of single-index models on Gaussian mixtures in the high-dimensional limit under streaming stochastic gradient descent (SGD).
By Fabrizzio Sabelli
arXiv:2605. 10792v2 Announce Type: replace-cross Abstract: We propose an implicit neural formulation of optimal transport that eliminates adversarial min--max optimization and multi-network architectures commonly used in existing approaches.
By Yesom Park, Eric Gelphman, Stanley Osher, Samy Wu Fung
We study the problem of \emph{adversarially robust} PAC learning. In this framework, the learner observes independent samples from an unknown distribution over $\mathcal{X} \times \{0,1\}$, as in clas...