Lecture Notes in Computer Science - Algorithmic Learning Theory
Latest Publications

TOTAL DOCUMENTS

27

(FIVE YEARS 0)

H-INDEX

4

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642409349, 9783642409356

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Nonparametric Multiple Change Point Estimation in Highly Dependent Time Series

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/978-3-642-40935-6_27 ◽

2013 ◽

pp. 382-396 ◽

Author(s):

Azadeh Khaleghi ◽

Daniil Ryabko

Keyword(s):

Time Series ◽

Change Point ◽

Point Estimation ◽

Change Point Estimation

Download Full-text

PAC Learning of Some Subclasses of Context-Free Grammars with Basic Distributional Properties from Positive Data

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/978-3-642-40935-6_11 ◽

2013 ◽

pp. 143-157 ◽

Author(s):

Chihiro Shibata ◽

Ryo Yoshinaka

Keyword(s):

Pac Learning ◽

Distributional Properties ◽

Positive Data ◽

Context Free ◽

Context Free Grammars

Download Full-text

Online PCA with Optimal Regrets

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/978-3-642-40935-6_8 ◽

2013 ◽

pp. 98-112 ◽

Author(s):

Jiazhong Nie ◽

Wojciech Kotłowski ◽

Manfred K. Warmuth

Download Full-text

Bayesian Methods for Low-Rank Matrix Estimation: Short Survey and Theoretical Study

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/978-3-642-40935-6_22 ◽

2013 ◽

pp. 309-323 ◽

Author(s):

Pierre Alquier

Keyword(s):

Bayesian Methods ◽

Theoretical Study ◽

Low Rank ◽

Matrix Estimation ◽

Short Survey ◽

Rank Matrix ◽

Low Rank Matrix

Download Full-text

Concentration and Confidence for Discrete Bayesian Sequence Predictors

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/978-3-642-40935-6_23 ◽

2013 ◽

pp. 324-338 ◽

Author(s):

Tor Lattimore ◽

Marcus Hutter ◽

Peter Sunehag

Download Full-text

Learning and Optimizing with Preferences

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/978-3-642-40935-6_2 ◽

2013 ◽

pp. 13-21

Author(s):

Nir Ailon

Download Full-text

An Efficient Algorithm for Learning with Semi-bandit Feedback

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/978-3-642-40935-6_17 ◽

2013 ◽

pp. 234-248 ◽

Author(s):

Gergely Neu ◽

Gábor Bartók

Keyword(s):

Efficient Algorithm

Download Full-text

On Competitive Recommendations

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/978-3-642-40935-6_7 ◽

2013 ◽

pp. 83-97 ◽

Author(s):

Jara Uitto ◽

Roger Wattenhofer

Download Full-text

Dimension-Adaptive Bounds on Compressive FLD Classification

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/978-3-642-40935-6_21 ◽

2013 ◽

pp. 294-308 ◽

Author(s):

Ata Kabán ◽

Robert J. Durrant

Download Full-text

Generalization and Robustness of Batched Weighted Average Algorithm with V-Geometrically Ergodic Markov Data

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/978-3-642-40935-6_19 ◽

2013 ◽

pp. 264-278 ◽

Author(s):

Nguyen Viet Cuong ◽

Lam Si Tung Ho ◽

Vu Dinh

Keyword(s):

Weighted Average

Download Full-text