Applying valiant's learning framework to Al concept-learning problems

Abstract We present an overview of some recent theoretical results in the learning framework introduced by Valiant in [Valiant, 1984] and further developed in [Valiant 1985; Blumer, et al., 1987; 1989; Pitt and Valiant, 1988; Haussler, 1988; Angluin and Laird, 1988; Angluin, 1988; Rivest, 1987; Haussler, 1989; Kearns, et al., 1987a; 1987b]. Our focus is on applications to AI problems of learning from examples as given in [Haussler, 1988; 1989] and [Kearns, et al., 1987a; 1987b], along with a comparison to the work of Mitchell on version spaces [Mitchell, 1982]. We discuss learning problems for both attribute-based and structural domains. This is a revised and expanded version of [Haussler, 1987].

[1]  Larry A. Rendell.  A General Framework for Induction and a Study of Selective Induction , 1986, Mach. Learn..

[2]  David Haussler,et al.  Quantifying Inductive Bias: AI Learning Algorithms and Valiant's Learning Framework , 1988, Artif. Intell..

[3]  David Haussler,et al.  Equivalence of models for polynomial learnability , 1988, COLT '88.

[4]  Leslie G. Valiant,et al.  On the learnability of Boolean formulae , 1987, STOC.

[5]  David Haussler.  Bias, Version Spaces and Valiant's Learning Framework , 1987 .

[6]  Judea Pearl,et al.  ON THE CONNECTION BETWEEN THE COMPLEXITY AND CREDIBILITY OF INFERRED MODELS , 1978 .

[7]  Jeffrey C. Schlimmer.  Incremental Adjustment of Representations for Learning , 1987 .

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

[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]  Frederick Hayes-Roth,et al.  An interference matching technique for inducing abstractions , 1978, CACM.

[11]  DANA ANGLUIN,et al.  On the Complexity of Minimum Inference of Regular Sets , 1978, Inf. Control..

[12]  Thomas M. Cover,et al.  Geometrical and Statistical Properties of Systems of Linear Inequalities with Applications in Pattern Recognition , 1965, IEEE Trans. Electron. Comput..

[13]  M. Kearns,et al.  Recent Results on Boolean Concept Learning , 1987 .

[14]  David Haussler,et al.  Occam's Razor , 1987, Inf. Process. Lett..

[15]  Alan Bundy,et al.  An Analytical Comparison of Some Rule-Learning Programs , 1985, Artif. Intell..

[16]  Paul E. Utgoff,et al.  Shift of bias for inductive concept learning , 1984 .

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

[18]  David Haussler,et al.  ɛ-nets and simplex range queries , 1987, Discret. Comput. Geom..

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

[20]  Leslie G. Valiant,et al.  Computational limitations on learning from examples , 1988, JACM.

[21]  S. Vere.  Induction of concepts in the predicate calculus , 1975, IJCAI 1975.

[22]  Ryszard S. Michalski,et al.  A Theory and Methodology of Inductive Learning , 1983, Artificial Intelligence.

[23]  Vladimir Vapnik,et al.  Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .

[24]  Tom M. Mitchell,et al.  Generalization as Search , 2002 .

[25]  Patrick Henry Winston,et al.  Learning structural descriptions from examples , 1970 .

[26]  Carl H. Smith,et al.  Inductive Inference: Theory and Methods , 1983, CSUR.