Lecture Notes in Computer Science - Algorithmic Learning Theory
Latest Publications

TOTAL DOCUMENTS

24

(FIVE YEARS 0)

H-INDEX

4

(FIVE YEARS 0)

Published By Springer International Publishing

9783319116617, 9783319116624

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Indefinitely Oscillating Martingales

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/978-3-319-11662-4_23 ◽

2014 ◽

pp. 321-335 ◽

Author(s):

Jan Leike ◽

Marcus Hutter

Download Full-text

Learning Regular Omega Languages

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/978-3-319-11662-4_10 ◽

2014 ◽

pp. 125-139 ◽

Author(s):

Dana Angluin ◽

Dana Fisman

Download Full-text

Learning Boolean Halfspaces with Small Weights from Membership Queries

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/978-3-319-11662-4_8 ◽

2014 ◽

pp. 96-110 ◽

Author(s):

Hasan Abasi ◽

Ali Z. Abdi ◽

Nader H. Bshouty

Keyword(s):

Membership Queries

Download Full-text

On the Role of Update Constraints and Text-Types in Iterative Learning

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/978-3-319-11662-4_5 ◽

2014 ◽

pp. 55-69 ◽

Author(s):

Sanjay Jain ◽

Timo Kötzing ◽

Junqi Ma ◽

Frank Stephan

Keyword(s):

Iterative Learning ◽

Download Full-text

Bandit Online Optimization over the Permutahedron

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/978-3-319-11662-4_16 ◽

2014 ◽

pp. 215-229 ◽

Author(s):

Nir Ailon ◽

Kohei Hatano ◽

Eiji Takimoto

Keyword(s):

Online Optimization

Download Full-text

A Chain Rule for the Expected Suprema of Gaussian Processes

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/978-3-319-11662-4_18 ◽

2014 ◽

pp. 245-259

Author(s):

Andreas Maurer

Keyword(s):

Gaussian Processes ◽

Download Full-text

A Survey of Preference-Based Online Learning with Bandit Algorithms

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/978-3-319-11662-4_3 ◽

2014 ◽

pp. 18-39 ◽

Author(s):

Róbert Busa-Fekete ◽

Eyke Hüllermeier

Keyword(s):

Online Learning

Download Full-text

Algorithmic Identification of Probabilities Is Hard

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/978-3-319-11662-4_7 ◽

2014 ◽

pp. 85-95

Author(s):

Laurent Bienvenu ◽

Benoît Monin ◽

Alexander Shen

Download Full-text

A Safe Approximation for Kolmogorov Complexity

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/978-3-319-11662-4_24 ◽

2014 ◽

pp. 336-350 ◽

Author(s):

Peter Bloem ◽

Francisco Mota ◽

Steven de Rooij ◽

Luís Antunes ◽

Pieter Adriaans

Keyword(s):

Kolmogorov Complexity

Download Full-text

Generalization Bounds for Time Series Prediction with Non-stationary Processes

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/978-3-319-11662-4_19 ◽

2014 ◽

pp. 260-274 ◽

Author(s):

Vitaly Kuznetsov ◽

Mehryar Mohri

Keyword(s):

Time Series ◽

Time Series Prediction ◽

Stationary Processes ◽

Generalization Bounds

Download Full-text