Sciweavers

7 search results - page 2 / 2
» On the Power of Membership Queries in Agnostic Learning
Sort
View
TAMC
2007
Springer
13 years 12 months ago
A Characterization of the Language Classes Learnable with Correction Queries
Abstract. Formal language learning models have been widely investigated in the last four decades. But it was not until recently that the model of learning from corrections was intr...
Cristina Tîrnauca, Satoshi Kobayashi
COCO
2001
Springer
149views Algorithms» more  COCO 2001»
13 years 10 months ago
Quantum versus Classical Learnability
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
Rocco A. Servedio, Steven J. Gortler