Lecture Notes in Computer Science - Computational Learning Theory
Latest Publications

TOTAL DOCUMENTS

41

(FIVE YEARS 0)

H-INDEX

9

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540423430, 9783540445814

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Optimizing Average Reward Using Discounted Rewards

Lecture Notes in Computer Science - Computational Learning Theory ◽

10.1007/3-540-44581-1_40 ◽

2001 ◽

pp. 605-615 ◽

Author(s):

Sham Kakade

Keyword(s):

Average Reward ◽

Discounted Rewards

Download Full-text

Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces

Lecture Notes in Computer Science - Computational Learning Theory ◽

10.1007/3-540-44581-1_26 ◽

2001 ◽

pp. 402-415 ◽

Author(s):

Jürgen Forster ◽

Niels Schmitt ◽

Hans Ulrich Simon

Download Full-text

Robust Learning — Rich and Poor

Lecture Notes in Computer Science - Computational Learning Theory ◽

10.1007/3-540-44581-1_10 ◽

2001 ◽

pp. 143-159 ◽

Author(s):

John Case ◽

Sanjay Jain ◽

Frank Stephan ◽

Rolf Wiehagen

Keyword(s):

Robust Learning

Download Full-text

How Many Queries Are Needed to Learn One Bit of Information?

Lecture Notes in Computer Science - Computational Learning Theory ◽

10.1007/3-540-44581-1_1 ◽

2001 ◽

pp. 1-13 ◽

Author(s):

Hans Ulrich Simon

Download Full-text

Ultraconservative Online Algorithms for Multiclass Problems

Lecture Notes in Computer Science - Computational Learning Theory ◽

10.1007/3-540-44581-1_7 ◽

2001 ◽

pp. 99-115 ◽

Author(s):

Koby Crammer ◽

Yoram Singer

Keyword(s):

Online Algorithms

Download Full-text

Limitations of Learning via Embeddings in Euclidean Half-Spaces

Lecture Notes in Computer Science - Computational Learning Theory ◽

10.1007/3-540-44581-1_25 ◽

2001 ◽

pp. 385-401 ◽

Author(s):

Shai Ben-David ◽

Nadav Eiron ◽

Hans Ulrich Simon

Download Full-text

Learning Monotone DNF from a Teacher That Almost Does Not Answer Membership Queries

Lecture Notes in Computer Science - Computational Learning Theory ◽

10.1007/3-540-44581-1_36 ◽

2001 ◽

pp. 546-557 ◽

Author(s):

Nader H. Bshouty ◽

Nadav Eiron

Keyword(s):

Membership Queries

Download Full-text

When Can Two Unsupervised Learners Achieve PAC Separation?

Lecture Notes in Computer Science - Computational Learning Theory ◽

10.1007/3-540-44581-1_20 ◽

2001 ◽

pp. 303-319 ◽

Author(s):

Paul W. Goldberg

Download Full-text

Bounds on Sample Size for Policy Evaluation in Markov Environments

Lecture Notes in Computer Science - Computational Learning Theory ◽

10.1007/3-540-44581-1_41 ◽

2001 ◽

pp. 616-629 ◽

Author(s):

Leonid Peshkin ◽

Sayan Mukherjee

Keyword(s):

Sample Size ◽

Policy Evaluation

Download Full-text

Learning Relatively Small Classes

Lecture Notes in Computer Science - Computational Learning Theory ◽

10.1007/3-540-44581-1_18 ◽

2001 ◽

pp. 273-288 ◽

Author(s):

Shahar Mendelson

Download Full-text