Nick Littlestone

Inf. Comput., 2000

Apple Tasting.

[BibT_eX]

[DOI]

David P. Helmbold

Inf. Comput., 2000

1999

The Robustness of the <i>p</i>-Norm Algorithms.

[BibT_eX]

[DOI]

Claudio Gentile

Proceedings of the Twelfth Annual Conference on Computational Learning Theory, 1999

1997

General Convergence Results for Linear Discriminant Updates.

[BibT_eX]

[DOI]

Adam J. Grove

Dale Schuurmans

Proceedings of the Tenth Annual Conference on Computational Learning Theory, 1997

1996

An Apobayesian Relative of Winnow.

[BibT_eX]

[DOI]

Chris Mesterharm

Proceedings of the Advances in Neural Information Processing Systems 9, 1996

1995

Comparing Several Linear-threshold Learning Algorithms on Tasks Involving Superfluous Attributes.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning, 1995

1994

Predicting \0,1\-Functions on Randomly Drawn Points

[BibT_eX]

[DOI]

David Haussler

Inf. Comput., December, 1994

1993

On-Line Learning with Linear Loss Constraints.

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993

1992

Apple Tasting and Nearly One-Sided Learning

[BibT_eX]

[DOI]

David P. Helmbold

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991

On-Line Learning of Linear Functions

[BibT_eX]

[DOI]

Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

Redundant Noisy Attributes, Attribute Errors, and Linear-Threshold Learning Using Winnow.

[BibT_eX]

[DOI]

Proceedings of the Fourth Annual Workshop on Computational Learning Theory, 1991

Learning in the Presence of Finitely or Infinitely Many Irrelevant Attributes.

[BibT_eX]

[DOI]

Avrim Blum

Lisa Hellerstein

Proceedings of the Fourth Annual Workshop on Computational Learning Theory, 1991

Learning simple Boolean concepts.

[BibT_eX]

Proceedings of the Algorithmic Learning Theory, 2nd International Workshop, 1991

1989

Learning faster than promised by the Vapnik-Chervonenkis dimension.

[BibT_eX]

[DOI]

Anselm Blumer

Discret. Appl. Math., 1989

The Weighted Majority Algorithm

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

From On-Line to Batch Learning.

[BibT_eX]

[DOI]

Proceedings of the Second Annual Workshop on Computational Learning Theory, 1989

1988

Predicting {0,1}-Functions on Randomly Drawn Points (Extended Abstract)

[BibT_eX]

[DOI]

David Haussler

Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

Predicting {0, 1}-Functions on Randomly Drawn Points.

[BibT_eX]

[DOI]

David Haussler

Proceedings of the First Annual Workshop on Computational Learning Theory, 1988

Equivalence of Models for Polynomial Learnability.

[BibT_eX]

[DOI]

Proceedings of the First Annual Workshop on Computational Learning Theory, 1988

1987

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

[BibT_eX]

[DOI]

Mach. Learn., 1987

Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm (Extended Abstract)

[BibT_eX]

[DOI]