N
Nick Littlestone
Researcher at Princeton University
Publications - 29
Citations - 6179
Nick Littlestone is an academic researcher from Princeton University. The author has contributed to research in topics: Winnow & Learnability. The author has an hindex of 20, co-authored 29 publications receiving 5842 citations. Previous affiliations of Nick Littlestone include University of California, Santa Cruz & Carnegie Mellon University.
Papers
More filters
Journal ArticleDOI
The weighted majority algorithm
TL;DR: A simple and effective method, based on weighted voting, is introduced for constructing a compound algorithm, which is robust in the presence of errors in the data, and is called the Weighted Majority Algorithm.
Journal ArticleDOI
Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm
TL;DR: This work presents one such algorithm that learns disjunctive Boolean functions, along with variants for learning other classes of Boolean functions.
Proceedings ArticleDOI
The weighted majority algorithm
TL;DR: A simple and effective method, based on weighted voting, is introduced for constructing a compound algorithm in a situation in which a learner faces a sequence of trials, and the goal of the learner is to make few mistakes.
Relating Data Compression and Learnability
TL;DR: It is demonstrated that the existence of a suitable data compression scheme is sufficient to ensure learnability and the introduced compression scheme provides a rigorous model for studying data compression in connection with machine learning.
Proceedings Article
Predicting {0,1}-Functions on Randomly Drawn Points (Extended Abstract)
TL;DR: In this article, the authors consider the problem of predicting (0, l)valued functions on R" and smaller domains, based on their values on randomly drawn points, and construct prediction strategies that are optimal to within a constant factor for any reasonable class F of target functions.