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
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, Machine learning and logic: a new frontier in artificial intelligence, Online learning of smooth functions, Grammatical inference: An old and new paradigm, Language learning from membership queries and characteristic examples, On the non-efficient PAC learnability of conjunctive queries, Learning ordered binary decision diagrams, Simple PAC learning of simple decision lists, The complexity of learning minor closed graph classes, An optimal algorithm for proper learning of unions of two rectangles with queries, Disjunctions of negated counting functions are efficiently learnable with equivalence queries, Almost optimal proper learning and testing polynomials, Active learning by query by committee with robust divergences, Inferring Symbolic Automata, Learning picture sets from examples, Finding a hidden code by asking questions, Learning quantum finite automata with queries, Discovering workflow nets of concurrent iterative processes, Learning constraints through partial queries, Rule Induction and Reasoning over Knowledge Graphs, Invariant inference with provable complexity from the monotone theory, SAT-based invariant inference and its relation to concept learning, Exact learning of subclasses of CDNF formulas with membership queries, Learning unions of tree patterns using queries, Learning orthogonal F-Horn formulas, Learning nested differences in the presence of malicious noise, Explanatory and creative alternatives to the MDL principle, Monotone term decision lists, Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries, Agnostic learning of geometric patterns, Polynomial-time learnability of logic programs with local variables from entailment, Cryptographic limitations on parallelizing membership and equivalence queries with applications to random-self-reductions, Learning a circuit by injecting values, VC-dimensions of finite automata and commutative finite automata with \(k\) letters and \(n\) states, Learning elementary formal systems with queries., Identification of genetic networks by strategic gene disruptions and gene overexpressions under a Boolean model., Improving Symbolic Automata Learning with Concolic Execution, On learning monotone DNF under product distributions, Learning of bounded-weight Boolean functions, Learning DNF in time \(2^{\widetilde O(n^{1/3})}\), What Circuit Classes Can Be Learned with Non-Trivial Savings?, On the hardness of approximating the minimum consistent OBDD problem, Boolean analysis of incomplete examples, Formal Methods in FCA and Big Data, Sample Complexity Bounds on Differentially Private Learning via Communication Complexity, Exact learning from an honest teacher that answers membership queries, Circuit lower bounds from learning-theoretic approaches, Learning tree languages from positive examples and membership queries, Revising threshold functions, Learning intersection-closed classes with signatures, Applications of regularized least squares to pattern classification, On specifying Boolean functions by labelled examples, A general dimension for query learning, Quantum machine learning: a classical perspective, Formal language identification: query learning vs. gold-style learning, Complexity of Equivalence and Learning for Multiplicity Tree Automata, An approach to guided learning of Boolean functions, From equivalence queries to PAC learning: the case of implication theories, A representation of antimatroids by Horn rules and its application to educational systems, The bounded injury priority method and the learnability of unions of rectangles, Unnamed Item, Distinguishing pattern languages with membership examples, On the number of faces and radii of cells induced by Gaussian spherical tessellations, A Local Search Framework for Experimental Design, A Spectral Approach to Network Design, Learning from Positive Data and Negative Counterexamples: A Survey, Minimizing depth of decision trees with hypotheses, On the complexity of small description and related topics, Combinatorial results on the complexity of teaching and learning, Learning cost-sensitive active classifiers, Tangible reduction in learning sample complexity with large classical samples and small quantum system, Recognizable series on graphs and hypergraphs, Learning parities in the mistake-bound model, Negative results on learning multivalued dependencies with queries, Learning a subclass of \(k\)-quasi-Horn formulas with membership queries, Learning under \(p\)-tampering poisoning attacks, Unnamed Item, On Learning Regular Expressions and Patterns Via Membership and Correction Queries, Using Multiplicity Automata to Identify Transducer Relations from Membership and Equivalence Queries, Bidual Horn functions and extensions, Near-optimal discrete optimization for experimental design: a regret minimization approach, Bounds for the Number of Tests in Non-adaptive Randomized Algorithms for Group Testing, Identification of partial disjunction, parity, and threshold functions, Some natural conditions on incremental learning, A Novel Learning Algorithm for Büchi Automata Based on Family of DFAs and Classification Trees, Learning with errors in answers to membership queries, A method based on multi-standard active learning to recognize entities in electronic medical record, Iterative learning from positive data and negative counterexamples, A general comparison of language learning from examples and from queries, Learning languages from positive data and a limited number of short counterexamples, New collapse consequences of NP having small circuits, Optimizations in computing the Duquenne-Guigues basis of implications, Active learning of timed automata with unobservable resets, On the complexity of compressing obfuscation, Learning expressions and programs over monoids, Learning languages from positive data and a finite number of queries, Automatic learning from positive data and negative counterexamples, Unnamed Item, Polynomial certificates for propositional classes, Exact learning of DNF formulas using DNF hypotheses, Active-learning a convex body in low dimensions, Improved learning of \(k\)-parities, Probably approximately correct learning of Horn envelopes from queries, The complexity of exact learning of acyclic conditional preference networks from swap examples, The power of random counterexamples, Optimal deterministic group testing algorithms to estimate the number of defectives, Three-way cognitive concept learning via multi-granularity, Efficient learning algorithms yield circuit lower bounds, Agnostic active learning, The learnability of unions of two rectangles in the two-dimensional discretized space, A novel learning algorithm for Büchi automata based on family of DFAs and classification trees, Active Online Learning in the Binary Perceptron Problem, Unnamed Item, On Polynomial Time Constructions of Minimum Height Decision Tree, A general lower bound on the number of examples needed for learning, Scaling, machine learning, and genetic neural nets, Learning algorithms, Proper learning of \(k\)-term DNF formulas from satisfying assignments, Quantum Hardness of Learning Shallow Classical Circuits, General lower bounds on the query complexity within the exact learning model, A subexponential exact learning algorithm for DNF using equivalence queries, The consistency dimension and distribution-dependent learning from queries., On learning unions of pattern languages and tree patterns in the mistake bound model., Apple tasting., On-line learning with linear loss constraints., Improved lower bounds for learning from noisy examples: An information-theoretic approach, The query complexity of finding local minima in the lattice, Learning erasing pattern languages with queries, Relations between Gold-style learning and query learning, The subsumption lattice and query learning, Quantum learning of concentrated Boolean functions, Quantum algorithms for learning symmetric juntas via the adversary bound, Approximate computation of exact association rules, Uniform characterizations of polynomial-query learnabilities
