Asking questions to minimize errors
From MaRDI portal
Recommendations
Cited in
(24)- The query complexity of finding local minima in the lattice
- Exact learning of DNF formulas using DNF hypotheses
- Online learning of binary and \(n\)-ary relations over clustered domains.
- How many missing answers can be tolerated by query learners?
- Structural results about on-line learning models with and without queries
- A greedy randomized adaptive search procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions
- The learnability of unions of two rectangles in the two-dimensional discretized space
- Learning conditional preference networks
- Exact learning from an honest teacher that answers membership queries
- An algorithm to learn read-once threshold formulas, and transformations between learning models
- New bounds for the query complexity of an algorithm that learns DFAs with correction and equivalence queries
- The query complexity of learning DFA
- Learning recursive functions: A survey
- Constraint acquisition
- scientific article; zbMATH DE number 67615 (Why is no real title available?)
- From equivalence queries to PAC learning: the case of implication theories
- Simple learning algorithms using divide and conquer
- Efficient multiple constraint acquisition
- Even linear simple matrix languages: formal language properties and grammatical inference.
- scientific article; zbMATH DE number 2086401 (Why is no real title available?)
- Theory revision with queries: Horn, read-once, and parity formulas
- Non-adaptive learning of a hidden hypergraph
- Non-adaptive learning of a hidden hypergraph
- On the limits of proper learnability of subclasses of DNF formulas
This page was built for publication: Asking questions to minimize errors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1916529)
