Jyrki Kivinen, Manfred K. Warmuth  Home/Search
Context
Related
| neurocolt.com/abs/...nctr95029.ps.gz Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: neurocolt.com/abs/1995...abs95029 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We give an adversary strategy that forces the Perceptron algorithm to make (N \Gamma k + 1)=2 mistakes when learning k-literal disjunctions over N variables. Experimentally we see that even for simple random data, the number of mistakes made by the Perceptron algorithm grows almost linearly with N , even if the number k of relevant variable remains a small constant. Thus, the Perceptron algorithm suffers from the curse of dimensionality even when the target is extremely simple and almost... (Update)
Similar documents (at the sentence level):
28.5%: The Perceptron algorithm vs. Winnow: linear vs. logarithmic.. - Kivinen, Warmuth (1995) (Correct)
Active bibliography (related documents): More All
0.5: Using Finite Automata to Mine Execution Data for Intrusion.. - Michael, Ghosh (2000) (Correct)
0.1: MLnet Summer School on Machine Learning and Knowledge.. - Buntine (Correct)
0.1: Rigorous Learning Curve Bounds from Statistical Mechanics - Haussler, Kearns, Seung.. (1996) (Correct)
Similar documents based on text: More All
0.5: Efficiency versus Convergence of Boolean Kernels for.. - Khardon, Roth, Servedio (2001) (Correct)
0.5: A Second-Order Perceptron Algorithm - Cesa-Bianchi, Conconi, Gentile (2002) (Correct)
0.4: Entropy Estimation - Bercher, Vignat (1996) (Correct)
BibTeX entry: (Update)
@misc{ kivinen-curse,
author = "Jyrki Kivinen and Manfred K. Warmuth",
title = "The Curse of Dimensionality and the Perceptron Algorithm",
url = "citeseer.ist.psu.edu/kivinen95curse.html" }
Citations (may not include all citations):2133 Pattern Classification and Scene Analysis (context) - Duda, Hart - 1973
704 Neural Networks: a Comprehensive Foundation (context) - Haykin - 1993
537 A theory of the learnable (context) - Valiant - 1984
88 Exponentiated gradient versus gradient descent for linear pr.. - Kivinen, Warmuth - 1994
84 Learning when irrelevant attributes abound: A new linear-thr.. (context) - Littlestone - 1988
74 Mistake Bounds and Logarithmic Linear-threshold Learning Alg.. (context) - Littlestone - 1989
64 and linear threshold learning using Winnow (context) - Littlestone, attributes et al. - 1991
32 line learning of linear functions - Littlestone, Long et al. - 1991
10 Learning curves in large neural networks (context) - Sompolinsky, Seung et al. - 1991
2 The stastical mechanics of learning a rule (context) - Watkin, Rau et al. - 1993
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC