COLT A*

36 papers

YearTitle / Authors
2000Abstract Combinatorial Characterizations of Exact Learning via Queries.
José L. Balcázar, Jorge Castro, David Guijarro
2000Adaptive and Self-Confident On-Line Learning Algorithms.
Peter Auer, Claudio Gentile
2000An Improved On-line Algorithm for Learning Linear Evaluation Functions.
Peter Auer
2000Average-Case Complexity of Learning Polynomials.
Frank Stephan, Thomas Zeugmann
2000Barrier Boosting.
Gunnar Rätsch, Manfred K. Warmuth, Sebastian Mika, Takashi Onoda, Steven Lemm, Klaus-Robert Müller
2000Bias-Variance Error Bounds for Temporal Difference Updates.
Michael J. Kearns, Satinder Singh
2000Boosting Using Branching Programs.
Yishay Mansour, David A. McAllester
2000Computable Shell Decomposition Bounds.
John Langford, David A. McAllester
2000Continuous Drifting Games.
Yoav Freund, Manfred Opper
2000Decision Tree Approximations of Boolean Functions.
Dinesh P. Mehta, Vijay Raghavan
2000Entropy Numbers of Linear Function Classes.
Robert C. Williamson, Alexander J. Smola, Bernhard Schölkopf
2000Estimation and Approximation Bounds for Gradient-Based Reinforcement Learning.
Peter L. Bartlett, Jonathan Baxter
2000Generalisation Error Bounds for Sparse Linear Classifiers.
Thore Graepel, Ralf Herbrich, John Shawe-Taylor
2000Generalization Bounds for Decision Trees.
Yishay Mansour, David A. McAllester
2000Hardness Results for General Two-Layer Neural Networks.
Christian Kuhlmann
2000Improved Algorithms for Theory Revision with Queries.
Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán
2000Improving Algorithms for Boosting.
Javed A. Aslam
2000Language Learning From Texts: Degrees of Instrinsic Complexity and Their Characterizations.
Sanjay Jain, Efim B. Kinber, Rolf Wiehagen
2000Leveraging for Regression.
Nigel Duffy, David P. Helmbold
2000Localized Boosting.
Ron Meir, Ran El-Yaniv, Shai Ben-David
2000Logistic Regression, AdaBoost and Bregman Distances.
Michael Collins, Robert E. Schapire, Yoram Singer
2000MadaBoost: A Modification of AdaBoost.
Carlos Domingo, Osamu Watanabe
2000Model Selection and Error Estimation.
Peter L. Bartlett, Stéphane Boucheron, Gábor Lugosi
2000On the Convergence Rate of Good-Turing Estimators.
David A. McAllester, Robert E. Schapire
2000On the Difficulty of Approximately Maximizing Agreements.
Shai Ben-David, Nadav Eiron, Philip M. Long
2000On the Efficiency of Noise-Tolerant PAC Algorithms Derived from Statistical Queries.
Jeffrey C. Jackson
2000On the Learnability and Design of Output Codes for Multiclass Problems.
Koby Crammer, Yoram Singer
2000PAC Analogues of Perceptron and Winnow via Boosting the Margin.
Rocco A. Servedio
2000Proceedings of the Thirteenth Annual Conference on Computational Learning Theory (COLT 2000), June 28 - July 1, 2000, Palo Alto, California, USA
Nicolò Cesa-Bianchi, Sally A. Goldman
2000Relative Expected Instantaneous Loss Bounds.
Jürgen Forster, Manfred K. Warmuth
2000Sparsity vs. Large Margins for Linear Classifiers.
Ralf Herbrich, Thore Graepel, John Shawe-Taylor
2000Statistical Sufficiency for Classes in Empirical L
Shahar Mendelson, Naftali Tishby
2000The Computational Complexity of Densest Region Detection.
Shai Ben-David, Nadav Eiron, Hans Ulrich Simon
2000The Minimax Strategy for Gaussian Density Estimation. pp.
Eiji Takimoto, Manfred K. Warmuth
2000The Precision of Query Points as a Resource for Learning Convex Polytopes with Membership Queries.
Paul W. Goldberg, Stephen Kwek
2000The Role of Critical Sets in Vapnik-Chervonenkis Theory.
Nicolas Vayatis