Add to ORKGAbstract We present new results, both positive and negative, on the well-studied problem of learning disjunctive normal form (DNF) expressions
AbstractWe prove two lower bounds in the statistical query (SQ) learning model. The first lower boun...
Recently, Valiant introduced a computational model of learning, and gave a precice definition of lea...
AbstractWe show that read-twice DNF formulas-Boolean formulas in disjunctive normal form in which ea...
Since its introduction by Valiant in 1984, PAC learning of DNF expressions remains one of the centra...
AbstractWe present a membership-query algorithm for efficiently learning DNF with respect to the uni...
AbstractWe show how to learn in polynomial time monotone d-term DNF formulae (formulae in disjunctiv...
We show how to learn in polynomial time monotone d-term DNF formulae (formulae in disjunctive normal...
We show that DNF formulae can be quantum PAC-learned in polynomial time under product distributions ...
The topic of discrete Fourier analysis has been extensively studied in recent decades. It plays an i...
132 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1993.The learnability of disjuncti...
AbstractCombinatorial and learnability results are proven for projective disjunctive normal forms, a...
We consider the problems of attribute-efficient PAC learning of two well-studied concept classes: pa...
function and let C be a concept class where each concept has size at most t. Define opt = min c∈C Pr...
Combinatorial and learnability results are proven for projective disjunctive normal forms, a class o...
We extend the notion of general dimension, a combinatorial characterization of learning complexity ...
AbstractWe prove two lower bounds in the statistical query (SQ) learning model. The first lower boun...
Recently, Valiant introduced a computational model of learning, and gave a precice definition of lea...
AbstractWe show that read-twice DNF formulas-Boolean formulas in disjunctive normal form in which ea...
Since its introduction by Valiant in 1984, PAC learning of DNF expressions remains one of the centra...
AbstractWe present a membership-query algorithm for efficiently learning DNF with respect to the uni...
AbstractWe show how to learn in polynomial time monotone d-term DNF formulae (formulae in disjunctiv...
We show how to learn in polynomial time monotone d-term DNF formulae (formulae in disjunctive normal...
We show that DNF formulae can be quantum PAC-learned in polynomial time under product distributions ...
The topic of discrete Fourier analysis has been extensively studied in recent decades. It plays an i...
132 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1993.The learnability of disjuncti...
AbstractCombinatorial and learnability results are proven for projective disjunctive normal forms, a...
We consider the problems of attribute-efficient PAC learning of two well-studied concept classes: pa...
function and let C be a concept class where each concept has size at most t. Define opt = min c∈C Pr...
Combinatorial and learnability results are proven for projective disjunctive normal forms, a class o...
We extend the notion of general dimension, a combinatorial characterization of learning complexity ...
AbstractWe prove two lower bounds in the statistical query (SQ) learning model. The first lower boun...
Recently, Valiant introduced a computational model of learning, and gave a precice definition of lea...
AbstractWe show that read-twice DNF formulas-Boolean formulas in disjunctive normal form in which ea...