Computational Learning Theory: 4th European Conference, EuroCOLT'99 Nordkirchen, Germany, March 29-31, 1999 Proceedings

Computational Learning Theory: 4th European Conference, EuroCOLT'99 Nordkirchen, Germany, March 29-31, 1999 Proceedings


Choose Expedited Shipping at checkout for guaranteed delivery by Tuesday, August 27


This book constitutes the refereed proceedings of the 4th European Conference on Computational Learning Theory, EuroCOLT'99, held in Nordkirchen, Germany in March 1999. The 21 revised full papers presented were selected from a total of 35 submissions; also included are two invited contributions. The book is divided in topical sections on learning from queries and counterexamples, reinforcement learning, online learning and export advice, teaching and learning, inductive inference, and statistical theory of learning and pattern recognition.

Product Details

ISBN-13: 9783540657019
Publisher: Springer Berlin Heidelberg
Publication date: 04/14/1999
Series: Lecture Notes in Computer Science , #1572
Edition description: 1999
Pages: 299
Product dimensions: 6.10(w) x 9.25(h) x 0.36(d)

Table of Contents

Invited Lectures.- Theoretical Views of Boosting.- Open Theoretical Questions in Reinforcement Learning.- Learning from Random Examples.- A Geometric Approach to Leveraging Weak Learners.- Query by Committee, Linear Separation and Random Walks.- Hardness Results for Neural Network Approximation Problems.- Learning from Queries and Counterexamples.- Learnability of Quantified Formulas.- Learning Multiplicity Automata from Smallest Counterexamples.- Exact Learning when Irrelevant Variables Abound.- An Application of Codes to Attribute-Efficient Learning.- Learning Range Restricted Horn Expressions.- Reinforcement Learning.- On the Asymptotic Behavior of a Constant Stepsize Temporal-Difference Learning Algorithm.- On-line Learning and Expert Advice.- Direct and Indirect Algorithms for On-line Learning of Disjunctions.- Averaging Expert Predictions.- Teaching and Learning.- On Teaching and Learning Intersection-Closed Concept Classes.- Inductive Inference.- Avoiding Coding Tricks by Hyperrobust Learning.- Mind Change Complexity of Learning Logic Programs.- Statistical Theory of Learning and Pattern Recognition.- Regularized Principal Manifolds.- Distribution-Dependent Vapnik-Chervonenkis Bounds.- Lower Bounds on the Rate of Convergence of Nonparametric Pattern Recognition.- On Error Estimation for the Partitioning Classification Rule.- Margin Distribution Bounds on Generalization.- Generalization Performance of Classifiers in Terms of Observed Covering Numbers.- Entropy Numbers, Operators and Support Vector Kernels.

Customer Reviews

Most Helpful Customer Reviews

See All Customer Reviews