liu.seSearch for publications in DiVA
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Variational approximation for sharp Bayesian neural networks.
Linköping University, Department of Computer and Information Science.
2026 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

Bayesian neural networks (BNNs) have been widely applied to solve inverse problems (e.g., deconvolution), offering flexibility between prediction fidelity and uncertainty quantification. In this work, we focus on BNNs with heavy-tailed distributed weights, which aim to preserve the sharpness of the underlying unknown state.

Numerically, we consider a one-dimensional deconvolution problem to illustrate the effectiveness of heavy-tailed BNNs. Gaussian and Laplace distributed priors are also studied to show the limitations of smooth and sparse promoting priors. Across all considered priors, we evaluated three posterior approximation methods: deep ensembles, Markov Chain Monte Carlo (MCMC) sampling and, our primary interest, the mean-field variational approximation with Cauchy-distributed factors.

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. By explicitly imposing a heavy-tailed structure on the posterior distribution, the recovered signal exhibits sharp transitions that closely resemble the edges of the underlying hidden state.

Furthermore, we find that the Cauchy mean-field approximation achieves competitive edge-preserving reconstructions even with a significantly reduced network capacity, provided the network is large enough to sample a sufficient number of extreme weights. This makes it a computationally appealing alternative to full Bayesian inference methods such as MCMC.

Place, publisher, year, edition, pages
2026.
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:liu:diva-226369ISRN: LIU-IDA/STAT-A--26/008--SEOAI: oai:DiVA.org:liu-226369DiVA, id: diva2:2090126
Supervisors
Examiners
Available from: 2026-08-13 Created: 2026-08-05 Last updated: 2026-08-13Bibliographically approved

Open Access in DiVA

fulltext(907 kB)17 downloads
File information
File name FULLTEXT01.pdfFile size 907 kBChecksum SHA-512
b6edcf07c9f1d8651e5e1013df7fb3613e1268267eb94ef77615090abe3708e8a81124e6ace2b13b522ba4873d993723431e770f59607263431e834f4a68337e
Type fulltextMimetype application/pdf

By organisation
Department of Computer and Information Science
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 3887 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf