On-line learning of linear functions

DOI10.1007/BF01277953zbMath0816.68106OpenAlexW2092279736MaRDI QIDQ1842773

Manfred K. Warmuth, Philip M. Long, Nicholas Littlestone

Publication date: 20 April 1995

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01277953

zbMATH Keywords

computational learning theorymachine learningadaptive filter theory

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (5)

The Perceptron algorithm versus Winnow: linear versus logarithmic mistake bounds when few input variables are relevant ⋮ Analysis of two gradient-based algorithms for on-line regression ⋮ Probability theory for the Brier game ⋮ A game of prediction with expert advice ⋮ Adaptive and self-confident on-line learning algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Prediction-preserving reducibility
• The weighted majority algorithm
• Learning in the presence of finitely or infinitely many irrelevant attributes
• A Learning Theorem for Linear Operators

This page was built for publication: On-line learning of linear functions