Queries and concept learning
From MaRDI portal
Publication:2232294
zbMath1470.68050MaRDI QIDQ2232294
Publication date: 4 October 2021
Published in: Machine Learning (Search for Journal in Brave)
Related Items (only showing first 100 items - show all)
Learning with queries inside the class of unate \(k\)-quasi-Horn formulas ⋮ Learning an extension of the class of functional dependencies with queries ⋮ Nonuniform learnability ⋮ Efficient multiple constraint acquisition ⋮ Attribute-efficient learning of Boolean functions from Post closed classes ⋮ On universal learning algorithms ⋮ Halfspace learning, linear programming, and nonmalicious distributions ⋮ Learning union of integer hypercubes with queries (with applications to monadic decomposition) ⋮ On learning multivariate polynomials under the uniform distribution ⋮ On learning width two branching programs ⋮ Learning nearly monotone \(k\)-term DNF ⋮ PACS, simple-PAC and query learning ⋮ Learning unions of high-dimensional boxes over the reals ⋮ Locating \(P\)/poly optimally in the extended low hierarchy ⋮ Efficient learning with equivalence queries of conjunctions of modulo functions ⋮ VC-dimensions of finite automata and commutative finite automata with \(k\) letters and \(n\) states ⋮ Learning Boolean halfspaces with small weights from membership queries ⋮ Inferring regular languages and \(\omega\)-languages ⋮ Quantifying inductive bias: AI learning algorithms and Valiant's learning framework ⋮ A model of interactive teaching ⋮ On teaching sets of \(k\)-threshold functions ⋮ On the number of irreducible points in polyhedra ⋮ A sufficient condition for polynomial distribution-dependent learnability ⋮ Exact learning of linear combinations of monotone terms from function value queries ⋮ Exact learning of juntas from membership queries ⋮ Learning intersections and thresholds of halfspaces ⋮ A theory of formal synthesis via inductive learning ⋮ Nonadaptive quantum query complexity ⋮ Conjunctions of unate DNF formulas: Learning and structure ⋮ Error-free and best-fit extensions of partially defined Boolean functions ⋮ Efficient learning with virtual threshold gates ⋮ An efficient membership-query algorithm for learning DNF with respect to the uniform distribution ⋮ Interactive graph-matching using active query strategies ⋮ Four one-shot learners for regular tree languages and their polynomial characterizability ⋮ Learning counting functions with queries ⋮ Recent advances of grammatical inference ⋮ Learning unions of tree patterns using queries ⋮ Learning nested differences in the presence of malicious noise ⋮ Learning orthogonal F-Horn formulas ⋮ A simple algorithm for learning O(log n)-term DNF ⋮ Knows what it knows: a framework for self-aware learning ⋮ Learning from examples with unspecified attribute values. ⋮ Iterative learning from texts and counterexamples using additional information ⋮ Learning Boolean specifications ⋮ On the uselessness of quantum queries ⋮ Exact learning of multivalued dependency formulas ⋮ Non-adaptive learning of a hidden hypergraph ⋮ Polynomial characteristic sets for \(DFA\) identification ⋮ The unbiased black-box complexity of partition is polynomial ⋮ The monotone theory for the PAC-model. ⋮ Queries revisited. ⋮ Learnability of quantified formulas. ⋮ Measuring teachability using variants of the teaching dimension ⋮ Learning indexed families of recursive languages from positive data: A survey ⋮ On learning multicategory classification with sample queries. ⋮ Learning languages from positive data and negative counterexamples ⋮ Learning a hidden graph using \(O(\log n)\)queries per edge ⋮ On zero-testing and interpolation of \(k\)-sparse multivariate polynomials over finite fields ⋮ Equivalence of models for polynomial learnability ⋮ Efficient learning of context-free grammars from positive structural examples ⋮ Approximate inference of functional dependencies from relations ⋮ Computational aspects of monotone dualization: a brief survey ⋮ Characterizing concept drift ⋮ Towards a mathematical theory of machine discovery from facts ⋮ Learning sets of antecedent-restricted functional and multivalued dependencies with queries ⋮ The description identification problem ⋮ Learning definite Horn formulas from closure queries ⋮ Three-way concept learning based on cognitive operators: an information fusion viewpoint ⋮ Decision theoretic generalizations of the PAC model for neural net and other learning applications ⋮ Learning semilinear sets from examples and via queries ⋮ Structure identification in relational data ⋮ On learning multivalued dependencies with queries ⋮ IIPS: A framework for specifying inductive-inference problems ⋮ Teaching randomized learners with feedback ⋮ Polynomial time learning of simple deterministic languages via queries and a representative sample ⋮ Exploring learnability between exact and PAC ⋮ Learning conditional preference networks ⋮ Active learning with multi-criteria decision making systems ⋮ Separating models of learning with faulty teachers ⋮ Prediction-preserving reducibility ⋮ Learning with unreliable boundary queries ⋮ Attribute-efficient learning in query and mistake-bound models ⋮ An introduction to some statistical aspects of PAC learning theory ⋮ One-shot learners using negative counterexamples and nearest positive examples ⋮ Structural results about exact learning with unspecified attribute values ⋮ Sample complexity of model-based search ⋮ Noise-tolerant parallel learning of geometric concepts ⋮ Necessary and sufficient conditions for learning with correction queries ⋮ On the cut-off point for combinatorial group testing ⋮ Improved bounds about on-line learning of smooth-functions of a single variable ⋮ The learnability of exclusive-or expansions based on monotone DNF formulas ⋮ Exact learning via teaching assistants ⋮ Effective approximation of parametrized closure systems over transactional data streams ⋮ A new abstract combinatorial dimension for exact learning via queries ⋮ Adaptive and self-confident on-line learning algorithms ⋮ Extremes in the degrees of inferability ⋮ Logical analysis of binary data with missing bits ⋮ Theory revision with queries: Horn, read-once, and parity formulas ⋮ The complexity of learning concept classes with polynomial general dimension ⋮ Ordered term tree languages which are polynomial time inductively inferable from positive data
This page was built for publication: Queries and concept learning
