Bayes-Newton Methods for Approximate Bayesian Inference with PSD Guarantees
Loading...
Access rights
openAccess
publishedVersion
URL
Journal Title
Journal ISSN
Volume Title
A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
Date
2023-03
Major/Subject
Mcode
Degree programme
Language
en
Pages
Series
Journal of Machine Learning Research, Volume 24, pp. 1−50
Abstract
We formulate natural gradient variational inference (VI), expectation propagation (EP), and posterior linearisation (PL) as extensions of Newton's method for optimising the parameters of a Bayesian posterior distribution. This viewpoint explicitly casts inference algorithms under the framework of numerical optimisation. We show that common approximations to Newton's method from the optimisation literature, namely Gauss-Newton and quasi-Newton methods (e.g., the BFGS algorithm), are still valid under this 'Bayes-Newton' framework. This leads to a suite of novel algorithms which are guaranteed to result in positive semi-definite (PSD) covariance matrices, unlike standard VI and EP. Our unifying viewpoint provides new insights into the connections between various inference schemes. All the presented methods apply to any model with a Gaussian prior and non-conjugate likelihood, which we demonstrate with (sparse) Gaussian processes and state space models.Description
Keywords
Other note
Citation
Wilkinson, W, Särkkä, S & Solin, A 2023, ' Bayes-Newton Methods for Approximate Bayesian Inference with PSD Guarantees ', Journal of Machine Learning Research, vol. 24, pp. 1−50 . < https://www.jmlr.org/papers/v24/21-1298.html >