Neural-Inspired Posterior Approximation (NIPA)
Not on the map. Why?
Abstract (arXiv)
Humans learn efficiently from their environment by engaging multiple interacting neural systems that support distinct yet complementary forms of control, including model-based (goal-directed) planning, model-free (habitual) responding, and episodic memory-based learning. Model-based mechanisms compute prospective action values using an internal model of the environment, supporting flexible but computationally costly planning; model-free mechanisms cache value estimates and build heuristics that enable fast, efficient habitual responding; and memory-based mechanisms allow rapid adaptation from individual experience. In this work, we aim to elucidate the computational principles underlying this biological efficiency and translate them into a sampling algorithm for scalable Bayesian inference through effective exploration of the posterior distribution. More specifically, our proposed algorithm comprises three components: a model-based module that uses the target distribution for guided but computationally slow sampling; a model-free module that uses previous samples to learn patterns in the parameter space, enabling fast, reflexive sampling without directly evaluating the expensive target distribution; and an episodic-control module that supports rapid sampling by recalling specific past events (i.e., samples). We show that this approach advances Bayesian methods and facilitates their application to large-scale statistical machine learning problems. In particular, we apply our proposed framework to Bayesian deep learning, with an emphasis on proper and principled uncertainty quantification.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 21 of its 91 references that are in the map. First posted on arXiv 30 Jan 2026.
Builds on
21 of 91 references.
References · 21
- 2017On Calibration of Modern Neural Networkscited by 4,860
- 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,416
- 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,888
- 2016Variational Inference: A Review for Statisticianscited by 1,466
- 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,194
- 2018GPyTorch: Blackbox Matrix-Matrix Gaussian Process Inference with GPU Accelerationcited by 603
- 2019A Simple Baseline for Bayesian Uncertainty in Deep Learningcited by 555
- 2019Measuring Calibration in Deep Learningcited by 443
- 2014Stochastic Gradient Hamiltonian Monte Carlocited by 341
- 2020Hands-on Bayesian Neural Networks -- a Tutorial for Deep Learning Userscited by 336
- 2018When Gaussian Process Meets Big Data: A Review of Scalable GPscited by 205
- 2019Stochastic gradient Markov chain Monte Carlocited by 56
9 more
- 2014GPS-ABC: Gaussian Process Surrogate Approximate Bayesian Computationcited by 17
- 2015Gradient-free Hamiltonian Monte Carlo with Efficient Kernel Exponential Familiescited by 15
- 2016Variational Hamiltonian Monte Carlo via Score Matchingcited by 14
- 2021Structured Stochastic Gradient MCMCcited by 12
- 2021Efficient and Generalizable Tuning Strategies for Stochastic Gradient MCMCcited by 11
- 2021Scaling Up Bayesian Uncertainty Quantification for Inverse Problems using Deep Neural Networkscited by 9
- 2013Variational MCMCcited by 7
- 2015Hamiltonian Monte Carlo Acceleration Using Surrogate Functions with Random Basescited by 5
- 2023Coreset Markov Chain Monte Carlocited by 5
Built on by
Not cited yet.