COLT 1998

32 papers

Aspects of Complexity of Conservative Probabilistic Learning Léa Meyer

Birds Can Fly Jochen Nessel

Combining Labeled and Unlabeled Data with Co-Training Avrim Blum, Tom M. Mitchell

Cross-Validation for Binary Classification by Real-Valued Functions: Theoretical Analysis Martin Anthony, Sean B. Holden

Efficient Learning of Monotone Concepts via Quadratic Optimization David Gamarnik

Exact Learning of Tree Patterns from Queries and Counterexamples Thomas R. Amoth, Paul Cull, Prasad Tadepalli

Improved Boosting Algorithms Using Confidence-Rated Predictions Robert E. Schapire, Yoram Singer

Improved Lower Bounds for Learning from Noisy Examples: An Information-Theoretic Approach Claudio Gentile, David P. Helmbold

Large Margin Classification Using the Perceptron Algorithm Yoav Freund, Robert E. Schapire

Learnability of a Subclass of Extended Pattern Languages Andrew R. Mitchell

Learning Agents for Uncertain Environments (Extended Abstract) Stuart Russell

Learning Atomic Formulas with Prescribed Properties Irene Tsapara, György Turán

Learning First Order Universal Horn Expressions Roni Khardon

Learning One-Variable Pattern Languages in Linear Average Time Rüdiger Reischuk, Thomas Zeugmann

Learning to Communicate via Unknown Channel (Abstract) Meir Feder

Minimax Relative Loss Analysis for Sequential Prediction Algorithms Using Parametric Hypotheses Kenji Yamanishi

Neural Networks and Efficient Associative Memory Matthias Miltrup, Georg Schnitger

On Sequential Prediction of Individual Sequences Relative to a Set of Experts Nicolò Cesa-Bianchi, Gábor Lugosi

On the Power of Learning Robustly Sanjay Jain, Carl H. Smith, Rolf Wiehagen

On the Sample Complexity of Learning Functions with Bounded Variation Philip M. Long

Polylogarithmic-Overhead Piecemeal Graph Exploration Baruch Awerbuch, Stephen G. Kobourov

Projection Learning Leslie G. Valiant

Robust Learning Aided by Context John Case, Sanjay Jain, Matthias Ott, Arun Sharma, Frank Stephan

Sample Complexity of Model-Based Search Christopher D. Rosin

Self Bounding Learning Algorithms Yoav Freund

Some PAC-Bayesian Theorems David A. McAllester

Structural Results About Exact Learning with Unspecified Attribute Values Andreas Birkendorf, Norbert Klasner, Christian Kuhlmann, Hans Ulrich Simon

Testing Problems with Sub-Learning Sample Complexity Michael J. Kearns, Dana Ron

The Complexity of Learning According to Two Models of a Drifting Environment Philip M. Long

The Query Complexity of Finding Local Minima in the Lattice Amos Beimel, Felix Geller, Eyal Kushilevitz

Tracking the Best Regressor Mark Herbster, Manfred K. Warmuth

Universal Portfolio Selection V. G. Vovk, Chris Watkins