Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm

1988/04/01 by Nick Littlestone · 8 citations
Computer Science · #Algorithms and Data Compression #Machine Learning and Algorithms #Machine Learning and Data Classification

paper · doi:10.1023/a:1022869011914

crossref issued 1988/04/01 · crossref published 1988/04/01 · crossref published-print 1988/04/01 · openalex publication_date 1988/04/01 · crossref created 2003/04/04 · openalex created_date 2016/06/24 · crossref deposited 2025/07/10 · crossref indexed 2026/07/10 · openalex updated_date 2026/07/29

Citations

• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities

Cited by

• Online Learning: Stochastic and Constrained Adversaries
• Near-tight closure bounds for Littlestone and threshold dimensions
• User-Level Private Learning via Correlated Sampling
• MODEL THEORY AND MACHINE LEARNING
• Hardness of Approximation Between P and NP
• Mistake-Driven Learning in Text Categorization
• Queries revisited
• Winnow (algorithm) [wikipedia]