English
Related papers

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

200 papers

A spline chaos expansion, referred to as SCE, is introduced for uncertainty quantification analysis. The expansion provides a means for representing an output random variable of interest with respect to multivariate orthonormal basis…

Numerical Analysis · Mathematics 2019-11-12 Sharif Rahman

Distributional causal inference requires estimating not only average treatment effects but also interventional outcome distributions, including quantiles, tail risks, and policy-dependent uncertainty. As a method for distributional causal…

Statistics Theory · Mathematics 2026-05-12 Shu Tamano , Masaaki Imaizumi

Many numerical and learning algorithms rely on the solution of the Monge-Kantorovich problem and Wasserstein distances, which provide appropriate distributional metrics. While the natural approach is to treat the problem as an…

Optimization and Control · Mathematics 2025-12-11 Mohsen Sadr , Peyman Mohajerin Esfahani , Hossein Gorji

The Wasserstein distance has emerged as a key metric to quantify distances between probability distributions, with applications in various fields, including machine learning, control theory, decision theory, and biological systems.…

Machine Learning · Computer Science 2026-02-10 Eduardo Figueiredo , Steven Adams , Luca Laurenti

As non-institutive polynomial chaos expansion (PCE) techniques have gained growing popularity among researchers, we here provide a comprehensive review of major sampling strategies for the least squares based PCE. Traditional sampling…

Computation · Statistics 2018-02-14 Mohammad Hadigol , Alireza Doostan

In many applications in statistics and machine learning, the availability of data samples from multiple possibly heterogeneous sources has become increasingly prevalent. On the other hand, in distributionally robust optimization, we seek…

Machine Learning · Statistics 2022-05-31 Tim Tsz-Kit Lau , Han Liu

Numerical simulation of stochastic differential equations over long time intervals poses significant computational challenges. In this paper, we propose a novel recursive polynomial chaos evolution method that achieves model reduction…

Numerical Analysis · Mathematics 2026-05-06 Guillaume Bal , Shengbo Ma , Su Zhang , Zhiwen Zhang

This paper is concerned by statistical inference problems from a data set whose elements may be modeled as random probability measures such as multiple histograms or point clouds. We propose to review recent contributions in statistics on…

Statistics Theory · Mathematics 2019-08-27 Jérémie Bigot

The challenges for non-intrusive methods for Polynomial Chaos modeling lie in the computational efficiency and accuracy under a limited number of model simulations. These challenges can be addressed by enforcing sparsity in the series…

Machine Learning · Statistics 2020-06-24 Panagiotis Tsilifis , Iason Papaioannou , Daniel Straub , Fabio Nobile

Gradient flow in the 2-Wasserstein space is widely used to optimize functionals over probability distributions and is typically implemented using an interacting particle system with $n$ particles. Analyzing these algorithms requires showing…

Machine Learning · Computer Science 2026-03-27 Chandan Tankala , Dheeraj M. Nagaraj , Anant Raj

In this paper, a risk-aware motion control scheme is considered for mobile robots to avoid randomly moving obstacles when the true probability distribution of uncertainty is unknown. We propose a novel model predictive control (MPC) method…

Robotics · Computer Science 2020-01-15 Astghik Hakobyan , Insoon Yang

We develop a foundational framework for inverse problems governed by evolutionary partial differential equations (PDEs) on the Wasserstein space of probability measures. While the forward problems for such transport-type PDEs have been…

Optimization and Control · Mathematics 2025-12-09 Hongyu Liu , Jianliang Qian , Shen Zhang

Bayesian analysis enables combining prior knowledge with measurement data to learn model parameters. Commonly, one resorts to computing the maximum a posteriori (MAP) estimate, when only a point estimate of the parameters is of interest. We…

Machine Learning · Statistics 2024-08-08 Felix Schneider , Iason Papaioannou , Bruno Sudret , Gerhard Müller

In the field of modern high-energy physics research, there is a growing emphasis on utilizing deep learning techniques to optimize event simulation, thereby expanding the statistical sample size for more accurate physical analysis.…

Computational Physics · Physics 2025-06-16 Chu-Cheng Pan , Xiang Dong , Yu-Chang Sun , Ao-Yan Cheng , Ao-Bo Wang , Yu-Xuan Hu , Hao Cai

This paper provides a simple procedure to fit generative networks to target distributions, with the goal of a small Wasserstein distance (or other optimal transport costs). The approach is based on two principles: (a) if the source…

Machine Learning · Computer Science 2019-06-12 Yucheng Chen , Matus Telgarsky , Chao Zhang , Bolton Bailey , Daniel Hsu , Jian Peng

Learning disentangled representations leads to interpretable models and facilitates data generation with style transfer, which has been extensively studied on static data such as images in an unsupervised learning framework. However, only a…

Machine Learning · Computer Science 2021-01-20 Jun Han , Martin Renqiang Min , Ligong Han , Li Erran Li , Xuan Zhang

Wasserstein Discriminant Analysis (WDA) is a new supervised method that can improve classification of high-dimensional data by computing a suitable linear map onto a lower dimensional subspace. Following the blueprint of classical Linear…

Machine Learning · Statistics 2018-09-21 Rémi Flamary , Marco Cuturi , Nicolas Courty , Alain Rakotomamonjy

Building surrogate models with uncertainty quantification capabilities is essential for many engineering applications where randomness, such as variability in material properties, is unavoidable. Polynomial Chaos Expansion (PCE) is widely…

Computational Engineering, Finance, and Science · Computer Science 2025-11-04 Bahador Bahmani , Ioannis G. Kevrekidis , Michael D. Shields

This paper presents a novel method for accelerating path planning tasks in unknown scenes with obstacles by utilizing Wasserstein Generative Adversarial Networks (WGANs) with Gradient Penalty (GP) to approximate the distribution of the free…

Robotics · Computer Science 2023-06-19 Jorge Ocampo Jimenez , Wael Suleiman

We study the problem of network regression, where one is interested in how the topology of a network changes as a function of Euclidean covariates. We build upon recent developments in generalized regression models on metric spaces based on…

Machine Learning · Statistics 2024-06-19 Alex G. Zalles , Kai M. Hung , Ann E. Finneran , Lydia Beaudrot , César A. Uribe