Approximate testing and its relationship to learning

DOI10.1016/S0304-3975(96)00241-1zbMath0893.68118MaRDI QIDQ1389650

Kathleen Romanik

Publication date: 30 June 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

computational learning theorytesting

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (2)

Testing simple polygons. ⋮ VC-dimensions of nondeterministic finite automata for words of equal length

Cites Work

• Unnamed Item
• Teachability in computational learning
• \(\epsilon\)-nets and simplex range queries
• Feedforward nets for interpolation and classification
• Testing geometric objects
• On the complexity of teaching
• Learnability and the Vapnik-Chervonenkis dimension
• Information capacity of the Hopfield model
• A theory of the learnable
• A Recursion Theoretic Approach to Program Testing
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities

This page was built for publication: Approximate testing and its relationship to learning