Sequential Monte Carlo with active subspaces
Leonardo Ripoli, Richard G. Everitt

TL;DR
This paper develops sequential Monte Carlo methods that leverage active subspaces to improve Bayesian inference efficiency in high-dimensional models, especially when likelihoods are uninformative in certain parameter subspaces.
Contribution
It introduces SMC algorithms utilizing active subspaces, including adaptive learning of the subspace and an SMC$^{2}$ variant for enhanced robustness over linear assumptions.
Findings
Demonstrates improved efficiency in high-dimensional Bayesian inference.
Provides adaptive methods for identifying active subspaces.
Shows robustness of SMC$^{2}$ approach in practical scenarios.
Abstract
Monte Carlo methods, such as Markov chain Monte Carlo (MCMC), remain the most regularly-used approach for implementing Bayesian inference. However, the computational cost of these approaches usually scales worse than linearly with the dimension of the parameter space, limiting their use for models with a large number of parameters. However, it is not uncommon for models to have identifiability problems. In this case, the likelihood is not informative about some subspaces of the parameter space, and hence the model effectively has a dimension that is lower than the number of parameters. Constantine et al. (2016) and Schuster et al. (2017) introduced the concept of directly using a Metropolis-Hastings (MH) MCMC on the subspaces of the parameter space that are informed by the likelihood as a means to reduce the dimension of the parameter space that needs to be explored. The same paper…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and financial applications
