1 / 19

Proclaiming Dictators and Juntas or Testing Boolean Formulae

Proclaiming Dictators and Juntas or Testing Boolean Formulae. Michal Parnas Dana Ron Alex Samorodnitsky. Testing Properties of Functions or: Testing membership in Function Classes. f : {0,1} n -> {0,1} – Tested function; F – Class of functions (e.g. class of parity functions);

gerda
Télécharger la présentation

Proclaiming Dictators and Juntas or Testing Boolean Formulae

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Proclaiming Dictators and JuntasorTesting Boolean Formulae Michal Parnas Dana Ron Alex Samorodnitsky

  2. Testing Properties of Functions or: Testing membership in Function Classes f : {0,1}n -> {0,1} – Tested function; F– Class of functions (e.g. class of parity functions); dist(f,F) - mingF(Pr[f(x)g(x)]) f x f(x) If fF should accept with probability  2/3 If dist(f,F) >  should reject with probability  2/3

  3. In this work: We consider “The most basic” function classes: • Singletons: • Monomials: • DNF:

  4. Motivation • Use testing as preliminary step to learning.That is, to decide what hypothesis class to use. • Gain new understanding about function class F through Property Testing perspective.

  5. Previous Work on Property Testing Properties of functions: • Initially defined by Rubinfeld and Sudan in the context of Program Testing. Tested algebraic propertiesof functions: low-degree polynomials. • Other work on testing algebraic properties: [BLR,R,EKKRV...]. • Non-algebraic properties: Monotonicity[GGLRS,DGLRSS,B,FN]. • Properties of other objects: • Main focus: Graph properties:[GGR,GR,AK,AFKS,BR,PR,CS...] • Growing body of work deals with properties ofstrings [AKNS,N,PRR], sets of points [PR], geometric objects[CSZ], distributions [BFRW], and more.

  6. Our Results • Test whether f is a singleton using queries. • Test whether f is a monomial using queries. • Test whether f is a monotoneDNF with at most tterms using queries. Common theme:no dependence in query complexity on size of input, n, and polynomial dependence on distance parameter, e.

  7. Learning Boolean Formulae Basic observation: (proper) learning implies testing. • Can learn singletons and monomials under uniform distribution using queries [BEHW]. • Can properly learn monotone DNF with t terms and r literals using queries [A+BJT]. Main difference in our work: no dependence on n(though worse dependence on e and t ), and different algorithmic approach.

  8. Singletons satisfy: (1)(2) Testing (Monotone) Singletons Natural test: check, by sampling, that conditions hold (approximately). Can analyze natural test for case that distance between function and class of singletons is not too big (bounded from 1/2).

  9. Observation: Singletons are a special case of parity functions (i.e., functions of the form .) Claim:Let . If then Modified algorithm: (1) Test whether f is a parity function (with dist. par. e) using algorithm of [BLR] . (2) Uniformly select constant number of pairs x,y and check whether any is a violating pair (i.e.: ). Testing Singletons II - Parity Testing

  10. Testing Singletons III - Self Correcting This “almost works”: Iffis singleton - always accepted. If f is e-far from parity - rejected w.h.p. But if f is e-close to parity function g, then cannot simply apply claim to argue that many violating pairs w.r.t. f. If we could only test violations w.r.t.ginstead of f ... Use Self-Corrector of [BLR] to “fix” f into parity function(g), and then test violations on self-corrected version.

  11. Testing Singletons IIII - The Algorithm Final Algorithm for Testing Singletons:(1) Test whether f is a parity function with dist. par. e using algorithm of [BLR] . (2) Uniformly select constant number of pairs x,y. Verify that Self-Cor(f,x)Self-Cor(f,y)= Self-Cor(f,xy). (3) Verify that Self-Cor( ) = 1 .

  12. Testing (Monotone) Monomials Monomials satisfy: (1) for some intk(2) Here too use some additional structure: If f is a monomial, then F1={x: f(x)=1} is an affine subspace (i.e., exist linear subspace V and y{0,1}n s.t. F1=Vy). In addition to checking conditions (1) and (2), algorithm tests whether F1 is an affine subspace. (How do we test affinity? Why does this help us? )

  13. Fact:H is an affine subspace i.f.f. The Affinity Test: Repeat O(1/e2) times: Uniformly select x,yF1, z {0,1}n, verify that ( implies ) Testing Monomials II - Affinity Testing

  14. Lemma2 (implications of test):If f is close to function g s.t. G1=[g(x)=1] is an affine subspace but g is not a monomial then is large. Testing Monomials III - Affinity Lemmas Lemma1 (correctness of affinity test):If f is monomial then affinity test always passes. If f is far from every function g s.t. G1=[g(x)=1] is an affine subspace, then test rejects w.h.p. What if f is far from every monomial (so should be rejected) but close to a function g s.t. G1=[g(x)=1] is an affine subspace (so may pass affinity test)?

  15. Testing Monomials IIII - The Algorithm Algorithm for Testing Monomials:(1) Check that Pr[f(x)=1] is close to 2-k for some integerk. (2) Test whether F1={x: f(x)=1} is an affine subspace:Repeat O(1/e2) times: Uniformly select x,yF1, z {0,1}n, verify that (3) Repeat O(1/e) times: Uniformly select xF1, y{0,1}n check whether

  16. Testing Monotone DNF Basic idea: Reduce testing DNF to testing monomials. If fis a t-term DNF, then fis the disjunction (“or”) oftmonomialsf1,…,ft. High Level Description of Algorithm: Works in (at most t) iterations. In i’th iteration finds string xithat can be used to (implicitly) define function gi. Tests whether each gi is a monotone monomial.

  17. Testing Monotone DNF II Can Show:If fis monotone t-term DNF then, w.h.p. all gi’s are monotone monomials.  If fis far from monotone t-term DNF then, at least one gi is far from monotone monomials (or don’t finish after t iterations). What are xi’s and how are the gi’s defined? If fis DNF then xi’s are “single-term representatives”. That is, each satisfies a single term (monomial) fiin f. Define gi(y)=1i.f.f.f(x)=1andf(xiy)=1

  18. Testing Monotone DNF III - Finding Single-Term Rep’s Basic Idea: Suppose fis DNF. For x in F1 let S(x) denote subset of (indices of) terms satisfied by x. (Note that single-term-rep equiv to S(x) .)Consider x,yin F1. Then S(xy)=S(x)S(y). Furthermore, for fixed x, w.h.p. over random yin F1, |S(xy)|(3/4)|S(x)|. On the other hand, can bound probability that |S(xy)|=0. Hence, if we start from some x in F1 (s.t. S(x) contains term that is not yet represented) can obtain newsingle-term-rep (i.e., x’ s.t. S(x’)=1)w.h.p. in O(log t) steps.

  19. Further Research • Are parity/affinity tests necessary for singletons/monomials? • Can (cubic) dependence on 1/ein monomial test be improved? • Is polynomial (or even linear) dependence on t (num of terms in DNF) really necessary? • Can algorithm for testing monotone DNF be extended to general DNF?

More Related