arXiv Machine Learning

Deep conditional distribution learning via conditional F\"ollmer flow

The paper presents Conditional Föllmer Flow, an ODE‑based deep generative approach for learning conditional distributions. Starting from a Gaussian, the flow approximates the target distribution near time 1, with Euler discretization and a neural‑network‑estimated velocity field. The authors prove convergence in Wasserstein‑2 distance and demonstrate superior performance on both nonparametric density estimation and image‑based tasks compared to existing methods.

arXiv Machine Learning
Jun 18

Generative models for decision-making under distributional shift

arXiv:2604. 04342v2 Announce Type: replace Abstract: Many data-driven decision problems are formulated using a nominal distribution estimated from historical data, while performance is ultimately determined by a deployment distribution that may be shifted, context-dependent, partially observed, or stress-induced.

By Xiuyuan Cheng, Yunqin Zhu, Yao Xie
Hugging Face Trending Papers
Oct 29

Efficient Covariance-Aware Vicinal Latent Diffusion for Continuous Conditional Image Generation

Efficient Covariance-Aware Vicinal Latent Diffusion (CAViLD) is a latent diffusion framework designed for continuous conditional image generation. It builds a purified, condition-aware latent space using density-adaptive vicinal learning, auxiliary semantic regularization, and NIQE-guided negative data augmentation. CAViLD incorporates an EMA teacher to internalize conditional guidance, enabling single-branch inference, and employs covariance-aware progressive distillation to reduce sampling steps to four NFEs, achieving a balance between fidelity, condition consistency, and efficiency on datasets such as RC-49, UTKFace, and Steering Angle.

arXiv Machine Learning
Aug 27

Generative Modeling by Minimizing the Wasserstein-2 Loss

This paper introduces a generative model that minimizes the second‑order Wasserstein loss (W₂) by solving a distribution‑dependent ordinary differential equation (ODE) whose dynamics involve the Kantorovich potential of the true data distribution and its current estimate. The authors prove that the time‑marginal laws of this ODE form a gradient flow for the W₂ loss, converging exponentially to the true data distribution, and propose an Euler scheme that recovers this gradient flow in the limit. An algorithm based on this scheme, combined with persistent training, is shown in experiments to outperform Wasserstein GANs in both low‑ and high‑dimensional settings when the level of persistent training is appropriately increased.

By Yu-Jui Huang, Zachariah Malik
arXiv Machine Learning
Jul 31

Error Analysis of Neural-Network-Based Engression

arXiv:2607. 27723v1 Announce Type: cross Abstract: Engression (Shen and Meinshausen, 2024) learns a conditional distribution by fitting a generative model $Y = f(X,\varepsilon)$ under the energy score, a strictly proper scoring rule.

By Juntong Chen, Zijian Guo, Xinwei Shen