Exact Learning from an Honest Teacher That Answers Membership Queries
Not on the map. Why?
Abstract (arXiv)
Given a teacher that holds a function f:X→ R from some class of functions C. The teacher can receive from the learner an element~d in the domain X (a query) and returns the value of the function in d, f(d)∈ R. The learner goal is to find f with a minimum number of queries, optimal time complexity, and optimal resources. In this survey, we present some of the results known from the literature, different techniques used, some new problems, and open problems.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 13 Jun 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1; 2023: 0; 2024: 1; 2025: 0; 2026: 2.
6 papers.
- 2021Efficient Multiple Constraint Acquisitioncited by 6
- 2022Learning Low Degree Hypergraphscited by 3
- 2026Positive Distribution Shift as a Framework for Understanding Tractable Learningcited by 3
- 2024Approximating the Number of Relevant Variables in a Parity Implies Proper Learningcited by 1
- 2021On Learning and Testing Decision Treecited by 0
- 2026Optimal Quantum-Classical Separations for Exact Learningcited by 0
- 2026Optimal Quantum-Classical Separations for Exact Learning29 Sep 2026
- 2026Positive Distribution Shift as a Framework for Understanding Tractable Learning9 Feb 2026
- 2024Approximating the Number of Relevant Variables in a Parity Implies Proper Learning16 Jul 2024
- 2022Learning Low Degree Hypergraphs21 Feb 2022
- 2021Efficient Multiple Constraint Acquisition13 Sep 2021
- 2021On Learning and Testing Decision Tree10 Aug 2021