Pith. sign in

REVIEW 2 cited by

FSP-Laplace: Function-Space Priors for the Laplace Approximation in Bayesian Deep Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2407.13711 v2 pith:FKWPSY4D submitted 2024-07-18 cs.LG cs.AI

classification cs.LGcs.AI
keywords priorlaplacespaceapproximationdeepfunctionnetworksbiases
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Laplace approximations are popular techniques for endowing deep networks with epistemic uncertainty estimates as they can be applied without altering the predictions of the trained network, and they scale to large models and datasets. While the choice of prior strongly affects the resulting posterior distribution, computational tractability and lack of interpretability of the weight space typically limit the Laplace approximation to isotropic Gaussian priors, which are known to cause pathological behavior as depth increases. As a remedy, we directly place a prior on function space. More precisely, since Lebesgue densities do not exist on infinite-dimensional function spaces, we recast training as finding the so-called weak mode of the posterior measure under a Gaussian process (GP) prior restricted to the space of functions representable by the neural network. Through the GP prior, one can express structured and interpretable inductive biases, such as regularity or periodicity, directly in function space, while still exploiting the implicit inductive biases that allow deep networks to generalize. After model linearization, the training objective induces a negative log-posterior density to which we apply a Laplace approximation, leveraging highly scalable methods from matrix-free linear algebra. Our method provides improved results where prior knowledge is abundant (as is the case in many scientific inference tasks). At the same time, it stays competitive for black-box supervised learning problems, where neural networks typically excel.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Constructive Disintegration and Conditional Modes

    math.ST 2025-08 conditional novelty 6.0 of 10

    The density of a true conditional distribution on a submanifold equals the restricted prior density times an inverse-Jacobian correction, so modes of restriction and of disintegration differ.

  2. laplax -- Laplace Approximations with JAX

    cs.LG 2025-07 conditional novelty 6.0 of 10

    The paper presents laplax, a modular JAX library for Laplace approximations that supports multiple curvature estimates, uncertainty pushforwards, calibration, and evaluation routines.

Pith tools