Neural auto-association with optimal Bayesian learning
Andreas Knoblauch

TL;DR
This paper investigates the optimal Bayesian auto-associative neural network, comparing different learning rules, and introduces an adaptive mechanism that enhances storage capacity, revealing subtle dependencies affecting performance.
Contribution
It introduces an adaptive noise estimation mechanism (ANE) that improves Bayesian learning in auto-associative neural networks, surpassing previous models in storage capacity.
Findings
Performance depends on input pattern dependencies violating naive Bayes assumptions.
Adaptive noise estimation (ANE) significantly enhances storage capacity.
Bayesian learning with ANE achieves maximum storage capacity.
Abstract
Neural associative memories are single layer perceptrons with fast synaptic learning typically storing discrete associations between pairs of neural activity patterns. Previous works have analyzed the optimal networks under naive Bayes assumptions of independent pattern components and heteroassociation, where the task is to learn associations from input to output patterns. Here I study the optimal Bayesian associative network for auto-association where input and output layers are identical. In particular, I compare performance to different variants of approximate Bayesian learning rules, like the BCPNN (Bayesian Confidence Propagation Neural Network), and try to explain why sometimes the suboptimal learning rules achieve higher storage capacity than the (theoretically) optimal model. It turns out that performance can depend on subtle dependencies of input components violating the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural dynamics and brain function · Neural Networks and Applications
