Exact learning via teaching assistants

DOI10.1016/S0304-3975(99)00266-2MaRDI QIDQ1575459zbMATH OpenOpenAlexFDO

Authors Vikraman Arvind, N. V. Vinodchandran

Publication date 21 August 2000

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

Full work available at URL https://doi.org/10.1016/s0304-3975(99)00266-2

zbMATH Keywords

exact learningteaching assistant model

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Teachability in computational learning
• Learning Theory
• scientific article; zbMATH DE number 1804113
• Heuristic search of optimal machine teaching curricula
• Exact learning of formulas in parallel
• Exact Learning Composed Classes with a Small Number of Mistakes
• scientific article; zbMATH DE number 2089073

Cites work

• Gap-definable counting classes
• How many queries are needed to learn?
• scientific article; zbMATH DE number 3137403 (Why is no real title available?)
• scientific article; zbMATH DE number 177810 (Why is no real title available?)
• scientific article; zbMATH DE number 192916 (Why is no real title available?)
• scientific article; zbMATH DE number 3336895 (Why is no real title available?)
• On the complexity of teaching
• Oracles and queries that are sufficient for exact learning
• Quantitative Relativizations of Complexity Classes
• Queries and concept learning
• Structural analysis of polynomial-time query learnability

Cited in

(4)

• A new abstract combinatorial dimension for exact learning via queries
• The complexity of exactly learning algebraic concepts
• Learning Theory
• Computing and Combinatorics

This page was built for publication: Exact learning via teaching assistants

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