Learning read-once formulas with queries
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 67616
- Read-twice DNF formulas are properly learnable
- Learning Boolean read-once formulas over generalized bases
- Using relevance queries for identification of read-once functions
- Exact Identification of Read-Once Formulas Using Fixed Points of Amplification Functions
Cited in
(63)- Learning large-alphabet and analog circuits with value injection queries
- Selection of relevant features and examples in machine learning
- Attribute-efficient learning in query and mistake-bound models
- Learning probabilistic read-once formulas on product distributions
- An algorithm to learn read-once threshold formulas, and transformations between learning models
- Efficient parallel recognition algorithms of cographs and distance hereditary graphs
- Simple learning algorithms using divide and conquer
- The forbidden projections of unate functions
- Exact learning of linear combinations of monotone terms from function value queries
- Conjunctions of unate DNF formulas: Learning and structure
- Learning counting functions with queries
- Learning from examples with unspecified attribute values.
- Structural results about exact learning with unspecified attribute values
- Optimal ordered binary decision diagrams for read-once formulas
- The learnability of unions of two rectangles in the two-dimensional discretized space
- The query complexity of finding local minima in the lattice
- More efficient PAC-learning of DNF with membership queries under the uniform distribution
- Learning Boolean read-once formulas over generalized bases
- Learning fallible deterministic finite automata
- Independence and port oracles for matroids, with an application to computational learning theory
- Minimum self-dual decompositions of positive dual-minor Boolean functions
- Critical properties and complexity measures of read-once Boolean functions
- Learning read-constant polynomials of constant degree modulo composites
- Computer science and decision theory
- The complexity of exact learning of acyclic conditional preference networks from swap examples
- Diagnosis of constant faults in read-once contact networks over finite bases
- Learning attribute-efficiently with corrupt oracles
- Learning languages from positive data and a finite number of queries
- Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees
- Exact learning from an honest teacher that answers membership queries
- Learning with queries inside the class of unate \(k\)-quasi-Horn formulas
- Isomorphism testing of read-once functions and polynomials
- Diagnosis of three types of constant faults in read-once contact networks over finite bases
- Characterizing arithmetic read-once formulae
- Testing formula satisfaction
- Formula Caching in DPLL
- Dequantizing read-once quantum formulas
- Learning Read-Constant Polynomials of Constant Degree Modulo Composites
- Exact Identification of Read-Once Formulas Using Fixed Points of Amplification Functions
- A Tractable and Expressive Class of Marginal Contribution Nets and Its Applications
- Read-Once Functions Revisited and the Readability Number of a Boolean Function
- Using relevance queries for identification of read-once functions
- scientific article; zbMATH DE number 67616 (Why is no real title available?)
- How Do Read-Once Formulae Shrink?
- Learning Arithmetic Read-Once Formulas
- Read-once polynomial identity testing
- Locating errors in faulty formulas
- On some computations on sparse polynomials
- Derandomized learning of Boolean functions over finite abelian groups
- On the Readability of Monotone Boolean Formulae
- Query learning of bounded-width OBDDs
- Learning a circuit by injecting values
- Monotone term decision lists
- Exact learning of subclasses of CDNF formulas with membership queries
- On the readability of monotone Boolean formulae
- Constant depth formula and partial function versions of MCSP are hard
- On the limits of proper learnability of subclasses of DNF formulas
- Randomized vs. deterministic decision tree complexity for read-once Boolean functions
- Learning read once functions using subcube parity queries
- Towards identity testing for sums of products of Read-once and multilinear bounded-Read formulae
- Theory revision with queries: Horn, read-once, and parity formulas
- The complexity of learning concept classes with polynomial general dimension
- An improvement on the complexity of factoring read-once Boolean functions
This page was built for publication: Learning read-once formulas with queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4033838)
