Learning via finitely many queries
DOI10.1007/S10472-005-7035-0zbMATH Open1086.68065OpenAlexW1977537598MaRDI QIDQ812396FDOQ812396
Authors: Andrew C. Y. Lee 
Publication date: 23 January 2006
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-005-7035-0
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Computational learning theory (68Q32) Applications of computability and recursion theory (03D80) Turing machines and related notions (03D10)
Cites Work
- Learning regular sets from queries and counterexamples
- Title not available (Why is that?)
- Language identification in the limit
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Power of Pluralism for Automatic Program Synthesis
- Incremental concept learning for bounded data mining.
- Comparison of identification criteria for machine inductive inference
- On the impact of forgetting on learning machines
- Gödel numberings of partial recursive functions
- Decidability and undecidability of extensions of second (first) order theory of (generalized) successor
- Automata techniques for query inference machines
- Recursion theoretic models of learning: Some results and intuitions
- Learning via queries
- Title not available (Why is that?)
- Title not available (Why is that?)
- On learning to coordinate. Random bits help, insightful normal forms, and competency isomorphisms
- Inferring answers to queries
Cited In (16)
- Learning counting functions with queries
- Algorithmic Learning Theory
- Learning via queries in [+, <]
- General lower bounds on the query complexity within the exact learning model
- On Learning With Finite Memory
- Title not available (Why is that?)
- The consistency dimension and distribution-dependent learning from queries.
- On the Power of Learning from k-Wise Queries
- On learning from queries and counterexamples in the presence of noise
- LAQP: learning-based approximate query processing
- Structural analysis of polynomial-time query learnability
- Learning in the presence of finitely or infinitely many irrelevant attributes
- On the relative sizes of learnable sets
- Title not available (Why is that?)
- How many queries are needed to learn?
- Necessary and sufficient conditions for learning with correction queries
This page was built for publication: Learning via finitely many queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q812396)
