Minimizing relative entropy in hierarchical predictive coding

DOI10.1007/978-3-319-11433-0_17MaRDI QIDQ2938411zbMATH OpenOpenAlexFDO

Authors Johan Kwisthout

Publication date 14 January 2015

Published in Probabilistic Graphical Models (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-11433-0_17

zbMATH Keywords

Bayesian inferencebraincomputational complexityhierarchical predictive coding

Mathematics Subject Classification ID

Bayesian inference (62F15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Neural networks for/in biological studies, artificial life and related topics (92B20)

Recommendations

• Toward a unified theory of efficient, predictive, and sparse coding
• Evaluating the extent to which homeostatic plasticity learns to compute prediction errors in unstructured neuronal networks
• Bayesian models of brain and behaviour
• Predictive coding, variational autoencoders, and biological connections
• scientific article; zbMATH DE number 5284813

Cited in

(2)

• Toward optimality in scalable predictive coding
• Predictive coding, variational autoencoders, and biological connections

This page was built for publication: Minimizing relative entropy in hierarchical predictive coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938411)