Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJune 2022
The approximate degree of DNF and CNF formulas
STOC 2022: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of ComputingPages 1194–1207https://doi.org/10.1145/3519935.3520000The approximate degree of a Boolean function f∶{0,1}n→{0,1} is the minimum degree of a real polynomial p that approximates f pointwise: |f(x)−p(x)|≤1/3 for all x∈{0,1}n. For any δ>0, we construct DNF and CNF formulas of polynomial size with approximate ...
- articleMarch 2017
Evaluation of Monotone DNF Formulas
Stochastic boolean function evaluation (SBFE) is the problem of determining the value of a given boolean function f on an unknown input x, when each bit $$x_i$$xi of x can only be determined by paying a given associated cost $$c_i$$ci. Further, x is ...
- ArticleOctober 2012
Better Pseudorandom Generators from Milder Pseudorandom Restrictions
FOCS '12: Proceedings of the 2012 IEEE 53rd Annual Symposium on Foundations of Computer SciencePages 120–129https://doi.org/10.1109/FOCS.2012.77We present an iterative approach to constructing pseudorandom generators, based on the repeated application of mild pseudorandom restrictions. We use this template to construct pseudorandom generators for combinatorial rectangles and read-once CNFs and ...
- articleMarch 2009
Polylogarithmic Independence Can Fool DNF Formulas
SIAM Journal on Computing (SICOMP), Volume 38, Issue 6Pages 2220–2272https://doi.org/10.1137/070691954We show that any $k$-wise independent probability distribution on $\{0,1\}^n$ $O(m^{2.2}$ $2^{-\sqrt{k}/10})$-fools any boolean function computable by an $m$-clause disjunctive normal form (DNF) (or conjunctive normal form (CNF)) formula on $n$ ...
- articleFebruary 2008
The complexity of properly learning simple concept classes
Journal of Computer and System Sciences (JCSS), Volume 74, Issue 1Pages 16–34https://doi.org/10.1016/j.jcss.2007.04.011We consider the complexity of properly learning concept classes, i.e. when the learner must output a hypothesis of the same form as the unknown concept. We present the following new upper and lower bounds on well-known concept classes:*We show that ...
- articleDecember 2007
DNF are teachable in the average case
We study the average number of well-chosen labeled examples that are required for a helpful teacher to uniquely specify a target function within a concept class. This "average teaching dimension" has been studied in learning theory and combinatorics ...
- articleJanuary 2003
Learning from examples with unspecified attribute values
Information and Computation (ICOM), Volume 180, Issue 2Pages 82–100https://doi.org/10.1016/S0890-5401(02)00030-5A challenging problem within machine learning is how to make good inferences from data sets in which pieces of information are missing. While it is valuable to have algorithms that perform well for specific domains, to gain a fundamental understanding ...
- articleJune 1995
On the Learnability of Disjunctive Normal Form Formulas
We present two related results about the learnability of disjunctive normal form (DNF) formulas. First we show that a common approach for learning arbitrary DNF formulas requires exponential time. We then contrast this with a polynomial time algorithm ...