Queries revisited

We begin with a brief tutorial on the problem of learning a finite concept class over a finite domain using membership queries and/or equivalence queries. We then sketch general results on the number of queries needed to learn a class of concepts, focusing on the various notions of combinatorial dimension that have been employed, including the teaching dimension, the exclusion dimension, the extended teaching dimension, the fingerprint dimension, the sample exclusion dimension, the Vapnik-Chervonenkis dimension, the abstract identification dimension, and the general dimension.

[1]  Ricard Gavaldà,et al.  On the power of equivalence queries , 1994, EuroCOLT.

[2]  Lisa Hellerstein,et al.  How many queries are needed to learn? , 1995, JACM.

[3]  Wolfgang Maass,et al.  Lower bound methods and separation results for on-line learning models , 1992, Machine Learning.

[4]  José L. Balcázar,et al.  The consistency dimension and distribution-dependent learning from queries , 2002, Theor. Comput. Sci..

[5]  José L. Balcázar,et al.  Abstract Combinatorial Characterizations of Exact Learning via Queries , 2000, COLT.

[6]  Leslie G. Valiant,et al.  A theory of the learnable , 1984, STOC '84.

[7]  Steven Skiena,et al.  Decision trees for geometric models , 1993, SCG '93.

[8]  Ayumi Shinohara,et al.  Uniform characterizations of polynomial-query learnabilities , 1998, Theor. Comput. Sci..

[9]  N. Littlestone.  Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[10]  Leslie G. Valiant,et al.  A general lower bound on the number of examples needed for learning , 1988, COLT '88.

[11]  José L. Balcázar,et al.  A New Abstract Combinatorial Dimension for Exact Learning via Queries , 2002, J. Comput. Syst. Sci..

[12]  José L. Balcázar,et al.  The Consistency Dimension and Distribution-Dependent Learning from Queries (Extended Abstract) , 1999, ALT.

[13]  Michael Kearns,et al.  On the complexity of teaching , 1991, COLT '91.

[14]  José L. Balcázar,et al.  A General Dimension for Exact Learning , 2001, COLT/EuroCOLT.

[15]  Ronald L. Rivest,et al.  Constructing Optimal Binary Decision Trees is NP-Complete , 1976, Inf. Process. Lett..

[16]  David Haussler,et al.  Learnability and the Vapnik-Chervonenkis dimension , 1989, JACM.

[17]  Tibor Hegedűs,et al.  Generalized teaching dimensions and the query complexity of learning , 1995, Annual Conference Computational Learning Theory.

[18]  D. Angluin.  Negative Results for Equivalence Queries , 1990, Machine Learning.

[19]  D. Angluin.  Queries and Concept Learning , 1988 .