English
Related papers

Related papers: Wasserstein proximal operators describe score-base…

200 papers

Neural Processes (NPs) are a class of models that learn a mapping from a context set of input-output pairs to a distribution over functions. They are traditionally trained using maximum likelihood with a KL divergence regularization term.…

Machine Learning · Computer Science 2020-01-13 Andrew Carr , Jared Nielsen , David Wingate

Score-based diffusion models currently constitute the state of the art in continuous generative modeling. These methods are typically formulated via overdamped or underdamped Ornstein--Uhlenbeck-type stochastic differential equations, in…

Machine Learning · Computer Science 2025-12-22 Herlock Rahimi

A valuable step in the modeling of multiscale dynamical systems in fields such as computational chemistry, biology, materials science and more, is the representative sampling of the phase space over long timescales of interest; this task is…

Machine Learning · Computer Science 2023-12-29 Ellis R. Crabtree , Juan M. Bello-Rivas , Ioannis G. Kevrekidis

We present an estimate of the Wasserstein distance between the data distribution and the generation of score-based generative models. The sampling complexity with respect to dimension is $\mathcal{O}(\sqrt{d})$, with a logarithmic constant.…

Machine Learning · Computer Science 2025-10-06 Xixian Wang , Zhongjian Wang

Score-based generative models (SGMs) are generative models that are in the spotlight these days. Time-series frequently occurs in our daily life, e.g., stock data, climate data, and so on. Especially, time-series forecasting and…

Machine Learning · Computer Science 2023-01-23 Haksoo Lim , Minjung Kim , Sewon Park , Noseong Park

This paper investigates a Stochastic Partial Differential Equation (SPDE) derived from the Fokker-Planck equation associated with Score-based Generative Models. We modify the standard Fokker-Planck equation to better represent practical…

Analysis of PDEs · Mathematics 2025-09-08 Junsu Seo

We propose a deterministic sampling framework using Score-Based Transport Modeling for sampling an unnormalized target density $\pi$ given only its score $\nabla \log \pi$. Our method approximates the Wasserstein gradient flow on…

Machine Learning · Computer Science 2025-10-21 Vasily Ilin , Peter Sushko , Jingwei Hu

We study the machine learning task for models with operators mapping between the Wasserstein space of probability measures and a space of functions, like e.g. in mean-field games/control problems. Two classes of neural networks, based on…

Optimization and Control · Mathematics 2023-09-19 Huyên Pham , Xavier Warin

We provide non asymptotic rates of convergence of the Wasserstein Generative Adversarial networks (WGAN) estimator. We build neural networks classes representing the generators and discriminators which yield a GAN that achieves the minimax…

Statistics Theory · Mathematics 2025-03-13 Arthur Stéphanovitch , Eddie Aamari , Clément Levrard

Functionally graded materials (FGMs) are composites whose composition or microstructure varies continuously in space, producing position-dependent mechanical and functional properties. In recent years, FGMs have gained significant attention…

Materials Science · Physics 2026-03-05 Michael J. Landry , Ryotaro Okabe , Chuliang Fu , Mingda Li

Score-based generative modelling (SGM) has proven to be a very effective method for modelling densities on finite-dimensional spaces. In this work we propose to extend this methodology to learn generative models over functional spaces. To…

Score-based generative models (SGMs) are a popular family of deep generative models that achieve leading image generation quality. Early studies extend SGMs to tackle class-conditional generation by coupling an unconditional SGM with the…

Computer Vision and Pattern Recognition · Computer Science 2024-02-08 Paul Kuo-Ming Huang , Si-An Chen , Hsuan-Tien Lin

Wasserstein gradient flows (WGFs) describe the evolution of probability distributions in Wasserstein space as steepest descent dynamics for a free energy functional. Computing the full path from an arbitrary initial distribution to…

Machine Learning · Computer Science 2026-04-14 Chengyu Liu , Xiang Zhou

Recent advances in generative models have made exploring design spaces easier for de novo molecule generation. However, popular generative models like GANs and normalizing flows face challenges such as training instabilities due to…

Graphs are playing a crucial role in different fields since they are powerful tools to unveil intrinsic relationships among signals. In many scenarios, an accurate graph structure representing signals is not available at all and that…

Machine Learning · Computer Science 2021-05-14 Xiang Zhang , Yinfei Xu , Qinghe Liu , Zhicheng Liu , Jian Lu , Qiao Wang

Generative Adversarial Networks (GANs) have been successful in producing outstanding results in areas as diverse as image, video, and text generation. Building on these successes, a large number of empirical studies have validated the…

Machine Learning · Computer Science 2021-06-21 Gérard Biau , Maxime Sangnier , Ugo Tanielian

We develop a framework of canonical correlation analysis for distribution-valued functional data within the geometry of Wasserstein spaces. Specifically, we formulate an intrinsic concept of correlation between random distributions, propose…

Methodology · Statistics 2021-06-01 Hang Zhou , Zhenhua Lin , Fang Yao

In this paper, we propose a novel numerical scheme to optimize the gradient flows for learning energy-based models (EBMs). From a perspective of physical simulation, we redefine the problem of approximating the gradient flow utilizing…

Computer Vision and Pattern Recognition · Computer Science 2023-05-01 Yang Wu , Pengxu Wei , Liang Lin

We propose a semi-supervised generative model, SeGMA, which learns a joint probability distribution of data and their classes and which is implemented in a typical Wasserstein auto-encoder framework. We choose a mixture of Gaussians as a…

Machine Learning · Computer Science 2020-08-28 Marek Śmieja , Maciej Wołczyk , Jacek Tabor , Bernhard C. Geiger

We study the fixed-support Wasserstein barycenter problem (FS-WBP), which consists in computing the Wasserstein barycenter of $m$ discrete probability measures supported on a finite metric space of size $n$. We show first that the…

Computational Complexity · Computer Science 2022-06-07 Tianyi Lin , Nhat Ho , Xi Chen , Marco Cuturi , Michael I. Jordan