Proceedings of the twelfth annual conference on Computational learning theory - COLT '99
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By ACM Press

1581131674

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Viewing all models as “probabilistic”

Proceedings of the twelfth annual conference on Computational learning theory - COLT '99 ◽

10.1145/307400.307436 ◽

1999 ◽

Cited By ~ 5

Author(s):

Peter Grünwald

Download Full-text

Minimax regret under log loss for general classes of experts

Proceedings of the twelfth annual conference on Computational learning theory - COLT '99 ◽

10.1145/307400.307407 ◽

1999 ◽

Cited By ~ 8

Author(s):

Nicolò Cesa-Bianchi ◽

Gábor Lugosi

Keyword(s):

Minimax Regret

Download Full-text

The robustness of the p-norm algorithms

Proceedings of the twelfth annual conference on Computational learning theory - COLT '99 ◽

10.1145/307400.307405 ◽

1999 ◽

Cited By ~ 14

Author(s):

Claudio Gentile ◽

Nick Littlestone

Download Full-text

Uniform-distribution attribute noise learnability

Proceedings of the twelfth annual conference on Computational learning theory - COLT '99 ◽

10.1145/307400.307414 ◽

1999 ◽

Cited By ~ 4

Author(s):

Nader H. Bshouty ◽

Jeffrey C. Jackson ◽

Christino Tamon

Keyword(s):

Uniform Distribution ◽

Attribute Noise

Download Full-text

An adaptive version of the boost by majority algorithm

Proceedings of the twelfth annual conference on Computational learning theory - COLT '99 ◽

10.1145/307400.307419 ◽

1999 ◽

Cited By ~ 36

Author(s):

Yoav Freund

Download Full-text

Additive models, boosting, and inference for generalized divergences

Proceedings of the twelfth annual conference on Computational learning theory - COLT '99 ◽

10.1145/307400.307422 ◽

1999 ◽

Cited By ~ 28

Author(s):

John Lafferty

Keyword(s):

Additive Models

Download Full-text

Learning fixed-dimension linear thresholds from fragmented data

Proceedings of the twelfth annual conference on Computational learning theory - COLT '99 ◽

10.1145/307400.307416 ◽

1999 ◽

Cited By ~ 1

Author(s):

Paul W. Goldberg

Keyword(s):

Fixed Dimension ◽

Fragmented Data

Download Full-text

Convergence analysis of temporal-difference learning algorithms with linear function approximation

Proceedings of the twelfth annual conference on Computational learning theory - COLT '99 ◽

10.1145/307400.307438 ◽

1999 ◽

Cited By ~ 4

Author(s):

Vladislav Tadić

Keyword(s):

Convergence Analysis ◽

Linear Function ◽

Function Approximation ◽

Learning Algorithms ◽

Temporal Difference ◽

Temporal Difference Learning ◽

Linear Function Approximation

Download Full-text

More efficient PAC-learning of DNF with membership queries under the uniform distribution

Proceedings of the twelfth annual conference on Computational learning theory - COLT '99 ◽

10.1145/307400.307472 ◽

1999 ◽

Cited By ~ 22

Author(s):

Nader H. Bshouty ◽

Jeffrey C. Jackson ◽

Christino Tamon

Keyword(s):

Uniform Distribution ◽

Pac Learning ◽

Membership Queries

Download Full-text

Microchoice bounds and self bounding learning algorithms

Proceedings of the twelfth annual conference on Computational learning theory - COLT '99 ◽

10.1145/307400.307441 ◽

1999 ◽

Cited By ~ 2

Author(s):

John Langford ◽

Avrim Blum

Keyword(s):

Learning Algorithms

Download Full-text

Proceedings of the twelfth annual conference on Computational learning theory - COLT '99Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By ACM Press

Viewing all models as “probabilistic”

Minimax regret under log loss for general classes of experts

The robustness of the p-norm algorithms

Uniform-distribution attribute noise learnability

An adaptive version of the boost by majority algorithm

Additive models, boosting, and inference for generalized divergences

Learning fixed-dimension linear thresholds from fragmented data

Convergence analysis of temporal-difference learning algorithms with linear function approximation

More efficient PAC-learning of DNF with membership queries under the uniform distribution

Microchoice bounds and self bounding learning algorithms

Proceedings of the twelfth annual conference on Computational learning theory - COLT '99
Latest Publications