Keywords
Multiplicative functionPerceptronMathematicsLogarithmAlgorithmMonotone polygonWeightSimple (philosophy)Computer scienceArtificial neural networkArtificial intelligence
Affiliated Institutions
Related Publications
The perceptron algorithm vs. Winnow
Article The perceptron algorithm vs. Winnow: linear vs. logarithmic mistake bounds when few input variables are relevant Share on Authors: Jyrki Kivinen Department of Computer S...
Distributed Learning, Communication Complexity and Privacy
We consider the problem of PAC-learning from distributed data and analyze fundamental communication complexity questions involved. We provide general upper and lower bounds on t...
A Second-Order Perceptron Algorithm
Kernel-based linear-threshold algorithms, such as support vector machines and Perceptron-like algorithms, are among the best available techniques for solving pattern classificat...
Exact Convex Confidence-Weighted Learning
Confidence-weighted (CW) learning [6], an online learning method for linear clas-sifiers, maintains a Gaussian distributions over weight vectors, with a covariance matrix that r...
Publication Info
- Year
- 1997
- Type
- article
- Volume
- 97
- Issue
- 1-2
- Pages
- 325-343
- Citations
- 87
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
87
OpenAlex
Cite This
Jyrki Kivinen,
Manfred K. Warmuth,
Peter Auer
(1997).
The perceptron algorithm versus winnow: linear versus logarithmic mistake bounds when few input variables are relevant.
Artificial Intelligence
, 97
(1-2)
, 325-343.
https://doi.org/10.1016/s0004-3702(97)00039-8
Identifiers
- DOI
- 10.1016/s0004-3702(97)00039-8