paper-with-me

홈 › Papers

Neurons as Monte Carlo Samplers: Bayesian Inference and Learning in Spiking Networks

2014-12-01 · NeurIPS 2014 12 · Yanping Huang, Rajesh P. Rao

We propose a two-layer spiking network capable of performing approximate inference and learning for a hidden Markov model. The lower layer sensory neurons detect noisy measurements of hidden world states. The higher layer neurons with recurrent connections infer a posterior distribution over world states from spike trains generated by sensory neurons. We show how such a neuronal network with synaptic plasticity can implement a form of Bayesian inference similar to Monte Carlo methods such as particle filtering. Each spike in the population of inference neurons represents a sample of a particular hidden world state. The spiking activity across the neural population approximates the posterior distribution of hidden state. The model provides a functional explanation for the Poisson-like noise commonly observed in cortical responses. Uncertainties in spike times provide the necessary variability for sampling during inference. Unlike previous models, the hidden world state is not observed by the sensory neurons, and the temporal dynamics of the hidden state is unknown. We demonstrate how this network can sequentially learn the hidden Markov model using a spike-timing dependent Hebbian learning rule and achieve power-law convergence rates.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

Bayesian Inference

Similar Papers 제목 키워드 기반

Incorporating the ChEES Criterion into Sequential Monte Carlo Samplers

2025-04-03 · Andrew Millard, Joshua Murphy, Daniel Frisch, Simon Maskell

Markov chain Monte Carlo (MCMC) methods are a powerful but computationally expensive way of performing non-parametric Bayesian inference. MCMC proposals which utilise gradients, such as Hamiltonian Monte Carlo (HMC), can…

Bayesian InferenceGPU

Measuring the non-asymptotic convergence of sequential Monte Carlo samplers using probabilistic programming

2016-12-07 · Marco F. Cusumano-Towner, Vikash K. Mansinghka

A key limitation of sampling algorithms for approximate inference is that it is difficult to quantify their approximation error. Widely used sampling schemes, such as sequential importance sampling with resampling and Me…

Probabilistic Programming

Utilising Gradient-Based Proposals Within Sequential Monte Carlo Samplers for Training of Partial Bayesian Neural Networks

2025-05-01 · Andrew Millard, Joshua Murphy, Simon Maskell, Zheng Zhao

Partial Bayesian neural networks (pBNNs) have been shown to perform competitively with fully Bayesian neural networks while only having a subset of the parameters be stochastic. Using sequential Monte Carlo (SMC) sampler…

Fast fully-reproducible serial/parallel Monte Carlo and MCMC simulations and visualizations via ParaMonte::Python library

2020-10-01 · Amir Shahmoradi, Fatemeh Bagheri, Joshua Alexander Osborne

ParaMonte::Python (standing for Parallel Monte Carlo in Python) is a serial and MPI-parallelized library of (Markov Chain) Monte Carlo (MCMC) routines for sampling mathematical objective functions, in particular, the pos…

Uncertainty Quantification

Augmented Ensemble MCMC sampling in Factorial Hidden Markov Models

2017-03-24 · Kaspar Märtens, Michalis K. Titsias, Christopher Yau

Bayesian inference for factorial hidden Markov models is challenging due to the exponentially sized latent variable space. Standard Monte Carlo samplers can have difficulties effectively exploring the posterior landscape…

Bayesian Inference