paper-with-me

홈 › Papers

SLANG: Fast Structured Covariance Approximations for Bayesian Deep Learning with Natural Gradient

2018-11-11 · NeurIPS 2018 12 · Aaron Mishkin, Frederik Kunstner, Didrik Nielsen, Mark Schmidt, Mohammad Emtiyaz Khan

Uncertainty estimation in large deep-learning models is a computationally challenging task, where it is difficult to form even a Gaussian approximation to the posterior distribution. In such situations, existing methods usually resort to a diagonal approximation of the covariance matrix despite, the fact that these matrices are known to result in poor uncertainty estimates. To address this issue, we propose a new stochastic, low-rank, approximate natural-gradient (SLANG) method for variational inference in large, deep models. Our method estimates a "diagonal plus low-rank" structure based solely on back-propagated gradients of the network log-likelihood. This requires strictly less gradient computations than methods that compute the gradient of the whole variational objective. Empirical evaluations on standard benchmarks confirm that SLANG enables faster and more accurate estimation of uncertainty than mean-field methods, and performs comparably to state-of-the-art methods.

📄 PDF Abstract BibTeX arXiv:1811.04504

Code (2)

aaronpmishkin/SLANG 공식 구현
lamantinushka/StructuredCovariance pytorch

Tasks

Variational Inference

Similar Papers 제목 키워드 기반

Liberty or Depth: Deep Bayesian Neural Nets Do Not Need Complex Weight Posterior Approximations

2020-02-10 · NeurIPS 2020 12 · Sebastian Farquhar, Lewis Smith, Yarin Gal

We challenge the longstanding assumption that the mean-field approximation for variational inference in Bayesian neural networks is severely restrictive, and show this is not the case in deep networks. We prove several r…

Variational Inference

Fast and Simple Natural-Gradient Variational Inference with Mixture of Exponential-family Approximations

2019-06-07 · Wu Lin, Mohammad Emtiyaz Khan, Mark Schmidt

Natural-gradient methods enable fast and simple algorithms for variational inference, but due to computational difficulties, their use is mostly limited to \emph{minimal} exponential-family (EF) approximations. In this p…

Bayesian InferenceVariational Inference

High-Dimensional Sparse Bayesian Learning without Covariance Matrices

2022-02-25 · Alexander Lin, Andrew H. Song, Berkin Bilgic, Demba Ba

Sparse Bayesian learning (SBL) is a powerful framework for tackling the sparse coding problem. However, the most popular inference algorithms for SBL become too expensive for high-dimensional settings, due to the need to…

Vocal Bursts Intensity Prediction

Expressive yet Tractable Bayesian Deep Learning via Subnetwork Inference

2020-09-28 · pproximateinference AABI Symposium 2021 1 · Erik Daxberger, Eric Nalisnick, James Allingham, Javier Antoran 외

The Bayesian paradigm has the potential to solve some of the core issues in modern deep learning, such as poor calibration, data inefficiency, and catastrophic forgetting. However, scaling Bayesian inference to the high-…

Bayesian InferenceDeep Learning

Additive Tree-Structured Conditional Parameter Spaces in Bayesian Optimization: A Novel Covariance Function and a Fast Implementation

2020-10-06 · Xingchen Ma, Matthew B. Blaschko

Bayesian optimization (BO) is a sample-efficient global optimization algorithm for black-box functions which are expensive to evaluate. Existing literature on model based optimization in conditional parameter spaces are …

Bayesian Optimizationglobal-optimizationNeural Network CompressionSMAC+1