Skip to main content
  • Conference proceedings
  • © 2016

Algorithmic Learning Theory

27th International Conference, ALT 2016, Bari, Italy, October 19-21, 2016, Proceedings

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

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

Conference series link(s): ALT: International Conference on Algorithmic Learning Theory

Conference proceedings info: ALT 2016.

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and 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

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

Table of contents (24 papers)

  1. Front Matter

    Pages I-XIX
  2. Error Bounds, Sample Compression Schemes

    1. Front Matter

      Pages 1-1
    2. Localization of VC Classes: Beyond Local Rademacher Complexities

      • Nikita Zhivotovskiy, Steve Hanneke
      Pages 18-33
    3. Labeled Compression Schemes for Extremal Classes

      • Shay Moran, Manfred K. Warmuth
      Pages 34-49
    4. On Version Space Compression

      • Shai Ben-David, Ruth Urner
      Pages 50-64
  3. Statistical Learning Theory, Evolvability

    1. Front Matter

      Pages 65-65
    2. Learning with Rejection

      • Corinna Cortes, Giulia DeSalvo, Mehryar Mohri
      Pages 67-82
  4. Exact and Interactive Learning, Complexity of Teaching Models

    1. Front Matter

      Pages 113-113
    2. Exact Learning of Juntas from Membership Queries

      • Nader H. Bshouty, Areej Costa
      Pages 115-129
    3. Classifying the Arithmetical Complexity of Teaching Models

      • Achilles A. Beros, Ziyuan Gao, Sandra Zilles
      Pages 145-160
  5. Inductive Inference

    1. Front Matter

      Pages 161-161
    2. Intrinsic Complexity of Partial Learning

      • Sanjay Jain, Efim Kinber
      Pages 174-188
    3. Learning Pattern Languages over Groups

      • Rupert Hölzl, Sanjay Jain, Frank Stephan
      Pages 189-203
  6. Online Learning

    1. Front Matter

      Pages 205-205
    2. The Maximum Cosine Framework for Deriving Perceptron Based Linear Classifiers

      • Nader H. Bshouty, Catherine A. Haddad-Zaknoon
      Pages 207-222

Other Volumes

  1. Algorithmic Learning Theory

About this book

This book constitutes the refereed proceedings of the 27th International Conference on Algorithmic Learning Theory, ALT 2016, held in Bari, Italy, in October 2016, co-located with the 19th International Conference on Discovery Science, DS 2016. The 24 regular papers presented in this volume were carefully reviewed and selected from 45 submissions. In addition the book contains 5 abstracts of invited talks. The papers are organized in topical sections named: error bounds, sample compression schemes; statistical learning, theory, evolvability; exact and interactive learning; complexity of teaching models; inductive inference; online learning; bandits and reinforcement learning; and clustering.

Editors and Affiliations

  • Montanuniversität Leoben , Leoben, Austria

    Ronald Ortner

  • Ruhr-Uni-Bochum , Bochum, Germany

    Hans Ulrich Simon

  • University of Regina , Regina, Canada

    Sandra Zilles

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and 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