English
Related papers

Related papers: Generative modeling with low-rank Wasserstein poly…

200 papers

This paper introduces Tree-based Polynomial Chaos Expansion (Tree-PCE), a novel surrogate modeling technique designed to efficiently approximate complex numerical models exhibiting nonlinearities and discontinuities. Tree-PCE combines the…

Wasserstein barycenter, built on the theory of optimal transport, provides a powerful framework to aggregate probability distributions, and it has increasingly attracted great attention within the machine learning community. However, it…

Machine Learning · Computer Science 2022-12-20 Jinjin Chi , Zhiyao Yang , Jihong Ouyang , Ximing Li

Wasserstein GANs with Gradient Penalty (WGAN-GP) are a very popular method for training generative models to produce high quality synthetic data. While WGAN-GP were initially developed to calculate the Wasserstein 1 distance between…

Machine Learning · Computer Science 2022-07-01 Tristan Milne , Adrian Nachman

Machine learning (ML) surrogate models are increasingly used in engineering analysis and design to replace computationally expensive simulation models, significantly reducing computational cost and accelerating decision-making processes.…

Machine Learning · Statistics 2025-07-22 Xiaoping Du

Machine learning interatomic potentials are revolutionizing large-scale, accurate atomistic modelling in material science and chemistry. Many potentials use atomic cluster expansion or equivariant message passing frameworks. Such frameworks…

Computational Physics · Physics 2024-07-31 Bingqing Cheng

We present a novel multiscale framework for analyzing sequences of probability measures in Wasserstein spaces over Euclidean domains. Exploiting the intrinsic geometry of optimal transport, we construct a multiscale transform applicable to…

Numerical Analysis · Mathematics 2026-04-13 Wael Mattar , Nir Sharon

We consider the optimization problem of minimizing a functional defined over a family of probability distributions, where the objective functional is assumed to possess a variational form. Such a distributional optimization problem arises…

Machine Learning · Computer Science 2024-04-02 Zhuoran Yang , Yufeng Zhang , Yongxin Chen , Zhaoran Wang

A new class of particle systems with sequential interaction is proposed to approximate the McKean-Vlasov process that originally arises as the limit of the mean-field interacting particle system. The weighted empirical measure of this…

Probability · Mathematics 2023-01-25 Kai Du , Yifan Jiang , Xiaochen Li

A novel and efficient algorithm based on the Wiener chaos expansion is proposed for the stochastic Maxwell equations driven by Wiener process. The proposed algorithm can reduce the original stochastic system to the deterministic case and…

Numerical Analysis · Mathematics 2025-08-05 Lihai Ji , Kuan Xue , Liying Zhang

This paper introduces a new generalized polynomial chaos expansion (PCE) comprising multivariate Hermite orthogonal polynomials in dependent Gaussian random variables. The second-moment properties of Hermite polynomials reveal a weakly…

Numerical Analysis · Mathematics 2017-04-27 Sharif Rahman

The paper presents a novel methodology to build surrogate models of complicated functions by an active learning-based sequential decomposition of the input random space and construction of localized polynomial chaos expansions, referred to…

Machine Learning · Computer Science 2023-09-19 Lukáš Novák , Michael D. Shields , Václav Sadílek , Miroslav Vořechovský

Dimensionally decomposed generalized polynomial chaos expansion (DD-GPCE) efficiently performs forward uncertainty quantification (UQ) in complex engineering systems with high-dimensional random inputs of arbitrary distributions. However,…

Numerical Analysis · Mathematics 2026-01-06 Hojun Choi , Eunho Heo , Dongjin Lee

This paper introduces an efficient sparse recovery approach for Polynomial Chaos (PC) expansions, which promotes the sparsity by breaking the dimensionality of the problem. The proposed algorithm incrementally explores sub-dimensional…

Computation · Statistics 2017-04-05 Negin Alemazkoor , Hadi Meidani

This article is a continuation of our first work \cite{chaudruraynal:frikha}. We here establish some new quantitative estimates for propagation of chaos of non-linear stochastic differential equations in the sense of McKean-Vlasov. We…

Analysis of PDEs · Mathematics 2021-08-26 Noufel Frikha , Paul-Eric Chaudru de Raynal

Many scientific systems, such as cellular populations or economic cohorts, are naturally described by probability distributions that evolve over time. Predicting how such a system would have evolved under different forces or initial…

Machine Learning · Statistics 2026-03-26 Tristan Luca Saidi , Gonzalo Mena , Larry Wasserman , Florian Gunsilius

Surrogate modelling techniques have opened up new possibilities to overcome the limitations of computationally intensive numerical models in various areas of engineering and science. However, while fundamental in many engineering…

Numerical Analysis · Mathematics 2024-02-20 José Calos García-Marino , Carmen Calvo-Jurado , Enrique García-Macías

The ability to model relational information using machine learning has driven advancements across various domains, from medicine to social science. While graph representation learning has become mainstream over the past decade, representing…

Machine Learning · Computer Science 2025-06-12 Iulia Duta , Pietro Liò

Data consisting of time-indexed distributions of cross-sectional or intraday returns have been extensively studied in finance, and provide one example in which the data atoms consist of serially dependent probability distributions.…

Methodology · Statistics 2020-06-24 Chao Zhang , Piotr Kokoszka , Alexander Petersen

Anomaly detection plays a pivotal role in numerous real-world scenarios, such as industrial automation and manufacturing intelligence. Recently, variational inference-based anomaly analysis has attracted researchers' and developers'…

Computer Vision and Pattern Recognition · Computer Science 2022-03-10 Yurong Chen

Generative autoencoders learn compact latent representations of data distributions through jointly optimized encoder--decoder pairs. In particular, Wasserstein autoencoders (WAEs) minimize a relaxed optimal transport (OT) objective, where…

Machine Learning · Computer Science 2026-03-25 Moritz Piening , Matthias Chung