COLT A*

33 papers

YearTitle / Authors
1998Aspects of Complexity of Conservative Probabilistic Learning.
Léa Meyer
1998Birds Can Fly.
Jochen Nessel
1998Combining Labeled and Unlabeled Data with Co-Training.
Avrim Blum, Tom M. Mitchell
1998Cross-Validation for Binary Classification by Real-Valued Functions: Theoretical Analysis.
Martin Anthony, Sean B. Holden
1998Efficient Learning of Monotone Concepts via Quadratic Optimization.
David Gamarnik
1998Exact Learning of Tree Patterns from Queries and Counterexamples.
Thomas R. Amoth, Paul Cull, Prasad Tadepalli
1998Improved Boosting Algorithms using Confidence-Rated Predictions.
Robert E. Schapire, Yoram Singer
1998Improved Lower Bounds for Learning from Noisy Examples: An Information-Theoretic Approach.
Claudio Gentile, David P. Helmbold
1998Large Margin Classification Using the Perceptron Algorithm.
Yoav Freund, Robert E. Schapire
1998Learnability of a Subclass of Extended Pattern Languages.
Andrew R. Mitchell
1998Learning Agents for Uncertain Environments (Extended Abstract).
Stuart Russell
1998Learning Atomic Formulas with Prescribed Properties.
Irene Tsapara, György Turán
1998Learning First Order Universal Horn Expressions.
Roni Khardon
1998Learning One-Variable Pattern Languages in Linear Average Time.
Rüdiger Reischuk, Thomas Zeugmann
1998Learning to Communicate via Unknown Channel (Abstract).
Meir Feder
1998Minimax Relative Loss Analysis for Sequential Prediction Algorithms Using Parametric Hypotheses.
Kenji Yamanishi
1998Neural Networks and Efficient Associative Memory.
Matthias Miltrup, Georg Schnitger
1998On Sequential Prediction of Individual Sequences Relative to a Set of Experts.
Nicolò Cesa-Bianchi, Gábor Lugosi
1998On the Power of Learning Robustly.
Sanjay Jain, Carl H. Smith, Rolf Wiehagen
1998On the Sample Complexity of Learning Functions with Bounded Variation.
Philip M. Long
1998Polylogarithmic-Overhead Piecemeal Graph Exploration.
Baruch Awerbuch, Stephen G. Kobourov
1998Proceedings of the Eleventh Annual Conference on Computational Learning Theory, COLT 1998, Madison, Wisconsin, USA, July 24-26, 1998.
Peter L. Bartlett, Yishay Mansour
1998Projection Learning.
Leslie G. Valiant
1998Robust Learning Aided by Context.
John Case, Sanjay Jain, Matthias Ott, Arun Sharma, Frank Stephan
1998Sample Complexity of Model-Based Search.
Christopher D. Rosin
1998Self Bounding Learning Algorithms.
Yoav Freund
1998Some PAC-Bayesian Theorems.
David A. McAllester
1998Structural Results about Exact Learning with Unspecified Attribute Values.
Andreas Birkendorf, Norbert Klasner, Christian Kuhlmann, Hans Ulrich Simon
1998Testing Problems with Sub-Learning Sample Complexity.
Michael J. Kearns, Dana Ron
1998The Query Complexity of Finding Local Minima in the Lattice.
Amos Beimel, Felix Geller, Eyal Kushilevitz
1998The complexity of learning according to two models of a drifting environment.
Philip M. Long
1998Tracking the Best Regressor.
Mark Herbster, Manfred K. Warmuth
1998Universal Portfolio Selection.
V. G. Vovk, Chris Watkins