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:2606. 30574v1 Announce Type: new Abstract: Many modern generative modeling methods, including diffusion models, normalizing flows, and flow matching, estimate transport maps or plans between distributions without explicitly targeting an optimal transport (OT) map.
By Sivaraman Balakrishnan
arXiv:2607. 04360v1 Announce Type: cross Abstract: Conditional generative models have emerged as powerful tools for sampling from target conditional distributions, driving substantial advances across a wide range of scientific and applied domains.
By Shijin Gong, Baihua He, Xinyu Zhang
arXiv:2601. 08379v2 Announce Type: replace-cross Abstract: Pre-trained diffusion models have emerged as powerful generative priors for both unconditional and conditional sample generation, yet their outputs often deviate from the characteristics of user-specific target data.
By Matina Mahdizadeh Sani, Nima Jamali, Mohammad Jalali, Farzan Farnia
Many modern generative modeling methods, including diffusion models, normalizing flows, and flow matching, estimate transport maps or plans between distributions without explicitly targeting an optimal transport (OT) map. In applications like generative modeling, the transport cost itself is irrelevant, and this makes it natural to target maps which are more tractable from either a statistical or computational standpoint.
Conditional generative models have emerged as powerful tools for sampling from target conditional distributions, driving substantial advances across a wide range of scientific and applied domains. As these models proliferate, practitioners often face multiple plausible generators whose performance can vary with the task, data, or input condition.
The paper introduces a model‑agnostic inference framework for partially identified causal effects that leverages covariate information without requiring discrete covariates or accurate conditional distribution estimates. Using duality theory for optimal transport, the method delivers uniformly valid inference in randomized experiments, is doubly robust in observational settings, achieves asymptotic unbiasedness when nuisance parameters converge semiparametrically, and allows multiplier‑bootstrap selection of covariates and models while remaining computationally efficient. Empirical applications show the approach consistently narrows identified sets and confidence intervals without imposing extra structural assumptions.
By Wenlong Ji, Lihua Lei, Asher Spector
arXiv:2610.35490v1 Announce Type: cross
Abstract: We study minimax rates for conditional generative learning under integrated Wasserstein loss, with H\"older continuous conditional laws and an unrest...
By Sungwon Park, Kyoung-Sook Moon, Hongjoong Kim
arXiv:2608. 10470v1 Announce Type: new Abstract: Fair representation learning with a continuous sensitive attribute $S$ requires a representation $Z$ that is statistically independent of $S$.
By Yijin Ni, Xiaoming Huo
The paper introduces a unified framework for measuring divergences between conditional distributions using kernel embeddings, termed conditional maximum mean discrepancy (CMMD). It defines a family of CMMD metrics—CMMD_0, CMMD_1, and CMMD_2—each based on different RKHS embeddings, and generalizes them to a level‑s CMMD with clear assumptions and operator‑based smoothing connections. Additionally, the authors present a novel doubly robust estimator for CMMD and demonstrate through experiments that the metric captures complex conditional dependencies for statistical testing.
By Peter Moskvichev, Siu Lun Chau, Dino Sejdinovic
arXiv:2410. 01244v2 Announce Type: replace-cross Abstract: We introduce a novel Wasserstein-1 ($W_1$) path-space divergence for stochastic and deterministic dynamics and establish a Wasserstein Uncertainty Propagation (WUP) theorem that bounds the $W_1$ distance between terminal distributions by the proposed divergence, equivalently characterized by a weighted $L^2$ discrepancy between the underlying drifts and the $W_1$ distance between their initial measures.
By Ziyu Chen, Markos A. Katsoulakis, Benjamin J. Zhang
arXiv:2609.23789v1 Announce Type: new
Abstract: Modern conditional generative models face significant challenges when learning complex covariate dependencies. While sufficient dimension reduction (SD...
By Wenxi Tan, Bing Li, Lingzhou Xue