Skip to content

Variational approximation for sharp Bayesian neural networks

· 0 citations · 21 references

TL;DR

The results suggest that the Cauchy mean-field approximation introduces a sharp-promoting bias, making it a suitable modeling choice for signals with discontinuous structure, and a computationally appealing alternative to full Bayesian inference methods such as MCMC.

View source

Similar papers

Preprint Oct 2026

Edge-preserving Bayesian neural networks via hierarchical sparsity-promoting priors

Recovering piecewise-smooth functions with jump discontinuities from noisy, indirect, and incomplete data is a central task in computational inverse problems. Bayesian neural networks (BNNs) with heavy-tailed weight priors have emerged as effective edge-preserving priors for such problems. However, posterior inference...

Jan Habscheid, J. Glaubitz · 0 citations
#machine learning Preprint Oct 2026

Theoretical and Practical Advances in Hierarchical Bayesian Deep Learning Methodology

Reliable uncertainty quantification remains an important challenge in AI. Hierarchical Bayesian methods provide a principled framework for this by representing unknown quantities through posterior distributions. Joint inference of neural-network parameters and prior hyperparameters is challenging for conventional Marko...

N. K. Chada, S. Cotter, K. J. H. Law et al. · 0 citations
#machine learning Preprint Oct 2026

Generalized Matheron Variational Implicit Processes

Implicit-process priors specify distributions over functions through sample-forward mechanisms such as Bayesian neural networks and stochastic simulators, but their function-space densities are typically unavailable. We introduce Generalized Matheron Variational Implicit Processes (GMVIP), a pathwise variational family...

Luis A. Ortega, Andrés R. Masegosa, Thomas D. Nielsen · 0 citations
#artificial intelligence Preprint Oct 2026

Scalable AI Uncertainty Quantification via Generalized Laplace Active Subspaces

Reliable uncertainty quantification (UQ) is essential for deploying neural networks in scientific and high-stakes applications, but full Bayesian inference over the network parameters is computationally infeasible. We propose a low-rank generalized Laplace approximation for neural-network UQ based on a small number of...

W. Edeling, P. V. Coveney · 0 citations
Preprint Aug 2026

On the approximation of posterior laws in compound loss models by conditional Wasserstein GANs

Bayesian inference in compound loss models must often be repeated across policies, market scenarios, and prior specifications. Outside conjugate cases, this may require repeated numerical integration or Markov chain Monte Carlo (MCMC). We formulate this problem as amortized posterior approximation and construct a condi...

Aleksandar Arandjelović, P. Shevchenko, G. Tzougas · 0 citations
#machine learning Preprint Oct 2026

Flow Matching for Fast Posterior Sampling in Bayesian Inverse Problems

Sampling from the posterior is the central task of computational Bayesian inverse problems. The standard workhorse in Bayesian inference - Markov chain Monte Carlo (MCMC) - is sequential, yields correlated samples, and must be rerun for each observation. Conditional flow matching offers an amortized alternative: a tran...

Jan Blechschmidt, O. Ernst, Moritz Poguntke et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.