paper-with-me

Papers

DeepParticle: learning invariant measure by a deep neural network minimizing Wasserstein distance on data generated from an interacting particle method

2021-11-02 · Zhongjian Wang, Jack Xin, Zhiwen Zhang

We introduce the so called DeepParticle method to learn and generate invariant measures of stochastic dynamical systems with physical parameters based on data computed from an interacting particle method (IPM). We utilize the expressiveness of deep neural networks (DNNs) to represent the transform of samples from a given input (source) distribution to an arbitrary target distribution, neither assuming distribution functions in closed form nor a finite state space for the samples. In training, we update the network weights to minimize a discrete Wasserstein distance between the input and target samples. To reduce computational cost, we propose an iterative divide-and-conquer (a mini-batch interior point) algorithm, to find the optimal transition matrix in the Wasserstein distance. We present numerical results to demonstrate the performance of our method for accelerating IPM computation of invariant measures of stochastic dynamical systems arising in computing reaction-diffusion front speeds through chaotic flows. The physical parameter is a large Pecl\'et number reflecting the advection dominated regime of our interest.

📄 PDF Abstract BibTeX arXiv:2111.01356

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

A DeepParticle method for learning and generating aggregation patterns in multi-dimensional Keller-Segel chemotaxis systems

2022-08-31 · Zhongjian Wang, Jack Xin, Zhiwen Zhang

We study a regularized interacting particle method for computing aggregation patterns and near singular solutions of a Keller-Segal (KS) chemotaxis system in two and three space dimensions, then further develop DeepParti…

Permutation invariant networks to learn Wasserstein metrics

2020-10-12 · NeurIPS Workshop TDA_and_Beyond 2020 12 · Arijit Sehanobish, Neal Ravindra, David van Dijk

Understanding the space of probability measures on a metric space equipped with a Wasserstein distance is one of the fundamental questions in mathematical analysis. The Wasserstein metric has received a lot of attention …

Y-Diagonal Couplings: Approximating Posteriors with Conditional Wasserstein Distances

2023-10-20 · Jannis Chemseddine, Paul Hagemann, Christian Wald

In inverse problems, many conditional generative models approximate the posterior measure by minimizing a distance between the joint measure and its learned approximation. While this approach also controls the distance b…

Conditional Wasserstein Distances with Applications in Bayesian OT Flow Matching

2024-03-27 · Jannis Chemseddine, Paul Hagemann, Gabriele Steidl, Christian Wald

In inverse problems, many conditional generative models approximate the posterior measure by minimizing a distance between the joint measure and its learned approximation. While this approach also controls the distance b…

Conditional Image GenerationImage Generation

Wasserstein Distance Guided Representation Learning for Domain Adaptation

2017-07-05 · Jian Shen, Yanru Qu, Wei-Nan Zhang, Yong Yu

Domain adaptation aims at generalizing a high-performance learner on a target domain via utilizing the knowledge distilled from a source domain which has a different but related data distribution. One solution to domain …

Domain AdaptationGeneral Classificationimage-classificationImage Classification+1