The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Equilibrium Propagation: Bridging the Gap between Energy-Based Models and Backpropagation
Open accessAbstract
We introduce Equilibrium Propagation, a learning framework for energy-based models. It involves only one kind of neural computation, performed in both the first phase (when the prediction is made) and the second phase of training (after the target or prediction error is revealed). Although this algorithm computes the gradient of an objective function just like Backpropagation, it does not need a special computation or circuit for the second phase, where errors are implicitly propagated. Equilibrium Propagation shares similarities with Contrastive Hebbian Learning and Contrastive Divergence while solving the theoretical issues of both algorithms: our algorithm computes the gradient of a well-defined objective function. Because the objective function is defined in terms of local perturbations, the second phase of Equilibrium Propagation corresponds to only nudging the prediction (fixed point or stationary distribution) toward a configuration that reduces prediction error. In the case of a recurrent multi-layer supervised network, the output units are slightly nudged toward their target in the second phase, and the perturbation introduced at the output layer propagates backward in the hidden layers. We show that the signal "back-propagated" during this second phase corresponds to the propagation of error derivatives and encodes the gradient of the objective function, when the synaptic update corresponds to a standard form of spike-timing dependent plasticity. This work makes it more plausible that a mechanism similar to Backpropagation could be implemented by brains, since leaky integrator neural computation performs both inference and error back-propagation in our model. The only local difference between the two phases is whether synaptic changes are allowed or not. We also show experimentally that multi-layer recurrently connected networks with 1, 2, and 3 hidden layers can be trained by Equilibrium Propagation on the permutation-invariant MNIST task.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Hopfield, J. J. (1984) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.81.10.3088 · Cited by 6,918
Training Products of Experts by Minimizing Contrastive Divergence
Hinton, G. E. (2002) · Neural Computation · doi:10.1162/089976602760128018 · Cited by 4,879 · cited 2×
“The Contrastive Divergence algorithm (Hinton, 2002) has theoretical issues too: the CD1 update rule may cycle indefinitely (Sutskever and Tieleman, 2010).”
Method(2010) · Journal of Machine Learning Research · doi:10.5555/1756006.1953039 · Cited by 4,051
Advances in neural information processing systems 11
Peter Sollich, A. (1999) · Cited by 3,168
Bienenstock, E., Cooper, L., & Munro, P. (1982) · The Journal of Neuroscience · doi:10.1523/jneurosci.02-01-00032.1982 · Cited by 2,896
Synaptic Modification by Correlated Activity: Hebb's Postulate Revisited
Bi, G.-Q., & Poo, M.-M. (2001) · Annual Review of Neuroscience · doi:10.1146/annurev.neuro.24.1.139 · Cited by 1,489
Active inference: a process theory
Friston, K., FitzGerald, T., Rigoli, F., Schwartenbeck, P., & Pezzulo, G. (2017) · Neural Computation · doi:10.1162/neco_a_00912 · Cited by 1,156
A neuronal learning rule for sub-millisecond temporal coding
Gerstner, W., Kempter, R., van Hemmen, J. L., & Wagner, H. (1996) · Nature · doi:10.1038/383076a0 · Cited by 1,110
The Spike-Timing Dependence of Plasticity
Feldman, D. E. (2012) · Neuron · doi:10.1016/j.neuron.2012.08.001 · Cited by 1,071
Generalization of back-propagation to recurrent neural networks
Pineda, F. J. (1987) · Physical Review Letters · doi:10.1103/physrevlett.59.2229 · Cited by 931
Training restricted Boltzmann machines using approximations to the likelihood gradient
Tieleman, T. (2008) · Proceedings of the 25th international conference on Machine learning - ICML '08 · doi:10.1145/1390156.1390290 · Cited by 837
Random synaptic feedback weights support error backpropagation for deep learning
Lillicrap, T. P., Cownden, D., Tweed, D. B., & Akerman, C. J. (2016) · Nature Communications · doi:10.1038/ncomms13276 · Cited by 812
Spike-timing-dependent synaptic modification induced by natural spike trains
Froemke, R. C., & Dan, Y. (2002) · Nature · doi:10.1038/416433a · Cited by 803
Spontaneous Cortical Activity Reveals Hallmarks of an Optimal Internal Model of the Environment
Berkes, P., Orbán, G., Lengyel, M., & Fiser, J. (2011) · Science · doi:10.1126/science.1195870 · Cited by 782
Friston, K. J., & Stephan, K. E. (2007) · Synthese · doi:10.1007/s11229-007-9237-y · Cited by 673
Proceedings of the 1988 Connectionist Models Summer School
Touretzsky, D., Hinton, G. E., & B, T. J. S. A. (1989) · Morgan Kaufmann eBooks · Cited by 611
Spike-Timing-Dependent Plasticity: A Comprehensive Overview
Markram, H., Gerstner, W., & Sjöström, P. J. (2012) · Frontiers in Synaptic Neuroscience · doi:10.3389/fnsyn.2012.00002 · Cited by 369
O'Reilly, R. C. (1996) · Neural Computation · doi:10.1162/neco.1996.8.5.895 · Cited by 352
Hopfield, J. J. (1988) · National Academy of Sciences eBooks · Cited by 282
Towards Biologically Plausible Deep Learning
Bengio, Y., Lee, D.-H., Bornschein, J., Mesnard, T., & Lin, Z. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1502.04156 · Cited by 276
Self-citationGjorgjieva, J., Clopath, C., Audet, J., & Pfister, J.-P. (2011) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1105933108 · Cited by 213
Intrator, N., & Cooper, L. N. (1992) · Neural Networks · doi:10.1016/s0893-6080(05)80003-6 · Cited by 211
Equivalence of Backpropagation and Contrastive Hebbian Learning in a Layered Network
Xie, X., & Seung, H. S. (2003) · Neural Computation · doi:10.1162/089976603762552988 · Cited by 184
STDP-Compatible Approximation of Backpropagation in an Energy-Based Model
Bengio, Y., Mesnard, T., Fischer, A., Zhang, S., & Wu, Y. (2017) · Neural Computation · doi:10.1162/neco_a_00934 · Cited by 115
Self-citationSTDP as presynaptic activity times rate of change of postsynaptic activityPreprint
Bengio, Y., Mesnard, T., Fischer, A., Zhang, S., & Wu, Y. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1509.05936 · Cited by 45
Self-citationWhy are deep nets reversible: A simple theory, with implications for trainingPreprint
Arora, S., Liang, Y., & Ma, T. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1511.05653 · Cited by 40
Nonlinear backpropagation: doing backpropagation without derivatives of the activation function
Hertz, J., Krogh, A., Lautrup, B. E., & Lehmann, T. (1997) · IEEE Transactions on Neural Networks · doi:10.1109/72.641455 · Cited by 27
Training recurrent networks online without backtrackingPreprint
Ollivier, Y., Tallec, C., & Charpiat, G. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1507.07680 · Cited by 24
Feedforward Initialization for Fast Inference of Deep Generative Networks is biologically plausiblePreprint
Bengio, Y., Scellier, B., Bilaniuk, O., Sacramento, J., & Senn, W. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1606.01651 · Cited by 23
Self-citationMesnard, T., Wulfram Gerstner, B., & Brea, J. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1612.03214 · Cited by 18
Cited by
Building machines that learn and think like people
Lake, B. M., Ullman, T. D., Tenenbaum, J. B., & Gershman, S. J. (2017) · Behavioral and Brain Sciences · doi:10.1017/s0140525x16001837 · Cited by 2,550
Neuroscience-Inspired Artificial Intelligence
Hassabis, D., Kumaran, D., Summerfield, C., & Botvinick, M. (2017) · Neuron · doi:10.1016/j.neuron.2017.06.011 · Cited by 1,557
Deep learning modelling techniques: Current progress, applications, advantages, and challenges
Ahmed, S. F., Alam, M. S. B., Hassan, M., Rozbu, M. R., Ishtiak, T., Rafa, N., Mofijur, M., Shawkat Ali, A. B. M., & Gandomi, A. H. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-023-10466-8 · Cited by 1,079
A deep learning framework for neuroscience
Richards, B. A., Lillicrap, T. P., Beaudoin, P., Bengio, Y., Bogacz, R., Christensen, A., Clopath, C., Costa, R. P., de Berker, A., Ganguli, S., et al. (2019) · Nature Neuroscience · doi:10.1038/s41593-019-0520-2 · Cited by 1,027
Self-citationLillicrap, T. P., Santoro, A., Marris, L., Akerman, C. J., & Hinton, G. (2020) · Nature Reviews Neuroscience · doi:10.1038/s41583-020-0277-3 · Cited by 908
Metadata
- Authors
- Scellier, B., & Bengio, Y.
- Venue
- Frontiers in Computational Neuroscience
- Publisher
- Frontiers Media SA
- Published
- 2017-05-04
- Volume
- 11
- Pages
- 24-24
- ISSN
- 1662-5188 (ISSN-L)
- OpenAlex
- W2527798464
- Cited by
- 477
- References
- 30
- FWCI
- 18.70
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.