A Polynomial Time Algorithm That Learns Two Hidden Unit Nets | Citedby Results | Neural Computation | MIT Press

Skip to Main Content

Skip Nav Destination

A Polynomial Time Algorithm That Learns Two Hidden Unit Nets

Neural Computation (1990) 2 (4): 510–522.

This article has been cited by the following articles in journals that are participating in Crossref Cited-by Linking.

On the proliferation of support vectors in high dimensions*

Daniel Hsu
Vidya Muthukumar
Ji Xu

Journal of Statistical Mechanics: Theory and Experiment (2022) 2022 (11): 114011.

Learning intersections of halfspaces with a margin

Adam R. Klivans
Rocco A. Servedio

Journal of Computer and System Sciences (2008) 74 (1): 35.

Learning intersections and thresholds of halfspaces

Adam R. Klivans
Ryan O'Donnell
Rocco A. Servedio

Journal of Computer and System Sciences (2004) 68 (4): 808.

Back-propagation is not Efficient

Jiří Šíma

Neural Networks (1996) 9 (6): 1017.

Learning nonoverlapping perceptron networks from examples and membership queries

Thomas R. Hancock
Mostefa Golea
Mario Marchand

Machine Learning (1994) 16 (3): 161.

On learning simple neural concepts: from halfspace intersections to neural decision lists

Mario Marchand
Mostefa Golea

Network: Computation in Neural Systems (1993) 4 (1): 67.

On learning simple neural concepts: from halfspace intersections to neural decision lists

Mario Marchand
Mostefa Golea

Network: Computation in Neural Systems (1993) 4 (1): 67.

Neural net algorithms that learn in polynomial time from examples and queries

E.B. Baum

IEEE Transactions on Neural Networks (1991) 2 (1): 5.