Learning binary perceptrons perfectly efficiently.
From MaRDI portal
Recommendations
Cited in
(14)- Covering cubes by random half cubes, with applications to binary neural networks
- On the perceptron learning algorithm on data with high precision
- Directed drift: A new linear threshold algorithm for learning binary weights on-line
- Perceptron, Winnow, and PAC Learning
- Active online learning in the binary perceptron problem
- scientific article; zbMATH DE number 1281353 (Why is no real title available?)
- scientific article; zbMATH DE number 1342304 (Why is no real title available?)
- Using the Perceptron Algorithm to Find Consistent Hypotheses
- scientific article; zbMATH DE number 702974 (Why is no real title available?)
- The capacity of majority rule
- Learning strategy for the binary perceptron
- scientific article; zbMATH DE number 822102 (Why is no real title available?)
- Binary perceptron: efficient algorithms can find solutions in a rare well-connected cluster
- Tractability from overparametrization: the example of the negative perceptron
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)