Learning binary perceptrons perfectly efficiently.

DOI10.1006/JCSS.1996.0028zbMATH Open1152.68497OpenAlexW2093094821MaRDI QIDQ960477FDOQ960477

Authors: Shao C. Fang, Santosh S. Venkatesh 

Publication date: 21 December 2008

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/5317298635a0ed2d22e1060c4390a15e6c34c0d1

Recommendations

• Directed drift: A new linear threshold algorithm for learning binary weights on-line
• Perceptron, Winnow, and PAC Learning
• Using the Perceptron Algorithm to Find Consistent Hypotheses
• scientific article; zbMATH DE number 822102
• scientific article

zbMATH Keywords

perceptronmajority rule algorithm

Mathematics Subject Classification ID

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

Cited In (6)

• Binary perceptron: efficient algorithms can find solutions in a rare well-connected cluster
• Covering cubes by random half cubes, with applications to binary neural networks
• Title not available (Why is that?)
• On the perceptron learning algorithm on data with high precision
• Using the Perceptron Algorithm to Find Consistent Hypotheses
• Perceptron, Winnow, and PAC Learning

This page was built for publication: Learning binary perceptrons perfectly efficiently.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q960477)