The Perceptron Algorithm Versus Winnow: Linear Versus Logarithmic Mistake Bounds when Few Input Variables are Relevant (Technical Note)

[1]  Manfred K. Warmuth,et al.  Exponentiated Gradient Versus Gradient Descent for Linear Predictors , 1997, Inf. Comput..

[2]  Manfred K. Warmuth,et al.  Tracking the Best Disjunction , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[3]  Nick Littlestone,et al.  Comparing Several Linear-threshold Learning Algorithms on Tasks Involving Superfluous Attributes , 1995, ICML.

[4]  Robert E. Schapire,et al.  Predicting Nearly As Well As the Best Pruning of a Decision Tree , 1995, COLT '95.

[5]  Manfred K. Warmuth,et al.  Efficient Learning With Virtual Threshold Gates , 1995, Inf. Comput..

[6]  Wolfgang Maass,et al.  How fast can a threshold gate learn , 1994, COLT 1994.

[7]  David Haussler,et al.  How to use expert advice , 1993, STOC.

[8]  T. Watkin,et al.  THE STATISTICAL-MECHANICS OF LEARNING A RULE , 1993 .

[9]  Nick Littlestone,et al.  Redundant noisy attributes, attribute errors, and linear-threshold learning using winnow , 1991, COLT '91.

[10]  H. Sebastian Seung,et al.  Learning curves in large neural networks , 1991, COLT '91.

[11]  Philip M. Long,et al.  On-line learning of linear functions , 1991, STOC '91.

[12]  Vladimir Vovk,et al.  Aggregating strategies , 1990, COLT '90.

[13]  N. Littlestone.  Mistake bounds and logarithmic linear-threshold learning algorithms , 1990 .

[14]  Pravin M. Vaidya,et al.  A new algorithm for minimizing convex functions over convex sets , 1989, 30th Annual Symposium on Foundations of Computer Science.

[15]  David Haussler,et al.  Learnability and the Vapnik-Chervonenkis dimension , 1989, JACM.

[16]  N. Littlestone.  Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[17]  Leslie G. Valiant,et al.  A theory of the learnable , 1984, STOC '84.

[18]  Richard O. Duda,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[19]  F ROSENBLATT,et al.  The perceptron: a probabilistic model for information storage and organization in the brain. , 1958, Psychological review.

[20]  Yoram Singer,et al.  Adaptive Mixture of Probabilistic Transducers , 1995, NIPS.

[21]  L. Khachiyan.  Polynomial algorithms in linear programming , 1980 .

[22]  L. G. H. Cijan.  A polynomial algorithm in linear programming , 1979 .

[23]  Vladimir Vapnik,et al.  Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .