Approximate, computationally efficient online learning in Bayesian spiking neurons
From MaRDI portal
Publication:5378331
Recommendations
Cites work
- scientific article; zbMATH DE number 722978 (Why is no real title available?)
- Analyticity, Convergence, and Convergence Rate of Recursive Maximum-Likelihood Estimation in Hidden Markov Models
- Approximate, computationally efficient online learning in Bayesian spiking neurons
- Bayesian Spiking Neurons I: Inference
- Bayesian Spiking Neurons II: Learning
- Neural Representation of Probabilistic Information
- On recursive estimation for hidden Markov models
- On-line estimation of hidden Markov model parameters based on the Kullback-Leibler information measure
- Online Learning with Hidden Markov Models
- Online expectation maximization based algorithms for inference in hidden Markov models
- Perception as Bayesian Inference
- Recursive estimation of parameters in Markov-modulated Poisson processes
Cited in
(4)
This page was built for publication: Approximate, computationally efficient online learning in Bayesian spiking neurons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5378331)