Abstract is missing.
- Editors IntroductionMarcus Hutter, Frank Stephan, Vladimir Vovk, Thomas Zeugmann. 1-10 [doi]
- Towards General Algorithms for Grammatical InferenceAlexander Clark. 11-30 [doi]
- The Blessing and the Curse of the Multiplicative UpdatesManfred K. Warmuth. 31 [doi]
- Discovery of Abstract Concepts by a RobotIvan Bratko. 32 [doi]
- Contrast Pattern Mining and Its Application for Building Robust ClassifiersKotagiri Ramamohanarao. 33 [doi]
- Optimal Online Prediction in Adversarial EnvironmentsPeter L. Bartlett. 34 [doi]
- An Algorithm for Iterative Selection of Blocks of FeaturesPierre Alquier. 35-49 [doi]
- Bayesian Active Learning Using Arbitrary Binary Valued QueriesLiu Yang, Steve Hanneke, Jaime G. Carbonell. 50-58 [doi]
- Approximation Stability and BoostingWei Gao, Zhi-Hua Zhou. 59-73 [doi]
- A Spectral Approach for Probabilistic Grammatical Inference on TreesRaphaël Bailly, Amaury Habrard, François Denis. 74-88 [doi]
- PageRank Optimization in Polynomial Time by Stochastic Shortest Path ReformulationBalázs Csanád Csáji, Raphaël M. Jungers, Vincent D. Blondel. 89-103 [doi]
- Inferring Social Networks from OutbreaksDana Angluin, James Aspnes, Lev Reyzin. 104-118 [doi]
- Distribution-Dependent PAC-Bayes PriorsGuy Lever, François Laviolette, John Shawe-Taylor. 119-133 [doi]
- PAC Learnability of a Concept Class under Non-atomic Measures: A Problem by VidyasagarVladimir Pestov. 134-147 [doi]
- A PAC-Bayes Bound for Tailored Density EstimationMatthew Higgs, John Shawe-Taylor. 148-162 [doi]
- Compressed Learning with Regular ConceptJiawei Lv, Jianwen Zhang, Fei Wang, Zheng Wang, Changshui Zhang. 163-178 [doi]
- A Lower Bound for Learning Distributions Generated by Probabilistic AutomataBorja Balle, Jorge Castro, Ricard Gavaldà. 179-193 [doi]
- Lower Bounds on Learning Random Structures with Statistical QueriesDana Angluin, David Eisenstat, Leonid Kontorovich, Lev Reyzin. 194-208 [doi]
- Recursive Teaching Dimension, Learning Complexity, and Maximum ClassesThorsten Doliwa, Hans-Ulrich Simon, Sandra Zilles. 209-223 [doi]
- Toward a Classification of Finite Partial-Monitoring GamesGábor Bartók, Dávid Pál, Csaba Szepesvári. 224-238 [doi]
- Prediction with Expert Advice under Discounted LossAlexey V. Chernov, Fedor Zhdanov. 255-269 [doi]
- A Regularization Approach to Metrical Task SystemsJacob Abernethy, Peter L. Bartlett, Niv Buchbinder, Isabelle Stanton. 270-284 [doi]
- Solutions to Open Questions for Non-U-Shaped Learning with Memory LimitationsJohn Case, Timo Kötzing. 285-299 [doi]
- Learning without CodingSamuel E. Moelius, Sandra Zilles. 300-314 [doi]
- Learning Figures with the Hausdorff Metric by FractalsMahito Sugiyama, Eiju Hirowatari, Hideki Tsuiki, Akihiro Yamamoto. 315-329 [doi]
- Inductive Inference of Languages from SamplingsSanjay Jain, Efim B. Kinber. 330-344 [doi]
- Optimality Issues of Universal Greedy Agents with Static PriorsLaurent Orseau. 345-359 [doi]
- Consistency of Feature Markov ProcessesPeter Sunehag, Marcus Hutter. 360-374 [doi]
- Algorithms for Adversarial Bandit Problems with Multiple PlaysTaishi Uchiya, Atsuyoshi Nakamura, Mineichi Kudo. 375-389 [doi]
- Online Multiple Kernel Learning: Algorithms and Mistake BoundsRong Jin, Steven C. H. Hoi, Tianbao Yang. 390-404 [doi]
- An Identity for Kernel Ridge RegressionFedor Zhdanov, Yuri Kalnishkan. 405-419 [doi]