Queries revisited.
From MaRDI portal
Publication:1426146
DOI10.1016/j.tcs.2003.11.004zbMath1069.68086OpenAlexW2913371065MaRDI QIDQ1426146
Publication date: 14 March 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2003.11.004
Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05)
Related Items
Learning of bounded-weight Boolean functions ⋮ A theory of formal synthesis via inductive learning ⋮ Minimizing depth of decision trees with hypotheses ⋮ Abductive learning of quantized stochastic processes with probabilistic finite automata ⋮ Unnamed Item ⋮ Knows what it knows: a framework for self-aware learning ⋮ Learning noisy linear classifiers via adaptive and selective sampling ⋮ Learning Grammars and Automata with Queries ⋮ Learning indexed families of recursive languages from positive data: A survey ⋮ A general comparison of language learning from examples and from queries ⋮ On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity ⋮ Constraint acquisition ⋮ Projective DNF formulae and their revision ⋮ Teaching randomized learners with feedback ⋮ Polynomial certificates for propositional classes ⋮ The power of random counterexamples ⋮ Recent Developments in Algorithmic Teaching ⋮ Agnostic active learning ⋮ Canonical Horn Representations and Query Learning ⋮ The Crystallizing Substochastic Sequential Machine Extractor: CrySSMEx ⋮ Relations between Gold-style learning and query learning
Cites Work
- Unnamed Item
- Teachability in computational learning
- Lower bound methods and separation results for on-line learning models
- Constructing optimal binary decision trees is NP-complete
- A new abstract combinatorial dimension for exact learning via queries
- A general lower bound on the number of examples needed for learning
- The consistency dimension and distribution-dependent learning from queries.
- Uniform characterizations of polynomial-query learnabilities
- On the complexity of teaching
- Queries and concept learning
- Learnability and the Vapnik-Chervonenkis dimension
- A theory of the learnable
- How many queries are needed to learn?
- Decision Trees for Geometric Models
This page was built for publication: Queries revisited.
