The paper introduces a scalable method for uncertainty quantification in neural networks by applying a low‑rank generalized Laplace approximation within a data‑informed active subspace. It constructs a local Gaussian posterior around pretrained weights, calibrates the prior variance via empirical Bayes, and compares two posterior scalings: standard Bayesian and mean‑loss scaling. The study finds that mean‑loss scaling yields a more stable, lower‑dimensional subspace and produces calibrated, coherent predictive confidence intervals, whereas standard scaling can cause posterior variance contraction and degrade predictive coherence.
By Wouter N. Edeling, Peter V. Coveney
arXiv:2608.29349v1 Announce Type: new
Abstract: Gaussian process (GP) regression with a single global GP (GP-glo) incurs cubic computational cost, limiting scalability to large datasets. Product-of-e...
By Yean Hoon Ong, Paolo Barucca, Wei Pan, Jun Wang
arXiv:2606. 27269v1 Announce Type: cross Abstract: Reliably quantifying predictive uncertainty is difficult for complex, high-dimensional, or misspecified models.
By Graham Gibson, John Tipton, Kellin Rumsey, Natalie Klein
arXiv:2606. 13818v1 Announce Type: new Abstract: This thesis investigates how Bayesian principles can deepen our understanding of modern deep learning systems.
By Luis A. Ortega
arXiv:2610.19074v1 Announce Type: new
Abstract: Reliable uncertainty quantification remains an important challenge in AI. Hierarchical Bayesian methods provide a principled framework for this by repr...
By Neil K. Chada, Simon Cotter, Kody J. H. Law, Xinzhu Liang
arXiv:2606. 23838v1 Announce Type: new Abstract: When two or more parameters or labels produce similar data, they are degenerate, or hard to distinguish.
By T. Lucas Makinen, Deaglan J. Bartlett, Niall Jeffrey, Benjamin D. Wandelt