<figure><img src="image_1.png" /></figure>

HAL
open science

# Bayesian deep learning: Overview and challenges

Julyan Arbel

► To cite this version:

Julyan Arbel. Bayesian deep learning: Overview and challenges. BNP 14 - 14th International Conference on Bayesian Nonparametrics, Jun 2025, Los Angeles (CA), United States. hal-05132111

HAL Id: hal-05132111

https://hal.science/hal-05132111v1

Submitted on 27 Jun 2025

HAL is a multi-disciplinary open access
archive for the deposit and dissemination of sci-
entific research documents, whether they are pub-
lished or not. The documents may come from
teaching and research institutions in France or
abroad, or from public or private research centers.

L'archive ouverte pluridisciplinaire HAL, est
destinée au dépôt et à la diffusion de documents
scientifiques de niveau recherche, publiés ou non,
émanant des établissements d'enseignement et de
recherche français ou étrangers, des laboratoires
publics ou privés.

<figure><img src="image_2.png" /></figure>

Distributed under a Creative Commons Attribution 4.0 International License
Bayesian deep learning
Overview and challenges

Inria

Julyan Arbel, Inria Grenoble

julyanarbel.com

BNP 14, UCLA, June 2025
<figure><img src="image_3.png" /><figcaption>Mariia Vladimirova
Criteo Al Lab
Paris</figcaption></figure>

<figure><img src="image_4.png" /><figcaption>Stéphane Girard
Inria
Grenoble</figcaption></figure>

<figure><img src="image_5.png" /><figcaption>Kostas Pitas
Cognex
Switzerland</figcaption></figure>

<figure><img src="image_6.png" /><figcaption>Vincent Fortuin
Helmolz Al
Munich</figcaption></figure>
Large-scale **deep learning**

Considerable success → 2024 Physics & Chemistry Nobel Prizes, 2018 Turing Award.

<table><thead><tr><th>method</th><th>top-1 err.</th><th>top-5 err.</th></tr></thead><tbody><tr><td>VGG [41] (ILSVRC'14)</td><td>-</td><td>8.43<sup>†</sup></td></tr><tr><td>GoogLeNet [44] (ILSVRC'14)</td><td>-</td><td>7.89</td></tr><tr><td>VGG [41] (v5)</td><td>24.4</td><td>7.1</td></tr><tr><td>PReLU-net [13]</td><td>21.59</td><td>5.71</td></tr><tr><td>BN-inception [16]</td><td>21.99</td><td>5.81</td></tr><tr><td>ResNet-34 B</td><td>21.84</td><td>5.71</td></tr><tr><td>ResNet-34 C</td><td>21.53</td><td>5.60</td></tr><tr><td>ResNet-50</td><td>20.74</td><td>5.25</td></tr><tr><td>ResNet-101</td><td>19.87</td><td>4.60</td></tr><tr><td>ResNet-152</td><td><strong>19.38</strong></td><td><strong>4.49</strong></td></tr></tbody></table>

<figure><img src="image_7.png" /></figure>
# Bayesian deep learning

Emerged in the 90s: works by Neal and Mackay on **Bayesian neural networks**
→ Addressing deep learning challenges by merging the advantages of the robust
mathematical foundations of **Bayesian inference** with the practical effectiveness
of **deep learning methods**.

<figure><img src="image_8.png" /></figure>

<figure><img src="image_9.png" /></figure>

<figure><img src="image_10.png" /></figure>

Source: The Very Basics of Bayesian Neural Networks
# Bayesian neural networks: out-of-distribution

BNNs are simply NNs that can respond “I’m not sure”

Why is it important? Need to consider out-of-distribution (OOD) samples.

For example, train a BNN on MNIST, and ask to predict on letters instead of digits.

<figure><img src="image_11.png" /></figure>

<figure><img src="image_12.png" /></figure>

<table><thead><tr><td></td><td>Prediction</td><td>Probability</td><td>Std. dev. (uncertainty)</td></tr></thead><tbody><tr><td>Digit “3”</td><td>3</td><td>100%</td><td>0</td></tr><tr><td>Letter “B”</td><td>8</td><td>57%</td><td>0,45</td></tr></tbody></table>
## Priors

<figure><img src="image_13.png" /></figure>

## Posteriors

<figure><img src="image_14.png" /></figure>

## Applications

<figure><img src="image_15.png" /></figure>

<figure><img src="image_16.png" /></figure>

## Teaching

<figure><img src="image_17.png" /></figure>
## Priors

<figure><img src="image_18.png" /></figure>

## Posteriors

<figure><img src="image_19.png" /></figure>

## Applications

<figure><img src="image_20.png" /></figure>

<figure><img src="image_21.png" /></figure>

## Teaching

<figure><img src="image_22.png" /></figure>
* What prior distribution is induced on the **units** by a prior on the **weights**?

* Impact of width?

* Impact of depth?

<figure><img src="image_23.png" /></figure>
* What prior distribution is induced on the **units** by a prior on the **weights**?

* Impact of width?

* Impact of depth?

<figure><img src="image_24.png" /></figure>
* What prior distribution is induced on the **units** by a prior on the **weights**?

* Impact of width?

* Impact of depth?

<figure><img src="image_25.png" /></figure>
* What prior distribution is induced on the **units** by a prior on the **weights**?

* Impact of width?

* Impact of depth?

<figure><img src="image_26.png" /></figure>
* What prior distribution is induced on the **units** by a prior on the **weights**?

* Impact of width?

* Impact of depth?

<figure><img src="image_27.png" /></figure>
* What prior distribution is induced on the **units** by a prior on the **weights**?

* Impact of width?

* Impact of depth?

<figure><img src="image_28.png" /></figure>

1 When the network's width tends to infinity?

Central limit theorem, Gaussian process
Edge of Chaos, Neural tangent kernel

<figure><img src="image_29.png" /></figure>
* What prior distribution is induced on the **units** by a prior on the **weights**?

* Impact of width?

* Impact of depth?

<figure><img src="image_30.png" /></figure>

**1 When the network's width tends to infinity?**

Central limit theorem, Gaussian process
Edge of Chaos, Neural tangent kernel

<figure><img src="image_31.png" /></figure>

**2 When the network's width is kept fixed?**

Heavy-tails, sub-Weibull distribution, Weibull-tails
Sparsity inducing

<figure><img src="image_32.png" /></figure>
When the network's width tends to infinity

<figure><img src="image_33.png" /><figcaption>Radford Neal</figcaption></figure>

U Toronto *** GOOGLE SCHOLAR CAN GIVE WRONG PUBLICATION DATE/REFERENCE - LOOK AT ACTUAL PAPER/BOOK!

Verified email at utstat.toronto.edu - [Homepage](#)

Bayesian inference
Monte Carlo methods
Information theory
Machine learning
Neural networks
When the network's width tends to infinity

<figure><img src="image_34.png" /></figure>

Radford Neal

U Toronto *** GOOGLE SCHOLAR CAN GIVE WRONG PUBLICATION DATE/REFERENCE - LOOK AT ACTUAL PAPER/BOOK!

Verified email at utstat.toronto.edu - [Homepage](#)

Bayesian inference
Monte Carlo methods
Information theory
Machine learning
Neural networks

Markov chain sampling methods for Dirichlet process mixture models

RM Neal

Journal of computational and graphical statistics 9 (2), 249-265
1

When the network's width tends to infinity

<figure><img src="image_35.png" /></figure>

Radford Neal

U Toronto *** GOOGLE SCHOLAR CAN GIVE WRONG PUBLICATION DATE/REFERENCE - LOOK AT ACTUAL PAPER/BOOK!

Verified email at utstat.toronto.edu - [Homepage](#)

Bayesian inference
Monte Carlo methods
Information theory
Machine learning
Neural networks

Markov chain sampling methods for Dirichlet process mixture models

RM Neal

Journal of computational and graphical statistics 9 (2), 249-265

MCMC Using Hamiltonian Dynamics

R Neal

Handbook of Markov Chain Monte Carlo, 113-162
1

When the network's width tends to infinity

<figure><img src="image_36.png" /></figure>

Radford Neal

U Toronto *** GOOGLE SCHOLAR CAN GIVE WRONG PUBLICATION DATE/REFERENCE - LOOK AT ACTUAL PAPER/BOOK!

Verified email at utstat.toronto.edu - [Homepage](#)

Bayesian inference
Monte Carlo methods
Information theory
Machine learning
Neural networks

Markov chain sampling methods for Dirichlet process mixture models

RM Neal

Journal of computational and graphical statistics 9 (2), 249-265

MCMC Using Hamiltonian Dynamics

R Neal

Handbook of Markov Chain Monte Carlo, 113-162

Slice sampling

RM Neal

Annals of statistics, 705-741
1

When the network's width tends to infinity

<figure><img src="image_37.png" /></figure>

Radford Neal

U Toronto *** GOOGLE SCHOLAR CAN GIVE WRONG PUBLICATION DATE/REFERENCE - LOOK AT ACTUAL PAPER/BOOK!

Verified email at utstat.toronto.edu - [Homepage](#)

Bayesian inference
Monte Carlo methods
Information theory
Machine learning
Neural networks

Markov chain sampling methods for Dirichlet process mixture
models

RM Neal

Journal of computational and graphical statistics 9 (2), 249-265

MCMC Using Hamiltonian Dynamics

R Neal

Handbook of Markov Chain Monte Carlo, 113-162

Slice sampling

RM Neal

Annals of statistics, 705-741

Probabilistic inference using Markov chain Monte Carlo methods

RM Neal

Department of Computer Science, University of Toronto
1

When the network's width tends to infinity

<figure><img src="image_38.png" /></figure>

Radford Neal

U Toronto *** GOOGLE SCHOLAR CAN GIVE WRONG PUBLICATION DATE/REFERENCE - LOOK AT ACTUAL PAPER/BOOK!

Verified email at utstat.toronto.edu - [Homepage](#)

Bayesian inference
Monte Carlo methods
Information theory
Machine learning
Neural networks

Markov chain sampling methods for Dirichlet process mixture
models

RM Neal

Journal of computational and graphical statistics 9 (2), 249-265

MCMC Using Hamiltonian Dynamics

R Neal

Handbook of Markov Chain Monte Carlo, 113-162

Slice sampling

RM Neal

Annals of statistics, 705-741

Probabilistic inference using Markov chain Monte Carlo methods

RM Neal

Department of Computer Science, University of Toronto

Annealed importance sampling

RM Neal

Statistics and computing 11, 125-139
1

When the network's width tends to infinity

<figure><img src="image_39.png" /></figure>

Radford Neal

U Toronto *** GOOGLE SCHOLAR CAN GIVE WRONG PUBLICATION DATE/REFERENCE - LOOK AT ACTUAL PAPER/BOOK!

Verified email at utstat.toronto.edu - [Homepage](#)

Bayesian inference
Monte Carlo methods
Information theory
Machine learning
Neural networks

Markov chain sampling methods for Dirichlet process mixture
models

RM Neal

Journal of computational and graphical statistics 9 (2), 249-265

MCMC Using Hamiltonian Dynamics

R Neal

Handbook of Markov Chain Monte Carlo, 113-162

Slice sampling

RM Neal

Annals of statistics, 705-741

Probabilistic inference using Markov chain Monte Carlo methods

RM Neal

Department of Computer Science, University of Toronto

Annealed importance sampling

RM Neal

Statistics and computing 11, 125-139

Bayesian learning for neural networks

RM Neal

Springer Science & Business Media
1

When the network's width tends to infinity

<figure><img src="image_40.png" /></figure>

Radford Neal

U Toronto *** GOOGLE SCHOLAR CAN GIVE WRONG PUBLICATION DATE/REFERENCE - LOOK AT ACTUAL PAPER/BOOK!

Verified email at utstat.toronto.edu - [Homepage](#)

Bayesian inference
Monte Carlo methods
Information theory
Machine learning
Neural networks

Markov chain sampling methods for Dirichlet process mixture
models

RM Neal

Journal of computational and graphical statistics 9 (2), 249-265

MCMC Using Hamiltonian Dynamics

R Neal

Handbook of Markov Chain Monte Carlo, 113-162

Slice sampling

RM Neal

Annals of statistics, 705-741

Probabilistic inference using Markov chain Monte Carlo methods

RM Neal

Department of Computer Science, University of Toronto

Annealed importance sampling

RM Neal

Statistics and computing 11, 125-139

Bayesian learning for neural networks

RM Neal

Springer Science & Business Media
1

When the network's width tends to infinity

Bayesian learning for neural networks

RM Neal

Springer Science & Business Media
1

When the network's width tends to infinity

A **one-hidden-layer** neural network, whose width goes to infinity, and
which has a Gaussian prior on all the parameters, converges to a
**Gaussian process** with a well-defined kernel (Neal, 1996).

<figure><img src="image_41.png" /></figure>
1

When the network's width tends to infinity

Gaussian Process Behaviour in Wide Deep Neural Networks

AGG Matthews, J Hron, M Rowland, RE Turner, Z Ghahramani
International Conference on Learning Representations (ICLR)

A **deep** neural network, where all layers widths go to infinity, and
which has a Gaussian prior on all the parameters, converges to a
**Gaussian process** with a well-defined kernel (Matthews et al., 2018).

<figure><img src="image_42.png" /></figure>
When the network's width is kept fixed?
When the network's width is kept fixed?

Sub-Weibull distributions
When the network's width is kept fixed?

Sub-Weibull distributions

<figure><img src="image_43.png" /></figure>
When the network's width is kept fixed?

**Theorem.** The rv X is Sub-Weibull iff:

<figure><img src="image_44.png" /></figure>
**2 When the network's width is kept fixed?**

<figure><img src="image_45.png" /></figure>

**Theorem.** The rv X is Sub-Weibull iff:

1. The tails of X satisfy

$\exists K_1 > 0 \text{ such that } \mathbb{P}(|X| \ge x) \le 2 \exp \left( -(x/K_1)^{1/\theta} \right) \text{ for all } x \ge 0.$
<figure><img src="image_46.png" /></figure>

**2 When the network's width is kept fixed?**

**Theorem.** The rv X is Sub-Weibull iff:

1. The tails of X satisfy

$$ \exists K_1 > 0 \text{ such that } \mathbb{P}(|X| \ge x) \le 2 \exp \left( -(x/K_1)^{1/\theta} \right) \text{ for all } x \ge 0. $$

2. The moments of X satisfy

$$ \exists K_2 > 0 \text{ such that } \|X\|_k \le K_2 k^{\theta} \text{ for all } k \ge 1. $$
<figure><img src="image_47.png" /></figure>

**2 When the network's width is kept fixed?**

**Theorem.** The rv X is Sub-Weibull iff:

1. The tails of X satisfy

$$ \exists K_1 > 0 \text{ such that } \mathbb{P}(|X| \ge x) \le 2 \exp \left( -(x/K_1)^{1/\theta} \right) \text{ for all } x \ge 0. $$

2. The moments of X satisfy

$$ \exists K_2 > 0 \text{ such that } \|X\|_k \le K_2 k^\theta \text{ for all } k \ge 1. $$

3. The MGF of $|X|^{1/\theta}$ satisfies

$$ \exists K_3 > 0 \text{ such that } \mathbb{E} \left[ \exp \left( (\lambda |X|)^{1/\theta} \right) \right] \le \exp \left( (\lambda K_3)^{1/\theta} \right) $$
<figure><img src="image_48.png" /></figure>

**2 When the network's width is kept fixed?**

**Theorem.** The rv X is Sub-Weibull iff:

1. The tails of X satisfy

$$ \exists K_1 > 0 \text{ such that } \mathbb{P}(|X| \ge x) \le 2 \exp \left( -(x/K_1)^{1/\theta} \right) \text{ for all } x \ge 0. $$

2. The moments of X satisfy

$$ \exists K_2 > 0 \text{ such that } \|X\|_k \le K_2 k^\theta \text{ for all } k \ge 1. $$

3. The MGF of $|X|^{1/\theta}$ satisfies

$$ \exists K_3 > 0 \text{ such that } \mathbb{E} \left[ \exp \left( (\lambda |X|)^{1/\theta} \right) \right] \le \exp \left( (\lambda K_3)^{1/\theta} \right) \\ \text{for all } \lambda \text{ such that } 0 < \lambda \le 1/K_3. $$

4. The MGF of $|X|^{1/\theta}$ is bounded at some point, namely

$$ \exists K_4 > 0 \text{ such that } \mathbb{E} \left[ \exp \left( (|X|/K_4)^{1/\theta} \right) \right] \le 2. $$
2 When the network's width is kept fixed?

Assumptions.

(A1) **Parameters.** The weights $w$ have i.i.d. Gaussian prior

$$w \sim \mathcal{N}(0, \sigma^2)$$

(A2) **Nonlinearity.** ReLU-like with **envelope property**: $\exists c_1, c_2, d_2 \ge 0, d_1 > 0$ s.t.

$$|\phi(u)| \ge c_1 + d_1|u| \quad \text{for all } u \in \mathbb{R}_+ \text{ or } u \in \mathbb{R}_-,$$

$$|\phi(u)| \le c_2 + d_2|u| \quad \text{for all } u \in \mathbb{R}.$$
## 2 When the network's width is kept fixed?

### Assumptions.

(A1) **Parameters.** The weights $w$ have i.i.d. Gaussian prior

$$w \sim \mathcal{N}(0, \sigma^2)$$

(A2) **Nonlinearity.** ReLU-like with envelope property: $\exists c_1, c_2, d_2 \ge 0, d_1 > 0$ s.t.

$$|\phi(u)| \ge c_1 + d_1|u| \quad \text{for all } u \in \mathbb{R}_+ \text{ or } u \in \mathbb{R}_-,$$

$$|\phi(u)| \le c_2 + d_2|u| \quad \text{for all } u \in \mathbb{R}.$$

### Theorem. sub-Weibull units.

Consider a Bayesian neural network with (A1) i.i.d. Gaussian priors on the weights and (A2) nonlinearity satisfying envelope property.

Then conditional on input $x$, the marginal prior distribution of a unit $u^{(\ell)}$ of $\ell$-th hidden layer is sub-Weibull with tail parameter $\theta = \ell/2$: $\pi^{(\ell)}(u) \sim \text{subW}(\ell/2)$
**2 When the network's width is kept fixed?**

<figure><img src="image_49.png" /></figure>

**Theorem.**

Consider a Bayesian neural network with (A1) i.i.d. Gaussian priors on the weights and (A2) nonlinearity satisfying envelope property.

Then conditional on input x, the marginal prior distribution of a unit $u^{(\ell)}$ of $\ell$-th hidden layer is sub-Weibull with tail parameter $\theta = \ell/2: \pi^{(\ell)}(u) \sim \text{subW}(\ell/2)$
## 2 When the network's width is kept fixed?

Weight distribution
$\pi(w) \approx e^{-w^2}$

<figure><img src="image_50.png" /></figure>

$\ell$-th layer unit distribution
$\pi^{(\ell)}(u) \approx e^{-u^2/\ell}$

<table><thead><tr><th>Layer</th><th>Penalty on <b>W</b></th><th>Penalty on <b>U</b></th></tr></thead><tbody><tr><td>1</td><td>$||<b>W</b><sup>(1)</sup>||_2^2, L^2$</td><td>$||<b>U</b><sup>(1)</sup>||_2^2, L^2$ (weight decay)</td></tr><tr><td>2</td><td>$||<b>W</b><sup>(2)</sup>||_2^2, L^2$</td><td>$||<b>U</b><sup>(2)</sup>||_2^2, L^1$ (Lasso)</td></tr><tr><td>$\ell$</td><td>$||<b>W</b><sup>(\ell)</sup>||_2^2, L^2$</td><td>$||<b>U</b><sup>(\ell)</sup>||_{2/\ell}^{2/\ell}, L^{2/\ell}$</td></tr></tbody></table>

<figure><img src="image_51.png" /></figure>

<figure><img src="image_52.png" /></figure>

<figure><img src="image_53.png" /></figure>

<figure><img src="image_54.png" /></figure>
## Sub-Weibull
(upper bound)

$$ \bar{F}(x) \le ae^{-bx^{1/\theta}}, \text{ for } x > 0 \text{ and some } a, b, \theta > 0. $$

$$ 0 < \beta_2 < \beta < \beta_1 $$

<figure><img src="image_55.png" /></figure>

Mariia Vladimirova, Stéphane Girard, Hien D Nguyen, and Julyan Arbel.

**Sub-Weibull distributions: generalizing sub-Gaussian and sub-Exponential properties to heavier-tailed distributions.** Stat, 2020.

## Generalized Weibull-tail
(precise description)

$$ e^{-x^{\beta}l_1(x)} \le \bar{F}(x) \le e^{-x^{\beta}l_2(x)}, \text{ for } x > 0 \text{ and some } \beta > 0. $$

<figure><img src="image_56.png" /></figure>

Mariia Vladimirova, Julyan Arbel, and Stéphane Girard.

Bayesian neural network unit priors and generalized Weibull-tail property. ACML, 2021.
## Priors

<figure><img src="image_57.png" /></figure>

## Posteriors

<figure><img src="image_58.png" /></figure>

## Applications

<figure><img src="image_59.png" /></figure>

<figure><img src="image_60.png" /></figure>

## Teaching

<figure><img src="image_61.png" /></figure>
# Posterior computations

Armed with a prior for our BNN, we still need to work out the posterior.

The BNN posterior is highly intractable.

Can't calculate? Then approximate!

1. Approximate inference algorithm

2. Implementation of that algorithm

$$ \underbrace{p(\boldsymbol{\theta} | \mathcal{D})}_{\text{posterior dist.}} = \frac{\underbrace{\overbrace{p(\mathcal{D} | \boldsymbol{\theta})}^{\text{likelihood}} \overbrace{p(\boldsymbol{\theta})}^{\text{prior dist.}}}_{\text{posterior dist.}}}{\int \underbrace{p(\mathcal{D} | \boldsymbol{\theta}) p(\boldsymbol{\theta}) d\boldsymbol{\theta}}_{\text{marginal likelihood}}} $$
# 1. Approximate inference algorithm

Different flavors of BDL methods for approximating the posterior

<figure><img src="image_62.png" /></figure>

* Maximum a posteriori (MAP): point estimate

* MCMC/Hamiltonian MC (Neal, 1996)

* MC Dropout random masking of neurons at test time (Gal and Ghahramani, ICML, 2016)

* Variational inference and Laplace approximation: Gaussian approximations

* Ensemble methods use MAP estimates as their samples.

* Partially Stochastic Bayesian Neural Networks (Sharma et al. AISTATS, 2023)
# Maximum a posteriori estimation (MAP)

Rely on SGD to find a maximum a posteriori estimate

$$ \hat{\theta} = \arg \max_{\theta} p(\theta | \mathbf{x}_{1:n}, y_{1:n}) $$

$$ = \arg \min_{\theta} - \log p(\theta | \mathbf{x}_{1:n}, y_{1:n}) $$

$$ = \arg \min_{\theta} - \log p(y_{1:n} | \mathbf{x}_{1:n}, \theta) - \log p(\theta) $$
Variational inference (VI)

Goal is to approximate the posterior distribution by specifying an approximate family $q_{\lambda}(\cdot)$
Turns sampling into optimization, minimizing the evidence lower bound (ELBO)

$$p(\boldsymbol{\theta} | \mathbf{x}_{1:n}, y_{1:n}) = \frac{p(y_{1:n} | \mathbf{x}_{1:n}, \boldsymbol{\theta}) p(\boldsymbol{\theta})}{\int p(y_{1:n} | \mathbf{x}_{1:n}, \boldsymbol{\theta}) p(\boldsymbol{\theta}) d\boldsymbol{\theta}} \approx q(\boldsymbol{\theta} | \boldsymbol{\lambda}) \triangleq q_{\boldsymbol{\lambda}}(\boldsymbol{\theta})$$

<figure><img src="image_63.png" /></figure>

Source: [Variational Bayesian phylogenetic inference](#)
# Laplace approximation (LA)

Application of the Laplace method (P.S. Laplace, 1774) to approximate posterior distributions by a Gaussian centered at the posterior mode $\hat{\theta}$, using the curvature (Hessian) of the log-posterior $\psi(\theta) = \log p(\theta | x_{1:n}, y_{1:n})$.

Take the 2nd-order Taylor expansion of $\psi(\theta)$ around the MAP estimate $\hat{\theta}$.

$$ \psi(\theta) \approx \psi(\hat{\theta}) + (\theta - \hat{\theta})[\dots] + \frac{1}{2}(\theta - \hat{\theta})^{\top} [\nabla_{\theta}^2 \psi(\theta)]_{\hat{\theta}} (\theta - \hat{\theta}) $$

Compare this to the log-p.d.f.~of a multivariate Normal distribution.

$$ \log \mathcal{N}(\theta; \mu, \Sigma) = -\frac{1}{2}(\theta - \mu)^{\top} \Sigma^{-1} (\theta - \mu) + \text{const.} $$
# Laplace approximation: predictive posterior

How do we make predictions using the Laplace approximation?

$$ 
\begin{aligned}
p(y^* | \mathbf{x}^*, \mathbf{x}_{1:n}, y_{1:n}) &= \int p(y^* | \mathbf{x}^*, \theta) p(\theta | \mathbf{x}_{1:n}, y_{1:n}) d\theta \\
&\approx \int p(y^* | \mathbf{x}^*, \theta) q(\theta) d\theta \\
&= \mathbb{E}_{\theta \sim q} \left[ p(y^* | \mathbf{x}^*, \theta) \right]
\end{aligned}
$$

<figure><img src="image_64.png" /><figcaption>(a) Step 1: Find MAP</figcaption></figure>

<figure><img src="image_65.png" /><figcaption>(b) Step 2: Fit approx.</figcaption></figure>

<figure><img src="image_66.png" /><figcaption>(c) Step 3: Predict!</figcaption></figure>
## 2. Implementation of the approx. algorithm

Unfortunately, there doesn't exist (yet) a unique/unified implementation framework. There exist quite a few software packages, libraries or probabilistic programming languages (PPLs) developed independently by different groups.
## 2. Implementation of the approx. algorithm

Unfortunately, there doesn't exist (yet) a unique/unified implementation framework. There exist quite a few software packages, libraries or probabilistic programming languages (PPLs) developed independently by different groups.

* some algo. might only work with some normalization (layer norm vs. batch norm) or might not work with low-precision weights.

* need for more user-friendly tools for layman practitioners

* Laplace inference: [laplace-torch](https://github.com/aleximmer/Laplace)

* TyXe: [Pyro](https://github.com/TyXe/Pyro)-based BNNs for Pytorch users

* BNN implementation using [JAX](https://www.jax.org/) [https://neptune.ai/blog/bayesian-neural-networks-with-jax](https://neptune.ai/blog/bayesian-neural-networks-with-jax)

* TensorFlow Probability [https://www.tensorflow.org/probability](https://www.tensorflow.org/probability)

<figure><img src="image_67.png" /></figure>
# Theory about the BDL posterior distribution

- Frequentist properties of the posterior for large sample size $n$

- Nonparametric regression (Kohler and Langer, 2021; Castillo and Egels, 2024)

- Multiclass classification (Bos and Schmidt-Hieber, 2022)

- Study of spike-and-slab priors (Polson and Rockova, 2018; Jantre et al., 2024)

- General priors (Lee and Lee, 2022; Kong and Kim, 2024)

- Deep Gaussian processes (Finocchio and Schmidt-Hieber, 2023; Bachoc and Lagnoux, 2025; Castillo and Randrianarisoa, 2024)

- Variational approximations to BNN posteriors (Bhattacharya and Maiti (2021); Bhattacharya et al. (2020)
## Priors

<figure><img src="image_68.png" /></figure>

## Posteriors

<figure><img src="image_69.png" /></figure>

## Applications

<figure><img src="image_70.png" /></figure>

<figure><img src="image_71.png" /></figure>

## Teaching

<figure><img src="image_72.png" /></figure>
# Why Bayesian deep learning matters?

BDL has shown potential in a range of **critical application domains**:

* healthcare (Peng et al., 2019; Abdar et al., 2021b)

* single-cell biology (Way and Greene, 2018),

* drug discovery (Gruver et al., 2021; Klarner et al., 2023),

* agriculture (Hernandez and Lopez, 2020),

* astrophysics (Soboczenski et al., 2018; Ferreira et al., 2020),

* nanotechnology (Leitherer et al., 2021),

* physics (Cranmer et al., 2021),

* climate science (Vandal et al., 2018; Luo et al., 2022),

* smart electricity grids (Yang et al., 2019),

* wearables (Manogaran et al., 2019; Zhou et al., 2020),

* robotics (Shi et al., 2021; Mur-Labadia et al., 2023),

* autonomous driving (McAllister et al., 2017).
Semantic segmentation

<figure><img src="image_73.png" /><figcaption>(a) Input Image</figcaption></figure>

<figure><img src="image_74.png" /><figcaption>(b) Ground Truth</figcaption></figure>

<figure><img src="image_75.png" /><figcaption>(c) Semantic Segmentation</figcaption></figure>

<figure><img src="image_76.png" /><figcaption>(d) Aleatoric Uncertainty</figcaption></figure>

<figure><img src="image_77.png" /><figcaption>(e) Epistemic Uncertainty</figcaption></figure>

<figure><img src="image_78.png" /></figure>

<figure><img src="image_79.png" /></figure>

<figure><img src="image_80.png" /></figure>

<figure><img src="image_81.png" /></figure>

<figure><img src="image_82.png" /></figure>

<figure><img src="image_83.png" /></figure>
Improvements in healthcare

BDL can yield better predictions and uncertainty estimates, and lead to recommendations that are more interpretable for medical practitioners.

Posterior correlation matrix in MIMIC-III (lower triangular)

<figure><img src="image_84.png" /></figure>

<figure><img src="image_85.png" /></figure>
# Large language models

Combination of Low-Rank Adaptation (LoRA) with Gaussian Stochastic Weight Averaging (SWAG) for LLMs fine-tuning on small datasets

<figure><img src="image_86.png" /></figure>

(Onal et al., 2024)
## Priors

<figure><img src="image_87.png" /></figure>

## Posteriors

<figure><img src="image_88.png" /></figure>

## Applications

<figure><img src="image_89.png" /></figure>

<figure><img src="image_90.png" /></figure>

## Teaching

<figure><img src="image_91.png" /></figure>
# Probabilistic Machine Learning by Kevin P. Murphy

<figure><img src="image_92.png" /></figure>

1 Introduction 1

I Fundamentals 3

2 Probability 5

3 Statistics 69

4 Graphical models 143

5 Information theory 217

6 Optimization 255

II Inference 341

7 Inference algorithms: an overview 343

8 Gaussian filtering and smoothing 355

9 Message passing algorithms 397

10 Variational inference 435

11 Monte Carlo methods 477

12 Markov chain Monte Carlo 493

13 Sequential Monte Carlo 537

III Prediction 567

14 Predictive models: an overview 569

15 Generalized linear models 583

16 Deep neural networks 621

17 Bayesian neural networks 637

18 Gaussian processes 671

19 Beyond the iid assumption 725

IV Generation 761

20 Generative models: an overview 763

21 Variational autoencoders 779

22 Autoregressive models 815

23 Normalizing flows 823

24 Energy-based models 843

25 Diffusion models 861

26 Generative adversarial networks 887

V Discovery 921

27 Discovery methods: an overview 923

28 Latent factor models 925

29 State-space models 975

30 Graph learning 1039

31 Nonparametric Bayesian models 1043

32 Representation learning 1045

33 Interpretability 1069

VI Action 1099

34 Decision making under uncertainty 1101

35 Reinforcement learning 1137

36 Causality 1175

<figure><img src="image_93.png" /></figure>
# A Primer on Bayesian Neural Networks: Review and Debates

Julyan Arbel<fnref n="1" />, Konstantinos Pitas<fnref n="1" />, Mariia Vladimirova<fnref n="2" />, Vincent Fortuin<fnref n="3" />

Neural networks have achieved remarkable performance across various problem domains, but their widespread applicability is hindered by inherent limitations such as overconfidence in predictions, lack of interpretability, and vulnerability to adversarial attacks. To address these challenges, Bayesian neural networks (BNNs) have emerged as a compelling extension of conventional neural networks, integrating uncertainty estimation into their predictive capabilities.

This comprehensive primer presents a systematic introduction to the fundamental concepts of neural networks and Bayesian inference, elucidating their synergistic integration for the development of BNNs. The target audience comprises statisticians with a potential background in Bayesian methods but lacking deep learning expertise, as well as machine learners proficient in deep neural networks but with limited exposure to Bayesian statistics. We provide an overview of commonly employed priors, examining their impact on model behavior and performance. Additionally, we delve into the practical considerations associated with training and inference in BNNs.

Furthermore, we explore advanced topics within the realm of BNN research, acknowledging the existence of ongoing debates and controversies. By offering insights into cutting-edge developments, this primer not only equips researchers and practitioners with a solid foundation in BNNs, but also illuminates the potential applications of this dynamic field. As a valuable resource, it fosters an understanding of BNNs and their promising prospects, facilitating further advancements in the pursuit of knowledge and innovation.

<figure><img src="image_94.png" /></figure>

<figure><img src="image_95.png" /></figure>

<figure><img src="image_96.png" /></figure>

1 Introduction 3

2 Neural networks and statistical learning theory 7

2.1 Choice of architecture 9

2.2 Expressiveness 11

2.3 Inductive bias 12

2.4 Generalization and overfitting 16

2.5 Limitations of the frequentist approach to deep learning 21

3 Bayesian machine learning 25

3.1 Bayesian paradigm 25

3.2 Priors 27

3.3 Computational methods 28

3.4 Model selection 33

4 What are Bayesian neural networks? 35

4.1 Priors 36

4.2 Approximate inference for deep neural networks 46

5 To be Bayesian or not to be? 52

5.1 Frequentist and Bayesian connections 53

5.2 Performance certificates 62

5.3 Benchmarking 68

6 Conclusion 74

References 77

<footnote n="1">¹Centre Inria de l'Université Grenoble Alpes, France</footnote>

<footnote n="2">²Criteo AI Lab, Paris, France</footnote>

<footnote n="3">³Helmholtz AI, Munich, Germany</footnote>
# Position: Bayesian Deep Learning is Needed in the Age of Large-Scale AI

Theodore Papamarkou¹ Maria Skoularidou² Konstantina Palla³ Laurence Aitchison⁴ Julyan Arbel⁵
David Dunson⁶ Maurizio Filippone⁷ Vincent Fortuin⁸ ⁹ ¹⁰ Philipp Hennig¹¹ José Miguel Hernández-Lobato¹²
Aliaksandr Hubin¹³ ¹⁴ Alexander Immer¹⁵ Theofanis Karaletsos¹⁶ Mohammad Emtiyaz Khan¹⁷
Agustinus Kristiadi¹⁸ Yingzhen Li¹⁹ Stephan Mandt²⁰ Christopher Nemeth²¹ Michael A. Osborne²²
Tim G. J. Rudner²³ David Rügamer¹⁰ ²⁴ Yee Whye Teh²⁵ ²⁶ Max Welling²⁷ Andrew Gordon Wilson²⁸
Ruqi Zhang²⁹

## Abstract

In the current landscape of deep learning research, there is a predominant emphasis on achieving high predictive accuracy in supervised tasks involving large image and language datasets. However, a broader perspective reveals a multitude of overlooked metrics, tasks, and data types, such as uncertainty, active and continual learning, and scientific data, that demand attention. Bayesian deep learning (BDL) constitutes a promising avenue,

offering advantages across these diverse settings. This paper posits that BDL can elevate the capabilities of deep learning. It revisits the strengths of BDL, acknowledges existing challenges, and highlights some exciting research avenues aimed at addressing these obstacles. Looking ahead, the discussion focuses on possible ways to combine large-scale foundation models with BDL to unlock their full potential.

Bayesian methods are more critical than ever in the age of large-scale AI in order to reliably assess uncertainties and incorporate existing knowledge in safety-critical decision-making algorithms.
# Bayesian deep learning textbook - 2026 😋

<figure><img src="image_97.png" /></figure>

Large collaborative effort by a 'BDL consortium' of 100 researchers from various institutions

Part 1: Sampling methods

Part 2: Laplace approximations

Part 3: Variational inference

Part 4: Ensemble methods

Part 5: Kernel methods

Part 6: Priors

Part 7: Identifiability and symmetries

Part 8: Scalability with BDL and of BDL

Part 9: Applications

Part 10: Topical developments
# Bayesian deep learning: take-home

<figure><img src="image_98.png" /></figure>
# Bayesian deep learning: take-home

Models that can say: “I’m not sure”

Not necessarily the best accuracy, but good decisions associated with utilities
# Bayesian deep learning: take-home

Models that can say: “I’m not sure”

Not necessarily the best accuracy, but good decisions associated with utilities

## Strengths of BDL

* Uncertainty Quantification

* Data Efficiency

* Adaptability, Interpretability

## Weaknesses of BDL

* Scalability for posterior computation

* Prior specification
# Bayesian deep learning: take-home

Models that can say: “I’m not sure”

Not necessarily the best accuracy, but good decisions associated with utilities

## Strengths of BDL

* Uncertainty Quantification

* Data Efficiency

* Adaptability, Interpretability

## Weaknesses of BDL

* Scalability for posterior computation

* Prior specification

## Workflow

* Choose a prior

* Choose an approximation method

* Choose an implementation
References

Thank you for your attention!

* Mariia Vladimirova, Jakob Verbeek, Pablo Mesejo, and Julyan Arbel.
  Understanding Priors in Bayesian Neural Networks at the Unit Level. ICML, 2019.

* Mariia Vladimirova, Stéphane Girard, Hien D Nguyen, and Julyan Arbel.
  Sub-Weibull distributions: generalizing sub-Gaussian and sub-Exponential properties to heavier-tailed distributions. Stat, 2020.

* Mariia Vladimirova, Julyan Arbel, and Stéphane Girard.
  Bayesian neural network unit priors and generalized Weibull-tail property. ACML, 2021.

* Mariia Vladimirova, Julyan Arbel, and Stéphane Girard.
  Dependence between Bayesian neural network units. BDL workshop, NeurIPS, 2021.

<figure><img src="image_99.png" /></figure>

* Theodore Papamarkou et al.
  Position Paper: Bayesian Deep Learning in the Age of Large-Scale AI. ICML, 2024.

<figure><img src="image_100.png" /></figure>

* Julyan Arbel, Konstantinos Pitas, Mariia Vladimirova, and Vincent Fortuin.
  A primer on Bayesian neural networks: review and debates. Statistical Science, 2024.
https://arxiv.org/abs/2309.16314

<figure><img src="image_101.png" /></figure>
## Credits

* Blog post by Vincent Fortuin
  https://neptune.ai/blog/bayesian-deep-learning-needed-in-the-age-of-large-scale-ai

* Blog post by Piotr Januszewski
  https://neptune.ai/blog/bayesian-neural-networks-with-jax

* Slides on Laplace approximation by Kouroche Bouchiat
  https://bouchi.at/
References

<figure><img src="image_102.png" /></figure>

Arbel, J., Dang, H.-P., Elvira, C., Herzet, C., Naulet, Z., and Vladimirova, M. (2023).

Bayes in action in deep learning and dictionary learning.

ESAIM: Proceedings and Surveys, 74:90–107.

<figure><img src="image_103.png" /></figure>

Arbel, J., Pitas, K., Vladimirova, M., and Fortuin, V. (2024).

A primer on Bayesian neural networks: review and debates.

Statistical Science.

<figure><img src="image_104.png" /></figure>

Bachoc, F. and Lagnoux, A. (2025).

Posterior contraction rates for constrained deep Gaussian processes in density estimation and classification.

Communications in Statistics - Theory and Methods, 54(3):774–811.

<figure><img src="image_105.png" /></figure>

Bhattacharya, S., Liu, Z., and Maiti, T. (2020).

Variational Bayes neural network: Posterior consistency, classification accuracy and computational challenges.

arXiv preprint arXiv:2011.09592.

<figure><img src="image_106.png" /></figure>
<figure><img src="image_107.png" /></figure>

Bhattacharya, S. and Maiti, T. (2021).

Statistical foundation of Variational Bayes neural networks.

Neural Networks, 137:151–173.

<figure><img src="image_108.png" /></figure>

Bos, T. and Schmidt-Hieber, J. (2022).

Convergence rates of deep ReLU networks for multiclass classification.

Electronic Journal of Statistics, 16(1):2724 – 2773.

<figure><img src="image_109.png" /></figure>

Bouchiat, K., Immer, A., Yèche, H., Rätsch, G., and Fortuin, V. (2023).

Laplace-approximated neural additive models: Improving interpretability with Bayesian inference.

arXiv preprint arXiv:2305.16905.

<figure><img src="image_110.png" /></figure>

Braun, A., Kohler, M., Langer, S., and Walk, H. (2024).

Convergence rates for shallow neural networks learned by gradient descent.

Bernoulli, 30(1):475–502.

<figure><img src="image_111.png" /></figure>

Castillo, I. and Egels, P. (2024).

Posterior and variational inference for deep neural networks with heavy-tailed weights.

<figure><img src="image_112.png" /></figure>

Castillo, I. and Randrianarisoa, T. (2024).

Deep Horseshoe Gaussian Processes.

arXiv preprint arXiv:2403.01737.

<figure><img src="image_113.png" /></figure>
<figure><img src="image_114.png" /></figure>

Daxberger, E., Kristiadi, A., Immer, A., Eschenhagen, R., Bauer, M., and Hennig, P. (2021).

Laplace redux - effortless Bayesian deep learning.

*In Advances in Neural Information Processing Systems.*

<figure><img src="image_115.png" /></figure>

Finocchio, G. and Schmidt-Hieber, J. (2023).

Posterior Contraction for Deep Gaussian Process Priors.

*Journal of Machine Learning Research*, 24(66):1–49.

<figure><img src="image_116.png" /></figure>

Gal, Y. and Ghahramani, Z. (2016).

Dropout as a Bayesian approximation: Representing model uncertainty in deep learning.

*In International Conference on Machine Learning.*

<figure><img src="image_117.png" /></figure>

Jantre, S., Bhattacharya, S., and Maiti, T. (2024).

Spike-and-Slab Shrinkage Priors for Structurally Sparse Bayesian Neural Networks.

*IEEE Transactions on Neural Networks and Learning Systems.*

<figure><img src="image_118.png" /></figure>

Kohler, M. and Langer, S. (2021).

On the rate of convergence of fully connected deep neural network regression estimates.

*The Annals of Statistics*, 49(4):2231–2249.

<figure><img src="image_119.png" /></figure>

Lee, K. and Lee, J. (2022).

Asymptotic Properties for Bayesian Neural Network in Besov Space.

*In Advances in Neural Information Processing Systems.*

<figure><img src="image_120.png" /></figure>
<figure><img src="image_121.png" /></figure>

MacKay, D. (1992).

A practical Bayesian framework for backpropagation networks.

*Neural Computation*, 4(3):448–472.

<figure><img src="image_122.png" /></figure>

Murphy, K. P. (2023).

*Probabilistic Machine Learning: Advanced Topics*.

MIT Press.

<figure><img src="image_123.png" /></figure>

Neal, R. (1995).

*Bayesian learning for neural networks*.

Springer.

<figure><img src="image_124.png" /></figure>

Papamarkou, T., Skoularidou, M., Palla, K., Aitchison, L., Arbel, J., Dunson, D., Filippone, M., Fortuin, V., Hennig, P., Hernández-Lobato, J. M., Hubin, A., Immer, A., Karaletsos, T., Khan, M. E., Kristiadi, A., Li, Y., Mandt, S., Nemeth, C., Osborne, M. A., Rudner, T. G. J., Rügamer, D., Teh, Y. W., Welling, M., Wilson, A. G., and Zhang, R. (2024).

*Position: Bayesian deep learning is needed in the age of large-scale AI*.

*International Conference on Machine Learning*.

<figure><img src="image_125.png" /></figure>

Pitas, K. and Arbel, J. (2023).

The fine print on tempered posteriors.

*Asian Conference on Machine Learning*.

<figure><img src="image_126.png" /></figure>
<figure><img src="image_127.png" /></figure>

Sharma, M., Farquhar, S., Nalisnick, E., and Rainforth, T. (2023).

Do bayesian neural networks need to be fully stochastic?

*In International Conference on Artificial Intelligence and Statistics*, pages 7694–7722. PMLR.

<figure><img src="image_128.png" /></figure>

Vladimirova, M., Arbel, J., and Girard, S. (2021).

Bayesian neural network unit priors and generalized Weibull-tail property.

*Asian Conference on Machine Learning*.

<figure><img src="image_129.png" /></figure>

Vladimirova, M., Girard, S., Nguyen, H. D., and Arbel, J. (2020).

Sub-Weibull distributions: generalizing sub-Gaussian and sub-Exponential properties to heavier-tailed distributions.

*Stat*.

<figure><img src="image_130.png" /></figure>

Vladimirova, M., Verbeek, J., Mesejo, P., and Arbel, J. (2019).

Understanding Priors in Bayesian Neural Networks at the Unit Level.

*International Conference on Machine Learning*.

<figure><img src="image_131.png" /></figure>

Wolinski, P. and Arbel, J. (2025).

Gaussian Pre-Activations in Neural Networks: Myth or Reality?

*Transactions on Machine Learning Research*.

<figure><img src="image_132.png" /></figure>