Learning via queries and oracles
From MaRDI portal
inductive inferencelogical queriesmodels of queries to a teacherqueries to a non-recursive oraclequery-inference degreesTuring degrees
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Applications of computability and recursion theory (03D80) Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05)
Recommendations
Cites work
- Classical recursion theory. Vol. II
- Comparison of identification criteria for machine inductive inference
- Degrees joining to 0′
- Extremes in the degrees of inferability
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- scientific article; zbMATH DE number 3715539 (Why is no real title available?)
- scientific article; zbMATH DE number 67621 (Why is no real title available?)
- Inductive inference and unsolvability
- Language identification in the limit
- Learning regular sets from queries and counterexamples
- Learning via queries
- Learning via queries in [+, <]
- On the structure of degrees of inferability.
- Terse, superterse, and verbose sets
Cited in
(19)- Necessary and sufficient conditions for learning with correction queries
- Extremes in the degrees of inferability
- Learning counting functions with queries
- Automata techniques for query inference machines
- LAQP: learning-based approximate query processing
- Teachers, learners, and oracles
- scientific article; zbMATH DE number 67621 (Why is no real title available?)
- scientific article; zbMATH DE number 1048043 (Why is no real title available?)
- scientific article; zbMATH DE number 1051236 (Why is no real title available?)
- scientific article; zbMATH DE number 1946973 (Why is no real title available?)
- scientific article; zbMATH DE number 1563912 (Why is no real title available?)
- On the Power of Learning from k-Wise Queries
- scientific article; zbMATH DE number 6297735 (Why is no real title available?)
- Algorithmic Learning Theory
- Robust learning with infinite additional information
- On learning from queries and counterexamples in the presence of noise
- Learning via finitely many queries
- Inferring answers to queries
- On the structure of degrees of inferability.
This page was built for publication: Learning via queries and oracles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1295409)