Queries and concept learning
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
- Prediction-preserving reducibility
- Conjunctions of unate DNF formulas: Learning and structure
- A Local Search Framework for Experimental Design
- A sufficient condition for polynomial distribution-dependent learnability
- The query complexity of finding local minima in the lattice
- Learning qualitative constraint networks
- Learning grammars and automata with queries
- Exact learning of DNF formulas using DNF hypotheses
- Sample complexity bounds on differentially private learning via communication complexity
- scientific article; zbMATH DE number 18631 (Why is no real title available?)
- Attribute-efficient learning in query and mistake-bound models
- Learning with queries inside the class of unate \(k\)-quasi-Horn formulas
- Learning an extension of the class of functional dependencies with queries
- scientific article; zbMATH DE number 6297735 (Why is no real title available?)
- Learning orthogonal F-Horn formulas
- Learning from examples with unspecified attribute values.
- Quantum learning of concentrated Boolean functions
- Learning counting functions with queries
- Distinguishing pattern languages with membership examples
- Attribute-efficient learning of Boolean functions from Post closed classes
- Learning union of integer hypercubes with queries (with applications to monadic decomposition)
- Learnability of quantified formulas.
- On the cut-off point for combinatorial group testing
- Equivalence of models for polynomial learnability
- Online learning of smooth functions
- Learning orthogonal F-Horn formulas
- Quantum algorithms for learning symmetric juntas via the adversary bound
- Algorithmic Learning Theory
- A new abstract combinatorial dimension for exact learning via queries
- Approximate computation of exact association rules
- Learning sets of antecedent-restricted functional and multivalued dependencies with queries
- Learning languages from positive data and a limited number of short counterexamples
- An optimal algorithm for proper learning of unions of two rectangles with queries
- Actively learning from machine learning models with queries and counterexamples
- Learning languages from positive data and a finite number of queries
- On learning multivalued dependencies with queries
- Structural results about exact learning with unspecified attribute values
- Active learning of timed automata with unobservable resets
- Finding a hidden code by asking questions
- Learning picture sets from examples
- The subsumption lattice and query learning
- scientific article; zbMATH DE number 3883642 (Why is no real title available?)
- Learning erasing pattern languages with queries
- Learning DNF in time \(2^{\widetilde O(n^{1/3})}\)
- Learning Boolean functions with queries
- Learning semilinear sets from examples and via queries
- The bounded injury priority method and the learnability of unions of rectangles
- A framework for polynomial-time query learnability
- Approximate inference of functional dependencies from relations
- Characterizing concept drift
- Bidual Horn functions and extensions
- Iterative learning from texts and counterexamples using additional information
- Learning Horn envelopes via queries from language models
- Reasoning and learning in the setting of possibility theory -- overview and perspectives
- Synergies between machine learning and reasoning -- an introduction by the Kay R. Amel group
- Near-optimal discrete optimization for experimental design: a regret minimization approach
- Polynomial time learning of simple deterministic languages via queries and a representative sample
- Applications of regularized least squares to pattern classification
- Learning quantum finite automata with queries
- Discovering workflow nets of concurrent iterative processes
- Teaching randomized learners with feedback
- Learning a circuit by injecting values
- Learning indexed families of recursive languages from positive data: A survey
- Tangible reduction in learning sample complexity with large classical samples and small quantum system
- Optimal deterministic group testing algorithms to estimate the number of defectives
- The learnability of unions of two rectangles in the two-dimensional discretized space
- Using Multiplicity Automata to Identify Transducer Relations from Membership and Equivalence Queries
- A subexponential exact learning algorithm for DNF using equivalence queries
- Language learning from membership queries and characteristic examples
- Learning regular sets from queries and counterexamples
- Learning via queries in [+, <]
- An introduction to some statistical aspects of PAC learning theory
- Noise-tolerant parallel learning of geometric concepts
- Adaptive and self-confident on-line learning algorithms
- On universal learning algorithms
- scientific article; zbMATH DE number 67809 (Why is no real title available?)
- A theory of formal synthesis via inductive learning
- Complexity of equivalence and learning for multiplicity tree automata
- Learning constraints through partial queries
- Probably approximately correct learning of Horn envelopes from queries
- Three-way cognitive concept learning via multi-granularity
- The monotone theory for the PAC-model.
- On learning multicategory classification with sample queries.
- On learning multivariate polynomials under the uniform distribution
- Learning unions of tree patterns using queries
- The complexity of learning minor closed graph classes
- Learning languages from positive data and negative counterexamples
- On Polynomial Time Constructions of Minimum Height Decision Tree
- Learning conditional preference networks
- Learning cost-sensitive active classifiers
- Learning unions of tree patterns using queries
- On learning width two branching programs
- Learning nearly monotone k-term DNF
- Learning unions of high-dimensional boxes over the reals
- PACS, simple-PAC and query learning
- Minimizing depth of decision trees with hypotheses
- General lower bounds on the query complexity within the exact learning model
- Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
- Rule Induction and Reasoning over Knowledge Graphs
This page was built for publication: Queries and concept learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2232294)
