Computational Learning Theory 15th Annual Conference on Computational Learning Theory, COLT 2002, Sydney, Australia, July 8-10, 2002. Proceedings

Bibliographic Details
Other Authors: Kivinen, Jyrki (Editor), Sloan, Robert H. (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 2002, 2002
Edition:1st ed. 2002
Series:Lecture Notes in Artificial Intelligence
Subjects:
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
LEADER 02865nmm a2200337 u 4500
001 EB001855140
003 EBX01000000000000001019442
005 00000000000000.0
007 cr|||||||||||||||||||||
008 181201 ||| eng
020 |a 9783540454359 
100 1 |a Kivinen, Jyrki  |e [editor] 
245 0 0 |a Computational Learning Theory  |h Elektronische Ressource  |b 15th Annual Conference on Computational Learning Theory, COLT 2002, Sydney, Australia, July 8-10, 2002. Proceedings  |c edited by Jyrki Kivinen, Robert H. Sloan 
250 |a 1st ed. 2002 
260 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 2002, 2002 
300 |a XII, 412 p  |b online resource 
505 0 |a Statistical Learning Theory -- Agnostic Learning Nonconvex Function Classes -- Entropy, Combinatorial Dimensions and Random Averages -- Geometric Parameters of Kernel Machines -- Localized Rademacher Complexities -- Some Local Measures of Complexity of Convex Hulls and Generalization Bounds -- Online Learning -- Path Kernels and Multiplicative Updates -- Predictive Complexity and Information -- Mixability and the Existence of Weak Complexities -- A Second-Order Perceptron Algorithm -- Tracking Linear-Threshold Concepts with Winnow -- Inductive Inference -- Learning Tree Languages from Text -- Polynomial Time Inductive Inference of Ordered Tree Patterns with Internal Structured Variables from Positive Data -- Inferring Deterministic Linear Languages -- Merging Uniform Inductive Learners -- The Speed Prior: A New Simplicity Measure Yielding Near-Optimal Computable Predictions -- PAC Learning -- New Lower Bounds for Statistical Query Learning -- Exploring Learnability between Exact and PAC -- PAC Bounds for Multi-armed Bandit and Markov Decision Processes -- Bounds for the Minimum Disagreement Problem with Applications to Learning Theory -- On the Proper Learning of Axis Parallel Concepts -- Boosting -- A Consistent Strategy for Boosting Algorithms -- The Consistency of Greedy Algorithms for Classification -- Maximizing the Margin with Boosting -- Other Learning Paradigms -- Performance Guarantees for Hierarchical Clustering -- Self-Optimizing and Pareto-Optimal Policies in General Environments Based on Bayes-Mixtures -- Prediction and Dimension -- Invited Talk -- Learning the Internet 
653 |a Computer science 
653 |a Artificial Intelligence 
653 |a Algorithms 
653 |a Formal Languages and Automata Theory 
653 |a Machine theory 
653 |a Artificial intelligence 
653 |a Theory of Computation 
700 1 |a Sloan, Robert H.  |e [editor] 
041 0 7 |a eng  |2 ISO 639-2 
989 |b SBA  |a Springer Book Archives -2004 
490 0 |a Lecture Notes in Artificial Intelligence 
028 5 0 |a 10.1007/3-540-45435-7 
856 4 0 |u https://doi.org/10.1007/3-540-45435-7?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 006.3