mlsanityData to 7 Oct 2026

Riemannian Laplace Approximation with the Fisher Metric

arXiv 2311.02766 ↗First posted 5 Nov 2023cs.LG stat.ME stat.MLcited by 7

Not on the map. Why?

Abstract (arXiv)

Laplace's method approximates a target density with a Gaussian distribution at its mode. It is computationally efficient and asymptotically exact for Bayesian inference due to the Bernstein-von Mises theorem, but for complex targets and finite-data posteriors it is often too crude an approximation. A recent generalization of the Laplace Approximation transforms the Gaussian approximation according to a chosen Riemannian geometry providing a richer approximation family, while still retaining computational efficiency. However, as shown here, its properties depend heavily on the chosen metric, indeed the metric adopted in previous work results in approximations that are overly narrow as well as being biased even at the limit of infinite data. We correct this shortcoming by developing the approximation family further, deriving two alternative variants that are exact at the limit of infinite data, extending the theoretical analysis of the method, and demonstrating practical improvements in a range of experiments.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 26 of its 90 references that are in the map. First posted on arXiv 5 Nov 2023.

Builds on

26 of 90 references.

References · 26

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  3. 2016Variational Inference: A Review for Statisticianscited by 1,466
  4. 2019Normalizing Flows for Probabilistic Modeling and Inferencecited by 1,315
  5. 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 776
  6. 2014New insights and perspectives on the natural gradient methodcited by 435
  7. 2022On Neural Differential Equationscited by 264
  8. 2022Riemannian Score-Based Generative Modellingcited by 216
  9. 2019Limitations of the Empirical Fisher Approximation for Natural Gradient Descentcited by 213
  10. 2013Expectation Propagation for approximate Bayesian inferencecited by 172
  11. 2018Fast Approximate Natural Gradient Descent in a Kronecker-factored Eigenbasiscited by 143
  12. 2019Continuous Hierarchical Representations with Poincar'e Variational Auto-Encoderscited by 111
14 more
  1. 2019'In-Between' Uncertainty in Bayesian Neural Networkscited by 79
  2. 2022Gradient Descent on Neurons and its Link to Approximate Second-Order Optimizationcited by 29
  3. 2023Amortized Variational Inference: When and Why?cited by 28
  4. 2021Pathfinder: Parallel quasi-Newton variational inferencecited by 26
  5. 2016A Locally Adaptive Normal Distributioncited by 23
  6. 2018Accelerating Natural Gradient with Higher-Order Invariancecited by 17
  7. 2023The Geometry of Neural Nets' Parameter Spaces Under Reparametrizationcited by 16
  8. 2019Metric Gaussian Variational Inferencecited by 14
  9. 2023Riemannian Laplace approximations for Bayesian neural networkscited by 14
  10. 2021Geometric variational inferencecited by 12
  11. 2022Lagrangian Manifold Monte Carlo on Monge Patchescited by 11
  12. 2023Scalable Stochastic Gradient Riemannian Langevin Dynamics in Non-Diagonal Metricscited by 8
  13. 2017Laplace approximation and the natural gradient for Gaussian process regression with the heteroscedastic Student-t modelcited by 5
  14. 2023Warped geometric information on the optimisation of Euclidean functionscited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 4; 2026: 2.

7 papers.