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

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

[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

@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/}
}