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 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
This page was built for publication: Queries and concept learning
