Search arXivSearch

arXiv · 2203.09358

Generative modeling with low-rank Wasserstein polynomial chaos expansions

Abstract

A new Wasserstein multi-element polynomial chaos expansion (WPCE) is proposed, which is inspired by recent advances in computational optimal transport for estimating Wasserstein distances. The developed method combines unsupervised learning with the explicit functional representation of a random vector $Y$. Its training only relies on a finite set of samples from an unknown distribution, which is used to minimize a regularized empirical Wasserstein metric known as debiased Sinkhorn divergence. An interesting application that motivates the approach comes from the numerical upscaling of non-periodic random fields defined on a micro-scale. The WPCE can encode higher order stochastic information about the effective material behavior in contrast to the constant characterization with stochastic homogenization. A striking feature of the new method is the generalization of common diffeomorphic transport maps to the case of discontinuous and non-injective model classes $\mathcal{M}$ with possibly different input and output dimension. It computes a (functional) relation $Y=\mathcal{M}(X)$ in distribution with input random variables $X$ and target $Y$. The exponential growth of the PCE is alleviated by a new stacked tensor train (STT) format. By the choice of the model class $\mathcal{M}$ and the smooth loss function, higher-order optimization schemes and in particular Riemannian descent methods become possible. The proposed approach is illustrated numerically with a high-dimensional upscaling problem, which considers a microscopic random non-periodic composite material. It results in a computationally tractable effective macroscopic random field in adapted stochastic coordinates. By using a relaxation to a discontinuous model class, multimodal distributions also become tractable.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Robert Gruhlke, Martin Eigel. 2024-10-16. Generative modeling with low-rank Wasserstein polynomial chaos expansions. https://arxiv.org/abs/2203.09358

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fully spectral scheme for the linear BGK equation on the whole space

In this article, we design a fully spectral method in both space and velocity for a linear inhomogeneous kinetic equation with mass, momentum and energy conservation. We focus on the linear BGK equation with a confinement potential $Φ$, even if the method could be applied to different collision operators. It is based upon the projection on Hermite polynomials in velocity and orthonormal polynomials with respect to the weight $e^{-$Φ$}$ in space. The potential $Φ$ is assumed to be a polynomial. It is, to the author's knowledge, the first scheme which preserves hypocoercive behavior in addition to the conservation laws. These different properties are illustrated numerically on both quadratic and double well potential.

math.NA

Inverse inequalities for kernel-based approximation on bounded domains and Riemannian manifolds

This paper establishes inverse inequalities for kernel-based approximation spaces defined on bounded Lipschitz domains in $\mathbb{R}^d$ and compact Riemannian manifolds. While inverse inequalities are well-studied for polynomial spaces, their extension to kernel-based trial spaces poses significant challenges. For bounded Lipschitz domains, we extend prior Bernstein inequalities, which only apply to a limited range of Sobolev orders, to the full range of lower and upper orders, and derive Nikolskii inequalities that bound $L_\infty$ norms by $L_2$ norms. For compact Riemannian manifolds, we focus on restricted kernels, which are defined as the restriction of positive definite kernels from the ambient Euclidean space to the manifold, and prove their counterparts.

math.NA

Error Estimates for Hyperbolic Scaling Limits of Linear Kinetic Models on Networks

This paper studies linear discrete kinetic models on networks and their asymptotic behavior in the small Knudsen number limit. For coupling conditions at an n-edge junction under a symmetric formulation, we introduce a change of variables that reformulates the system into n independent initial-boundary value problems. The asymptotic expansions are then constructed and rigorously justified by deriving an error estimate based on the energy method.

math.NA