Projected Stein Variational Gradient Descent
arXiv:2002.03469
Abstract
The curse of dimensionality is a longstanding challenge in Bayesian inference in high dimensions. In this work, we propose a projected Stein variational gradient descent (pSVGD) method to overcome this challenge by exploiting the fundamental property of intrinsic low dimensionality of the data informed subspace stemming from ill-posedness of such problems. We adaptively construct the subspace using a gradient information matrix of the log-likelihood, and apply pSVGD to the much lower-dimensional coefficients of the parameter projection. The method is demonstrated to be more accurate and efficient than SVGD. It is also shown to be more scalable with respect to the number of parameters, samples, data points, and processor cores via experiments with parameters dimensions ranging from the hundreds to the tens of thousands.
References in corpus (6)
- Stein Variational Gradient Descent: A General Purpose Bayesian Inference Algorithm
- An introduction to sampling via measure transport
- Sparse Deterministic Approximation of Bayesian Inverse Problems
- A Stein variational Newton method
- Riemannian Stein Variational Gradient Descent for Bayesian Inference
- Information Newton's flow: second-order optimization method in probability space
Cited by in corpus (9)
- 3D Bayesian Variational Full Waveform Inversion
- Optimal design of acoustic metamaterial cloaks under uncertainty
- A fast and scalable computational framework for large-scale and high-dimensional Bayesian optimal experimental design
- Sliced Kernelized Stein Discrepancy
- Bayesian Multi-Task Transfer Learning for Soft Prompt Tuning
- Uncertainty Quantification of Graph Convolution Neural Network Models of Evolving Processes
- On Unifying Randomized Methods For Inverse Problems
- Stein variational reduced basis Bayesian inversion
- Neural Variational Gradient Descent