laplax -- Laplace Approximations with JAX

Tobias Weber, Bálint Mucsányi, Lenard Rommel, Thomas Christie, Lars Kasüschke +2 more
7/22/2025
cs.LGcs.AI

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

The Laplace approximation provides a scalable and efficient means of quantifying weight-space uncertainty in deep neural networks, enabling the application of Bayesian tools such as predictive uncertainty and model selection via Occam's razor. In this work, we introduce laplax, a new open-source Python package for performing Laplace approximations with jax. Designed with a modular and purely functional architecture and minimal external dependencies, laplax offers a flexible and researcher-friendly framework for rapid prototyping and experimentation. Its goal is to facilitate research on Bayesian neural networks, uncertainty quantification for deep learning, and the development of improved Laplace approximation techniques.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{weber2025laplax,
  title  = {laplax -- Laplace Approximations with JAX},
  author = {Tobias Weber and Bálint Mucsányi and Lenard Rommel and Thomas Christie and Lars Kasüschke and Marvin Pförtner and Philipp Hennig},
  year   = {2025},
  eprint = {2507.17013},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2507.17013v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2507.17013.svg)](https://codeofpaper.com/paper/2507.17013)

Discussion