Hessian-Free Laplace in Bayesian Deep Learning
<|reference_start|>Hessian-Free Laplace in Bayesian Deep Learning: The Laplace approximation (LA) of the Bayesian posterior is a Gaussian distribution centered at the maximum a posteriori estimate. Its appeal in Bayesian deep learning stems from the ability to quantify uncertainty post-hoc (i.e., after standard network parameter optimization), the ease of sampling from the approximate posterior, and the analytic form of model evidence. However, an important computational bottleneck of LA is the necessary step of calculating and inverting the Hessian matrix of the log posterior. The Hessian may be approximated in a variety of ways, with quality varying with a number of factors including the network, dataset, and inference task. In this paper, we propose an alternative framework that sidesteps Hessian calculation and inversion. The Hessian-free Laplace (HFL) approximation uses curvature of both the log posterior and network prediction to estimate its variance. Only two point estimates are needed: the standard maximum a posteriori parameter and the optimal parameter under a loss regularized by the network prediction. We show that, under standard assumptions of LA in Bayesian deep learning, HFL targets the same variance as LA, and can be efficiently amortized in a pre-trained network. Experiments demonstrate comparable performance to that of exact and approximate Hessians, with excellent coverage for in-between uncertainty.<|reference_end|>
@article{mcinerney2024hessian-free,
    title={Hessian-Free Laplace in Bayesian Deep Learning},
    author={James McInerney, Nathan Kallus},
    journal={arXiv preprint arXiv:2403.10671},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.10671},
    primaryClass={stat.ML cs.LG}
}