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:2610.33610v1 Announce Type: new
Abstract: Conditional generative models parameterized by triangular transport maps are widely used for conditional sampling, yet theoretical guarantees on the qu...
By Michele Martino, Bamdad Hosseini, Amir Sagiv, Amirhossein Taghvaei
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 Distribution‑Conditioned Transport (DCT), a framework that learns transport maps conditioned on embeddings of source and target distributions, allowing generalization to unseen distribution pairs. DCT supports semi‑supervised learning for distributional forecasting by leveraging distributions observed at only one condition. It is agnostic to the transport mechanism and is demonstrated on synthetic benchmarks and four biological applications, including batch effect transfer in single‑cell genomics and modeling T‑cell receptor sequence evolution.
By Nic Fishman, Gokul Gowri, Paolo L. B. Fischer, Marinka Zitnik, Omar Abudayyeh, Jonathan Gootenberg
The paper introduces a transformer-based framework that learns an in‑context score operator for diffusion models, allowing the model to perform reverse‑diffusion sampling on unseen target distributions specified by a small empirical context set. By representing the task‑dependent score as a Gaussian‑kernel conditional mean and approximating it with a transformer‑based query‑dependent attention architecture, the method can adapt to new tasks without retraining or parameter updates. The authors provide theoretical generalization‑error bounds and evaluate the approach on scientific and visual datasets, noting strong performance on simple task families and limitations as task complexity grows.
By Wuzhe Xu, Zhaiming Shen, Yulong Lu, Wenjing Liao, Rongjie Lai
arXiv:2606. 08802v1 Announce Type: new Abstract: Standard flow and diffusion pre-training matches the distribution of available data (e.
By Riccardo De Santi, Bruce Lee, Cristian Perez Jensen, Kimon Protopapas, Sophia Tang, Cheng-Hao Liu, Pranam Chatterjee, Yisong Yue, Andreas Krause