Algorithmic Learning Theory: 21st International Conference, ALT 2010, Canberra, Australia, October 6-8, 2010. Proceedings

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This volume contains the papers presented at the 21st International Conf- ence on Algorithmic Learning Theory (ALT 2010), which was held in Canberra, Australia, October 6–8, 2010. The conference was co-located with the 13th - ternational Conference on Discovery Science (DS 2010) and with the Machine Learning Summer School, which was held just before ALT 2010. The tech- cal program of ALT 2010, contained 26 papers selected from 44 submissions and ?ve invited talks. The invited talks were presented in joint sessions of both conferences. ALT 2010 was dedicated to the theoretical foundations of machine learning and took place on the campus of the Australian National University, Canberra, Australia. ALT provides a forum for high-quality talks with a strong theore- cal background and scienti?c interchange in areas such as inductive inference, universal prediction, teaching models, grammatical inference, formal languages, inductive logic programming, query learning, complexity of learning, on-line learning and relative loss bounds, semi-supervised and unsupervised learning, clustering,activelearning,statisticallearning,supportvectormachines,Vapnik- Chervonenkisdimension,probablyapproximatelycorrectlearning,Bayesianand causal networks, boosting and bagging, information-based methods, minimum descriptionlength,Kolmogorovcomplexity,kernels,graphlearning,decisiontree methods, Markov decision processes, reinforcement learning, and real-world - plications of algorithmic learning theory. DS 2010 was the 13th International Conference on Discovery Science and focused on the development and analysis of methods for intelligent data an- ysis, knowledge discovery and machine learning, as well as their application to scienti?c knowledge discovery. As is the tradition, it was co-located and held in parallel with Algorithmic Learning Theory.

Author(s): Marcus Hutter, Frank Stephan, Vladimir Vovk, Thomas Zeugmann (auth.), Marcus Hutter, Frank Stephan, Vladimir Vovk, Thomas Zeugmann (eds.)
Series: Lecture Notes in Computer Science 6331 : Lecture Notes in Artificial Intelligence
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2010

Language: English
Pages: 421
Tags: Artificial Intelligence (incl. Robotics); Mathematical Logic and Formal Languages; Algorithm Analysis and Problem Complexity; Computation by Abstract Devices; Logics and Meanings of Programs; Computers and Education

Front Matter....Pages -
Editors’ Introduction....Pages 1-10
Towards General Algorithms for Grammatical Inference....Pages 11-30
The Blessing and the Curse of the Multiplicative Updates....Pages 31-31
Discovery of Abstract Concepts by a Robot....Pages 32-32
Contrast Pattern Mining and Its Application for Building Robust Classifiers....Pages 33-33
Optimal Online Prediction in Adversarial Environments....Pages 34-34
A Lower Bound for Learning Distributions Generated by Probabilistic Automata....Pages 179-193
Lower Bounds on Learning Random Structures with Statistical Queries....Pages 194-208
Recursive Teaching Dimension, Learning Complexity, and Maximum Classes....Pages 209-223
Toward a Classification of Finite Partial-Monitoring Games....Pages 224-238
An Algorithm for Iterative Selection of Blocks of Features....Pages 35-49
Bayesian Active Learning Using Arbitrary Binary Valued Queries....Pages 50-58
Approximation Stability and Boosting....Pages 59-73
A Spectral Approach for Probabilistic Grammatical Inference on Trees....Pages 74-88
PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation....Pages 89-103
Inferring Social Networks from Outbreaks....Pages 104-118
Distribution-Dependent PAC-Bayes Priors....Pages 119-133
PAC Learnability of a Concept Class under Non-atomic Measures: A Problem by Vidyasagar....Pages 134-147
A PAC-Bayes Bound for Tailored Density Estimation....Pages 148-162
Compressed Learning with Regular Concept....Pages 163-178
Switching Investments....Pages 239-254
Prediction with Expert Advice under Discounted Loss....Pages 255-269
A Regularization Approach to Metrical Task Systems....Pages 270-284
Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations....Pages 285-299
Learning without Coding....Pages 300-314
Learning Figures with the Hausdorff Metric by Fractals....Pages 315-329
Inductive Inference of Languages from Samplings....Pages 330-344
Optimality Issues of Universal Greedy Agents with Static Priors....Pages 345-359
Consistency of Feature Markov Processes....Pages 360-374
Algorithms for Adversarial Bandit Problems with Multiple Plays....Pages 375-389
Online Multiple Kernel Learning: Algorithms and Mistake Bounds....Pages 390-404
An Identity for Kernel Ridge Regression....Pages 405-419
Back Matter....Pages -