Nick Littlestone

According to our database1, Nick Littlestone authored at least 21 papers between 1987 and 2001.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2001
General Convergence Results for Linear Discriminant Updates.
Mach. Learn., 2001

2000
On-Line Learning with Linear Loss Constraints.
Inf. Comput., 2000

Apple Tasting.
Inf. Comput., 2000

1999
The Robustness of the <i>p</i>-Norm Algorithms.
Proceedings of the Twelfth Annual Conference on Computational Learning Theory, 1999

1996
An Apobayesian Relative of Winnow.
Proceedings of the Advances in Neural Information Processing Systems 9, 1996

1995
Learning in the Presence of Finitely or Infinitely Many Irrelevant Attributes.
J. Comput. Syst. Sci., 1995

On-line Learning of Linear Functions.
Comput. Complex., 1995

Comparing Several Linear-threshold Learning Algorithms on Tasks Involving Superfluous Attributes.
Proceedings of the Machine Learning, 1995

1994
Predicting \0,1\-Functions on Randomly Drawn Points
Inf. Comput., December, 1994

The Weighted Majority Algorithm
Inf. Comput., February, 1994

1993
On-Line Learning with Linear Loss Constraints.
Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993

1992
Apple Tasting and Nearly One-Sided Learning
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991
Equivalence of Models for Polynomial Learnability
Inf. Comput., December, 1991

Redundant Noisy Attributes, Attribute Errors, and Linear-Threshold Learning Using Winnow.
Proceedings of the Fourth Annual Workshop on Computational Learning Theory, 1991

Learning simple Boolean concepts.
Proceedings of the Algorithmic Learning Theory, 2nd International Workshop, 1991

1989
Learning faster than promised by the Vapnik-Chervonenkis dimension.
Discret. Appl. Math., 1989

From On-Line to Batch Learning.
Proceedings of the Second Annual Workshop on Computational Learning Theory, 1989

1988
Predicting {0,1}-Functions on Randomly Drawn Points (Extended Abstract)
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

Predicting {0, 1}-Functions on Randomly Drawn Points.
Proceedings of the First Annual Workshop on Computational Learning Theory, 1988

1987
Learning Quickly When Irrelevant Attributes Abound: A New Linear-threshold Algorithm.
Mach. Learn., 1987

Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm (Extended Abstract)
Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987


  Loading...