Skip to main content
SpringerLink
Log in

Algorithmic Learning Theory

19th International Conference, ALT 2008, Budapest, Hungary, October 13-16, 2008, Proceedings

  • Conference proceedings
  • © 2008

Overview

Editors:
  1. Yoav Freund

    1. Computer Science and Engineering, University of California, San Diego, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. László Györfi

    1. Department of Computer Science and Information Theory, Department of Computer Science and Budapest University of Technology and Economics, Budapest, Hungary

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. György Turán

    1. Department of Math., Stat. and Comp. Sci,, University of Illinois, Chicago, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Thomas Zeugmann

    1. Division of Computer Science, Hokkaido University, Sapporo, Japan

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 5254)

Part of the book sub series: Lecture Notes in Artificial Intelligence (LNAI)

Included in the following conference series:

Conference proceedings info: ALT 2008.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (37 papers)

  1. Front Matter

    Download chapter PDF

  3. Regular Contributions

    1. Statistical Learning

      1. Generalization Bounds for Some Ordinal Regression Algorithms
        • Shivani Agarwal
        Pages 7-21
      2. Approximation of the Optimal ROC Curve and a Tree-Based Ranking Algorithm
        • Stéphan Clémençon, Nicolas Vayatis
        Pages 22-37
      3. Sample Selection Bias Correction Theory
        • Corinna Cortes, Mehryar Mohri, Michael Riley, Afshin Rostamizadeh
        Pages 38-53
      4. Exploiting Cluster-Structure to Predict the Labeling of a Graph
        • Mark Herbster
        Pages 54-69
      5. A Uniform Lower Error Bound for Half-Space Learning
        • Andreas Maurer, Massimiliano Pontil
        Pages 70-78
      6. Generalization Bounds for K-Dimensional Coding Schemes in Hilbert Spaces
        • Andreas Maurer, Massimiliano Pontil
        Pages 79-91
      7. Learning and Generalization with the Information Bottleneck
        • Ohad Shamir, Sivan Sabato, Naftali Tishby
        Pages 92-107

    2. Probability and Stochastic Processes

      1. Growth Optimal Investment with Transaction Costs
        • László Györfi, István Vajda
        Pages 108-122
      2. Online Regret Bounds for Markov Decision Processes with Deterministic Transitions
        • Ronald Ortner
        Pages 123-137
      3. On-Line Probability, Complexity and Randomness
        • Alexey Chernov, Alexander Shen, Nikolai Vereshchagin, Vladimir Vovk
        Pages 138-153
      4. Prequential Randomness
        • Vladimir Vovk, Alexander Shen
        Pages 154-168
      5. Some Sufficient Conditions on an Arbitrary Class of Stochastic Processes for the Existence of a Predictor
        • Daniil Ryabko
        Pages 169-182
      6. Nonparametric Independence Tests: Space Partitioning and Kernel Approaches
        • Arthur Gretton, László Györfi
        Pages 183-198

    3. Boosting and Experts

      1. Supermartingales in Prediction with Expert Advice
        • Alexey Chernov, Yuri Kalnishkan, Fedor Zhdanov, Vladimir Vovk
        Pages 199-213
Back to top

Other volumes

  1. Algorithmic Learning Theory

Keywords

About this book

This volume contains papers presented at the 19th International Conference on Algorithmic Learning Theory (ALT 2008), which was held in Budapest, Hungary during October 13–16, 2008. The conference was co-located with the 11th - ternational Conference on Discovery Science (DS 2008). The technical program of ALT 2008 contained 31 papers selected from 46 submissions, and 5 invited talks. The invited talks were presented in joint sessions of both conferences. ALT 2008 was the 19th in the ALT conference series, established in Japan in 1990. The series Analogical and Inductive Inference is a predecessor of this series: it was held in 1986, 1989 and 1992, co-located with ALT in 1994, and s- sequently merged with ALT. ALT maintains its strong connections to Japan, but has also been held in other countries, such as Australia, Germany, Italy, Sin- pore, Spain and the USA. The ALT conference series is supervised by its Steering Committee: Naoki Abe (IBM T. J.

Editors and Affiliations

  • Computer Science and Engineering, University of California, San Diego, USA

    Yoav Freund

  • Department of Computer Science and Information Theory, Department of Computer Science and Budapest University of Technology and Economics, Budapest, Hungary

    László Györfi

  • Department of Math., Stat. and Comp. Sci,, University of Illinois, Chicago, USA

    György Turán

  • Division of Computer Science, Hokkaido University, Sapporo, Japan

    Thomas Zeugmann

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation