Perceptron, winnow, and PAC learning

SIAM Journal on Computing

Volumn 31, Issue 5, 2002, Pages 1358-1369

  Servedio, Rocco A ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

Linear threshold function; PAC learning; Perceptron; Winnow

Indexed keywords

APPROXIMATION THEORY; FUNCTIONS; NEURAL NETWORKS;

LINEAR FUNCTIONS;

LEARNING ALGORITHMS;

EID: 0036588759     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539798340928     Document Type: Article

References (28)

1. D. Angluin, Queries and concept learning, Machine Learning, 2 (1988), pp. 319-342.
2. D. Angluin and L.G. Valiant, Fast probabilistic algorithms for Hamiltonian circuits and matchings, J. Comput. System Sci., 18 (1979), pp. 155-193.
3. M. Anthony, G. Brightwell, and J. Shawe-Taylor, On specifying boolean functions using labelled examples, Discrete Appl. Math., 61 (1993), pp. 1-25.
4. P. Auer and M. Warmuth, Tracking the best disjunction, in Proceedings of the 36th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1995, pp. 312-321.
5. E.B. Baum, The perceptron algorithm is fast for nonmalicious distributions, Neural Comput., 2 (1990), pp. 248-260.
6. H. Block, The perceptron: A model for brain functioning, Rev. Modern Phys., 34 (1962), pp. 123-135.
7. M.L. Dertouzos, Threshold Logic: A Synthesis Approach, MIT Press, Cambridge, MA, 1965.
8. Y. Freund and R. Schapire, Large margin classification using the Perceptron algorithm, in Proceedings of the 11th Annual Conference on Computational Learning Theory, ACM, New York, 1998, pp. 209-217.
9. J. Håstad, On the size of weights for threshold gates, SIAM J. Discrete Math., 7 (1994), pp. 484-492.
10. S. Hampson and D. Volper, Linear function neurons: Structure and training, Biol. Cybernet., 53 (1986), pp. 203-217.
11. D. Haussler, Space Efficient Learning Algorithms, Technical Report UCSC-CRL-88-2, University of California, Santa Cruz, CA, 1988.
12. M. Kearns and U. Vazirani, An Introduction to Computational Learning Theory, MIT Press, Cambridge, MA, 1994.
13. J. Kivinen, M. Warmuth, and P. Auer, The perceptron algorithm vs. winnow: Linear vs. logarithmic mistake bounds when few input variables are relevant, in Proceedings of the 8th Annual Conference on Computational Learning Theory, ACM, New York, 1995, pp. 289-296.
14. N. Littlestone, Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm, Machine Learning, 2 (1988), pp. 285-318.
15. N. Littlestone, Mistake Bounds and Logarithmic Linear-Threshold Learning Algorithms, Ph.D. thesis, Technical Report UCSC-CRL-89-11, University of California, Santa Cruz, CA, 1989.
16. N. Littlestone, Redundant noisy attributes, attribute errors, and linear-threshold learning using winnow, in Proceedings of the 4th Annual Conference on Computational Learning Theory, ACM, New York, 1991, pp. 147-156.
17. W. Maass and M. Warmuth, Efficient Learning with Virtual Threshold Gates, Technical Report UCSC-CRL-95-37, University of California, Santa Cruz, CA, 1995.
18. W. Maass and G. Turan, How fast can a threshold gate learn?, in Computational Learning Theory and Natural Learning Systems. Volume I: Constraints and Prospects, S.J. Hanson, G. Drastal, and R. Rivest, eds., MIT Press, Cambridge, MA, 1994, pp. 381-414.
19. M. Minsky and S. Papert, Perceptrons: An Introduction to Computational Geometry, expanded ed., MIT Press, Cambridge, MA, 1988.
20. A. Novikoff, On convergence proofs on perceptrons, in Proceedings of the Symposium on Mathematical Theory of Automata, Vol. 12, 1962, pp. 615-622.
21. S. Muroga, Threshold Logic and its Applications, Wiley-Interscience, New York, 1971.
22. I. Parberry, Circuit Complexity and Neural Networks, MIT Press, Cambridge, MA, 1994.
23. L. Pitt and L.G. Valiant, Computational limitations on learning from examples, J. ACM, 35 (1988), pp. 965-984.
24. F. Rosenblatt, Principles of Neurodynamics, Springer-Verlag, New York, 1962.
25. M. Schmitt, Identification criteria and lower bounds for Perceptron-like learning rules, Neural Comput., 10 (1998), pp. 235-250.
26. L.G. Valiant, A theory of the learnable, Comm. ACM, 27 (1984), pp. 1134-1142.
27. L.G. Valiant, Circuits of the Mind, Oxford University Press, New York, 1994.
28. L.G. Valiant, Projection learning, in Proceedings of the 11th Annual Conference on Computational Learning Theory, ACM, New York, 1998, pp. 287-293.