Relative Loss Bounds and Polynomial-Time Predictions for the K-Lms-Net Algorithm

Herbster. "Relative Loss Bounds and Polynomial-Time Predictions for the K-Lms-Net Algorithm." International Conference on Algorithmic Learning Theory, 2004. doi:10.1007/978-3-540-30215-5_24

[Herbster. "Relative Loss Bounds and Polynomial-Time Predictions for the K-Lms-Net Algorithm." International Conference on Algorithmic Learning Theory, 2004.](https://mlanthology.org/alt/2004/herbster2004alt-relative/) doi:10.1007/978-3-540-30215-5_24

@inproceedings{herbster2004alt-relative,
  title     = {{Relative Loss Bounds and Polynomial-Time Predictions for the K-Lms-Net Algorithm}},
  author    = {Herbster, Mark},
  booktitle = {International Conference on Algorithmic Learning Theory},
  year      = {2004},
  pages     = {309-323},
  doi       = {10.1007/978-3-540-30215-5_24},
  url       = {https://mlanthology.org/alt/2004/herbster2004alt-relative/}
}