Efficient supervised learning in networks with binary synapses
Carlo Baldassi, Alfredo Braunstein, Nicolas Brunel, Riccardo Zecchina

TL;DR
This paper introduces a biologically plausible online learning algorithm for networks with binary synapses, achieving near-optimal learning capacity and robustness, with potential applications in neuroscience and hardware implementations.
Contribution
It presents the first efficient online algorithm for learning multiple patterns with binary synapses, incorporating a novel meta-plastic rule inspired by belief propagation.
Findings
Achieves near-theoretical capacity for pattern learning in binary synapse networks.
Performance is optimal with a small number of hidden states, especially in sparse coding.
System with two visible states and multiple hidden states is highly noise-robust.
Abstract
Recent experimental studies indicate that synaptic changes induced by neuronal activity are discrete jumps between a small number of stable states. Learning in systems with discrete synapses is known to be a computationally hard problem. Here, we study a neurobiologically plausible on-line learning algorithm that derives from Belief Propagation algorithms. We show that it performs remarkably well in a model neuron with binary synapses, and a finite number of `hidden' states per synapse, that has to learn a random classification task. Such system is able to learn a number of associations close to the theoretical limit, in time which is sublinear in system size. This is to our knowledge the first on-line algorithm that is able to achieve efficiently a finite number of patterns learned per binary synapse. Furthermore, we show that performance is optimal for a finite number of hidden states…
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.
