Approximate, Computationally Efficient Online Learning in Bayesian Spiking Neurons
From MaRDI portal
Publication:5378331
DOI10.1162/NECO_a_00560zbMath1416.92039OpenAlexW2152726503WikidataQ46719715 ScholiaQ46719715MaRDI QIDQ5378331
David B. Grayden, Jonathan H. Manton, Levin Kuhlmann, André van Schaik, J. Tapson, Michael Hauser-Raspe
Publication date: 12 June 2019
Published in: Neural Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1162/neco_a_00560
Neural biology (92C20) Neural networks for/in biological studies, artificial life and related topics (92B20) Online algorithms; streaming algorithms (68W27)
Related Items
Cites Work
- Unnamed Item
- On recursive estimation for hidden Markov models
- Online expectation maximization based algorithms for inference in hidden Markov models
- Recursive estimation of parameters in Markov-modulated Poisson processes
- Online Learning with Hidden Markov Models
- Bayesian Spiking Neurons I: Inference
- Bayesian Spiking Neurons II: Learning
- On-line estimation of hidden Markov model parameters based on the Kullback-Leibler information measure
- Neural Representation of Probabilistic Information
- Analyticity, Convergence, and Convergence Rate of Recursive Maximum-Likelihood Estimation in Hidden Markov Models
- Approximate, Computationally Efficient Online Learning in Bayesian Spiking Neurons
- Perception as Bayesian Inference