Queries revisited.
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1804113 (Why is no real title available?)
- A general lower bound on the number of examples needed for learning
- A new abstract combinatorial dimension for exact learning via queries
- A theory of the learnable
- Constructing optimal binary decision trees is NP-complete
- Decision Trees for Geometric Models
- How many queries are needed to learn?
- Learnability and the Vapnik-Chervonenkis dimension
- Lower bound methods and separation results for on-line learning models
- On the complexity of teaching
- Queries and concept learning
- Teachability in computational learning
- The consistency dimension and distribution-dependent learning from queries.
- Uniform characterizations of polynomial-query learnabilities
Cited in
(32)- Learning grammars and automata with queries
- How many queries are needed to learn one bit of information?
- A new abstract combinatorial dimension for exact learning via queries
- Learning noisy linear classifiers via adaptive and selective sampling
- Teaching randomized learners with feedback
- Learning indexed families of recursive languages from positive data: A survey
- A theory of formal synthesis via inductive learning
- Recent Developments in Algorithmic Teaching
- Minimizing depth of decision trees with hypotheses
- Projective DNF formulae and their revision
- scientific article; zbMATH DE number 7370532 (Why is no real title available?)
- scientific article; zbMATH DE number 2084821 (Why is no real title available?)
- Exact learning from an honest teacher that answers membership queries
- Canonical Horn representations and query learning
- Relations between Gold-style learning and query learning
- Queries and concept learning
- Abductive learning of quantized stochastic processes with probabilistic finite automata
- scientific article; zbMATH DE number 2080645 (Why is no real title available?)
- On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity
- Learning via finitely many queries
- The Crystallizing Substochastic Sequential Machine Extractor: CrySSMEx
- A general comparison of language learning from examples and from queries
- Polynomial certificates for propositional classes
- Learning of bounded-weight Boolean functions
- The power of random counterexamples
- scientific article; zbMATH DE number 1453030 (Why is no real title available?)
- scientific article; zbMATH DE number 1804113 (Why is no real title available?)
- Agnostic active learning
- Constraint acquisition
- A general dimension for query learning
- Knows what it knows: a framework for self-aware learning
- scientific article; zbMATH DE number 1804094 (Why is no real title available?)
This page was built for publication: Queries revisited.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1426146)