Fetching the paper…
Reading the bibliography…
Message-passing algorithms based on the Belief Propagation (BP) equations constitute a well-known distributed computational scheme.
Statistical theory of superlattices
Hans Bethe · 1935
Earlier work this paper cites.
On ising’s model of ferromagnetism
R. Peierls · 1936
Earlier work this paper cites.
Low-density parity-check codes
Robert Gallager · 1962
Earlier work this paper cites.
Reverend Bayes on inference engines: A distributed hierarchical approach
Judea Pearl · 1982
Earlier work this paper cites.
Spin glass theory and beyond: An Introduction to the Replica Method and Its Applications , volume 9
Marc Mézard, Giorgio Parisi, and Miguel Angel Virasoro · 1987
Earlier work this paper cites.
Catastrophic interference in connectionist networks: The sequential learning problem
Michael McCloskey and Neal J Cohen · 1989
Earlier work this paper cites.
Catastrophic forgetting, rehearsal and pseudorehearsal
Anthony Robins · 1995
Earlier work this paper cites.
Expectation propagation for approximate bayesian inference
Thomas P. Minka · 2001
Earlier work this paper cites.
Understanding Belief Propagation and Its Generalizations , pp. 239–269
Jonathan S. Yedidia, William T. Freeman, and Yair Weiss · 2003
Earlier work this paper cites.
Cascade models of synaptically stored memories
Stefano Fusi, Patrick J Drew, and Larry F Abbott · 2005
Earlier work this paper cites.
Learning by message passing in networks of discrete synapses
Alfredo Braunstein and Riccardo Zecchina · 2006
Earlier work this paper cites.
Efficient supervised learning in networks with binary synapses
Carlo Baldassi, Alfredo Braunstein, Nicolas Brunel, and Riccardo Zecchina · 2007
Earlier work this paper cites.
Neural models of Bayesian belief propagation. , pp. 239–267
Rajesh P. N. Rao · 2007
Earlier work this paper cites.
Information, Physics, and Computation
Marc Mézard and Andrea Montanari · 2009
Earlier work this paper cites.
Understanding the difficulty of training deep feedforward neural networks
Xavier Glorot and Yoshua Bengio · 2010
Earlier work this paper cites.
An empirical investigation of catastrophic forgetting in gradient-based neural networks
Ian J Goodfellow, Mehdi Mirza, Da Xiao, Aaron Courville, and Yoshua Bengio · 2013
Earlier work this paper cites.
Bilinear generalized approximate message passing—part i: Derivation
Jason T Parker, Philip Schniter, and Volkan Cevher · 2014
Earlier work this paper cites.
Expectation backpropagation: Parameter-free training of multilayer neural networks with continuous or discrete weights
Daniel Soudry, Itay Hubara, and Ron Meir · 2014
Earlier work this paper cites.
Subdominant dense clusters allow for simple learning and high computational performance in neural networks with discrete synapses
Carlo Baldassi, Alessandro Ingrosso, Carlo Lucibello, Luca Saglietti, and Riccardo Zecchina · 2015
Cited alongside, same era.
Probabilistic backpropagation for scalable learning of bayesian neural networks
José Miguel Hernández-Lobato and Ryan P. Adams · 2015
Cited alongside, same era.
Song Han, Huizi Mao, and William J. Dally · 2016
Cited alongside, same era.
Binarized neural networks
Itay Hubara, Matthieu Courbariaux, Daniel Soudry, Ran El-Yaniv, and Yoshua Bengio · 2016
Cited alongside, same era.
Phase transitions and sample complexity in bayes-optimal matrix factorization
Yoshiyuki Kabashima, Florent Krzakala, Marc Mézard, Ayaka Sakata, and Lenka Zdeborová · 2016
Cited alongside, same era.
Optimal errors and phase transitions in high-dimensional generalized linear models
Jean Barbier, Florent Krzakala, Nicolas Macris, Léo Miolane, and Lenka Zdeborová · 2019
Later among the works it cites.
Vector approximate message passing
Sundeep Rangan, Philip Schniter, and Alyson K Fletcher · 2019
Later among the works it cites.
Shaping the learning landscape in neural networks around wide flat minima
Carlo Baldassi, Fabrizio Pittorino, and Riccardo Zecchina · 2020
Later among the works it cites.
Mean-field inference methods for neural networks
Marylou Gabrié · 2020
Later among the works it cites.
Modeling the influence of data structure on learning in neural networks: The hidden manifold model
Sebastian Goldt, Marc Mézard, Florent Krzakala, and Lenka Zdeborová · 2020
Later among the works it cites.
Fantastic generalization measures and where to find them
Yiding Jiang, Behnam Neyshabur, Hossein Mobahi, Dilip Krishnan, and Samy Bengio · 2020
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Statistical physics of inference: Thresholds and algorithms
Lenka Zdeborová and Florent Krzakala · 2016
Cited alongside, same era.
Sparsely-connected neural networks: Towards efficient VLSI implementation of deep neural networks
Arash Ardakani, Carlo Condo, and Warren J. Gross · 2017
Cited alongside, same era.
Entropy-sgd: Biasing gradient descent into wide valleys
Pratik Chaudhari, Anna Choromanska, Stefano Soatto, Yann LeCun, Carlo Baldassi, Christian Borgs, Jennifer T. Chayes, Levent Sagun, and Riccardo Zecchina · 2017
Cited alongside, same era.
Overcoming catastrophic forgetting in neural networks
James Kirkpatrick, Razvan Pascanu, Neil Rabinowitz, Joel Veness, Guillaume Desjardins, Andrei A Rusu, Kieran Milan, John Quan, Tiago Ramalho, Agnieszka Grabska-Barwinska, et al · 2017
Cited alongside, same era.
Multi-layer generalized linear estimation
Andre Manoel, Florent Krzakala, Marc Mézard, and Lenka Zdeborová · 2017
Cited alongside, same era.
Mean-field message-passing equations in the hopfield model and its generalizations
Marc Mézard · 2017
Cited alongside, same era.
Continual learning through synaptic intelligence
Friedemann Zenke, Ben Poole, and Surya Ganguli · 2017
Cited alongside, same era.
Later among the works it cites.
Belief propagation neural networks
Jonathan Kuck, Shuvam Chakraborty, Hao Tang, Rachel Luo, Jiaming Song, Ashish Sabharwal, and Stefano Ermon · 2020
Later among the works it cites.
Critical initialisation in continuous approximations of binary neural networks
George Stamatescu, Federica Gerace, Carlo Lucibello, Ian Fuss, and Langford B. White · 2020
Later among the works it cites.
Tullio.jl julia package, 2021
Michael Abbott, Dilum Aluthge, N3N5, Simeon Schaub, Carlo Lucibello, Chris Elrod, and Johnny Chen · 2021
Closest in time.
Multi-prize lottery ticket hypothesis: Finding accurate binary neural networks by pruning a randomly weighted network
James Diffenderfer and Bhavya Kailkhura · 2021
Closest in time.
The inverse variance–flatness relation in stochastic gradient descent is critical for finding flat minima
Yu Feng and Yuhai Tu · 2021
Closest in time.
Pruning neural networks at initialization: Why are we missing the mark?
Jonathan Frankle, Gintare Karolina Dziugaite, Daniel Roy, and Michael Carbin · 2021
Closest in time.
Antoine Maillard, Florent Krzakala, Marc Mézard, and Lenka Zdeborová · 2021
Closest in time.
Entropic gradient descent algorithms and wide flat minima
Fabrizio Pittorino, Carlo Lucibello, Christoph Feinauer, Gabriele Perugini, Carlo Baldassi, Elizaveta Demyanenko, and Riccardo Zecchina · 2021
Closest in time.
Neural enhanced belief propagation on factor graphs
Victor Garcia Satorras and Max Welling · 2021
Closest in time.
Training neural networks with fixed sparse masks, 2021
Yi-Lin Sung, Varun Nair, and Colin Raffel · 2021
Closest in time.
Multi-layer bilinear generalized approximate message passing
Qiuyun Zou, Haochuan Zhang, and Hongwen Yang · 2021
Closest in time.
Synaptic metaplasticity in binarized neural networks
Axel Laborieux, Maxence Ernoult, Tifenn Hirtzlin, and Damien Querlioz · 2041
Closest in time.