A deep learning framework for geodesics under spherical Wasserstein-Fisher-Rao metric and its application for weighted sample generation
Not on the map. Why?
Abstract (arXiv)
Wasserstein-Fisher-Rao (WFR) distance is a family of metrics to gauge the discrepancy of two Radon measures, which takes into account both transportation and weight change. Spherical WFR distance is a projected version of WFR distance for probability measures so that the space of Radon measures equipped with WFR can be viewed as metric cone over the space of probability measures with spherical WFR. Compared to the case for Wasserstein distance, the understanding of geodesics under the spherical WFR is less clear and still an ongoing research focus. In this paper, we develop a deep learning framework to compute the geodesics under the spherical WFR metric, and the learned geodesics can be adopted to generate weighted samples. Our approach is based on a Benamou-Brenier type dynamic formulation for spherical WFR. To overcome the difficulty in enforcing the boundary constraint brought by the weight change, a Kullback-Leibler (KL) divergence term based on the inverse map is introduced into the cost function. Moreover, a new regularization term using the particle velocity is introduced as a substitute for the Hamilton-Jacobi equation for the potential in dynamic formula. When used for sample generation, our framework can be beneficial for applications with given weighted samples, especially in the Bayesian inference, compared to sample generation with previous flow models.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 21 of its 50 references that are in the map. First posted on arXiv 25 Aug 2022.
Builds on
21 of 50 references.
References · 21
- 2017Attention Is All You Needcited by 60,361
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2018Neural Ordinary Differential Equationscited by 3,779
- 2017Improved Training of Wasserstein GANscited by 2,235
- 2015Variational Inference with Normalizing Flowscited by 2,170
- 2019An Introduction to Variational Autoencoderscited by 1,000
- 2016Stein Variational Gradient Descent: A General Purpose Bayesian Inference Algorithmcited by 507
- 2016A Kernelized Stein Discrepancy for Goodness-of-fit Tests and Model Evaluationcited by 236
- 2017Stein Variational Gradient Descent as Gradient Flowcited by 152
- 2016A Kernel Test of Goodness of Fitcited by 143
9 more
- 2020OT-Flow: Fast and Accurate Continuous Normalizing Flows via Optimal Transportcited by 143
- 2015Optimal Entropy-Transport problems and a new Hellinger-Kantorovich distance between positive measurescited by 139
- 2018Improving GANs Using Optimal Transportcited by 123
- 2017Measuring Sample Quality with Kernelscited by 119
- 2019A Machine Learning Framework for Solving High-Dimensional Mean Field Game and Mean Field Control Problemscited by 97
- 2018Stein Neural Samplercited by 19
- 2018On optimal transport of matrix-valued measurescited by 4
- 2020Ensemble Kalman filter based Sequential Monte Carlo Sampler for sequential Bayesian inferencecited by 1
- 2021Computational Mean-field information dynamics associated with Reaction diffusion equationscited by 1
Built on by
Not cited yet.