A Max-Sum algorithm for training discrete neural networks

DOI10.1088/1742-5468/2015/08/P08008zbMath1456.68139arXiv1505.05401MaRDI QIDQ3302364

Carlo Baldassi, Alfredo Braunstein

Publication date: 11 August 2020

Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.05401

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (2)

Local entropy as a measure for sampling solutions in constraint satisfaction problems ⋮ Clustering of solutions in the symmetric binary perceptron

Cites Work

• Unnamed Item
• Generalization learning in a perceptron with binary synapses
• A review of combinatorial problems arising in feedforward neural network design
• Statistical Mechanics of Learning
• Optimizing spread dynamics on graphs by message passing
• Information, Physics, and Computation
• Learning representations by back-propagating errors
• A CDMA multiuser detection algorithm on the basis of belief propagation
• Network calculus. A theory of deterministic queueing systems for the Internet

This page was built for publication: A Max-Sum algorithm for training discrete neural networks