scientific article; zbMATH DE number 67634

MaRDI QIDQ4013555zbMATH OpenFDO

Authors Gy. Turán, Wolfgang Maass

Publication date 27 September 1992

zbMATH Keywords

complexity of learningconcept classeslearning from counterexampleslower boundupper bound

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• The power of random counterexamples
• Exact Learning of Discretized Geometric Concepts
• A general lower bound on the number of examples needed for learning
• The power of random counterexamples
• scientific article; zbMATH DE number 1301786

Cited in

(15)

• Learning boxes in high dimension
• Algorithms and lower bounds for on-line learning of geometrical concepts
• Counterexample explanation by learning small strategies in Markov decision processes
• On-line learning with linear loss constraints.
• Counting extensional differences in BC-learning
• General bounds on the number of examples needed for learning probabilistic concepts
• The power of random counterexamples
• Exact Learning of Discretized Geometric Concepts
• scientific article; zbMATH DE number 1301786 (Why is no real title available?)
• Bounds on the Number of Examples Needed for Learning Functions
• The power of random counterexamples
• Simple and fast algorithms for interactive machine learning with random counter-examples
• An optimal algorithm for proper learning of unions of two rectangles with queries
• On learning from queries and counterexamples in the presence of noise
• On learning a union of half spaces

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4013555)