ML Anthology

The Perceptron Algorithm vs. Winnow: Linear vs. Logarithmic Mistake Bounds When Few Input Variables Are Relevant

Jyrki Kivinen, Manfred K. Warmuth
COLT 1995 pp. 289-296
doi:10.1145/225298.225333 /colt/1995/kivinen1995colt-perceptron/

Abstract

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 Science, P.O. Box 26 (Teollisuuskatu 23), FIN-00014 University of Helsinki, Finland Department of Computer Science, P.O. Box 26 (Teollisuuskatu 23), FIN-00014 University of Helsinki, FinlandView Profile , Manfred K. Warmuth Computer and Information Sciences, University of California, Santa Cruz, Santa Cruz, CA Computer and Information Sciences, University of California, Santa Cruz, Santa Cruz, CAView Profile Authors Info & Claims COLT '95: Proceedings of the eighth annual conference on Computational learning theoryJuly 1995 Pages 289–296https://doi.org/10.1145/225298.225333Online:05 July 1995Publication History 21citation719DownloadsMetricsTotal Citations21Total Downloads719Last 12 Months4Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited. To manage your alert preferences, click on the button below. Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access

COLT Semantic Scholar

Cite

Text

Kivinen and Warmuth. "The Perceptron Algorithm vs. Winnow: Linear vs. Logarithmic Mistake Bounds When Few Input Variables Are Relevant." Annual Conference on Computational Learning Theory, 1995. doi:10.1145/225298.225333

Markdown

[Kivinen and Warmuth. "The Perceptron Algorithm vs. Winnow: Linear vs. Logarithmic Mistake Bounds When Few Input Variables Are Relevant." Annual Conference on Computational Learning Theory, 1995.](https://mlanthology.org/colt/1995/kivinen1995colt-perceptron/) doi:10.1145/225298.225333

BibTeX

@inproceedings{kivinen1995colt-perceptron,
  title     = {{The Perceptron Algorithm vs. Winnow: Linear vs. Logarithmic Mistake Bounds When Few Input Variables Are Relevant}},
  author    = {Kivinen, Jyrki and Warmuth, Manfred K.},
  booktitle = {Annual Conference on Computational Learning Theory},
  year      = {1995},
  pages     = {289-296},
  doi       = {10.1145/225298.225333},
  url       = {https://mlanthology.org/colt/1995/kivinen1995colt-perceptron/}
}