A Solution of the Credit Assignment Problem in the Case of Learning Rectangles (Abstract)

[1]  D. Angluin.  Queries and Concept Learning , 2004, Machine Learning.

[2]  Zhixiang Chen,et al.  On-line learning of rectangles , 1992, COLT '92.

[3]  Peter Winkler,et al.  Three Thresholds for a Liar , 1992, Combinatorics, Probability and Computing.

[4]  Wolfgang Maass,et al.  On the complexity of learning from counterexamples , 1989, 30th Annual Symposium on Foundations of Computer Science.

[5]  Andrzej PELC,et al.  Searching with Known Error Probability , 1989, Theor. Comput. Sci..

[6]  W. Maass,et al.  On the Complexity of Learning From Counterexamples (extended abstract ) , 1989, FOCS 1989.

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

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

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

[10]  Barr and Feigenbaum Edward A. Avron,et al.  The Handbook of Artificial Intelligence , 1981 .

[11]  Joel H. Spencer,et al.  Coping with Errors in Binary Search Procedures , 1980, J. Comput. Syst. Sci..