7 research outputs found

    Partially Symmetric Functions are Efficiently Isomorphism-Testable

    Full text link
    Given a function f: {0,1}^n \to {0,1}, the f-isomorphism testing problem requires a randomized algorithm to distinguish functions that are identical to f up to relabeling of the input variables from functions that are far from being so. An important open question in property testing is to determine for which functions f we can test f-isomorphism with a constant number of queries. Despite much recent attention to this question, essentially only two classes of functions were known to be efficiently isomorphism testable: symmetric functions and juntas. We unify and extend these results by showing that all partially symmetric functions---functions invariant to the reordering of all but a constant number of their variables---are efficiently isomorphism-testable. This class of functions, first introduced by Shannon, includes symmetric functions, juntas, and many other functions as well. We conjecture that these functions are essentially the only functions efficiently isomorphism-testable. To prove our main result, we also show that partial symmetry is efficiently testable. In turn, to prove this result we had to revisit the junta testing problem. We provide a new proof of correctness of the nearly-optimal junta tester. Our new proof replaces the Fourier machinery of the original proof with a purely combinatorial argument that exploits the connection between sets of variables with low influence and intersecting families. Another important ingredient in our proofs is a new notion of symmetric influence. We use this measure of influence to prove that partial symmetry is efficiently testable and also to construct an efficient sample extractor for partially symmetric functions. We then combine the sample extractor with the testing-by-implicit-learning approach to complete the proof that partially symmetric functions are efficiently isomorphism-testable.Comment: 22 page

    Partially Symmetric Functions Are Efficiently Isomorphism Testable

    Get PDF
    Given a Boolean function f, the f-isomorphism testing problem requires a randomized algorithm to distinguish functions that are identical to f up to relabeling of the input variables from functions that are far from being so. An important open question in property testing is to determine for which functions f we can test f-isomorphism with a constant number of queries. Despite much recent attention to this question, essentially only two classes of functions were known to be efficiently isomorphism testable: symmetric functions and juntas. We unify and extend these results by showing that all partially symmetric functions---functions invariant to the reordering of all but a constant number of their variables---are efficiently isomorphism testable. This class of functions, first introduced by Shannon, includes symmetric functions, juntas, and many other functions as well. We conjecture that these functions are essentially the only functions efficiently isomorphism-testable. To prove our main result, we also show that partial symmetry is efficiently testable. In turn, to prove this result we had to revisit the junta testing problem. We provide a new proof of correctness of the nearly optimal junta tester. Our new proof replaces the Fourier machinery of the original proof with a purely combinatorial argument that exploits the connection between sets of variables with low influence and intersecting families. Another important ingredient in our proofs is a new notion of symmetric influence. We use this measure of influence to prove that partial symmetry is efficiently testable and also to construct an efficient sample extractor for partially symmetric functions. We then combine the sample extractor with the testing-by-implicit-learning approach to complete the proof that partially symmetric functions are efficiently isomorphism testable.Simons Foundation (Postdoctoral Fellowship

    On active and passive testing

    Full text link
    Given a property of Boolean functions, what is the minimum number of queries required to determine with high probability if an input function satisfies this property or is "far" from satisfying it? This is a fundamental question in Property Testing, where traditionally the testing algorithm is allowed to pick its queries among the entire set of inputs. Balcan, Blais, Blum and Yang have recently suggested to restrict the tester to take its queries from a smaller random subset of polynomial size of the inputs. This model is called active testing, and in the extreme case when the size of the set we can query from is exactly the number of queries performed it is known as passive testing. We prove that passive or active testing of k-linear functions (that is, sums of k variables among n over Z_2) requires Theta(k*log n) queries, assuming k is not too large. This extends the case k=1, (that is, dictator functions), analyzed by Balcan et. al. We also consider other classes of functions including low degree polynomials, juntas, and partially symmetric functions. Our methods combine algebraic, combinatorial, and probabilistic techniques, including the Talagrand concentration inequality and the Erdos--Rado theorem on Delta-systems.Comment: 16 page

    A Characterization of Locally Testable Affine-Invariant Properties via Decomposition Theorems

    Full text link
    Let P\mathcal{P} be a property of function Fpn→{0,1}\mathbb{F}_p^n \to \{0,1\} for a fixed prime pp. An algorithm is called a tester for P\mathcal{P} if, given a query access to the input function ff, with high probability, it accepts when ff satisfies P\mathcal{P} and rejects when ff is "far" from satisfying P\mathcal{P}. In this paper, we give a characterization of affine-invariant properties that are (two-sided error) testable with a constant number of queries. The characterization is stated in terms of decomposition theorems, which roughly claim that any function can be decomposed into a structured part that is a function of a constant number of polynomials, and a pseudo-random part whose Gowers norm is small. We first give an algorithm that tests whether the structured part of the input function has a specific form. Then we show that an affine-invariant property is testable with a constant number of queries if and only if it can be reduced to the problem of testing whether the structured part of the input function is close to one of a constant number of candidates.Comment: 27 pages, appearing in STOC 2014. arXiv admin note: text overlap with arXiv:1306.0649, arXiv:1212.3849 by other author

    Testing Submodularity

    Get PDF
    We show that for any constants ϵ>0\epsilon > 0 and p≥1p \ge 1, given oracle access to an unknown function f:{0,1}n→[0,1]f : \{0,1\}^n \to [0,1] it is possible to determine if the function is submodular or is ϵ\epsilon-far from every submodular function, in ℓp\ell_p distance, with a \emph{constant} number of queries to the oracle. We refer to the process of determining if an unknown function has a property, or is far from every function having the property, as \emph{property testing}, and we refer to the algorithm that does that as a tester or a testing algorithm. A function f:{0,1}n→[0,1]f : \{0,1\}^n \to [0,1] is a \emph{kk-junta} if there is a set J⊆[n]J \subseteq [n] of cardinality ∣J∣≤k|J| \le k such that the value of ff on any input xx is completely determined by the values xix_i for i∈Ji \in J. For any constant ϵ>0\epsilon > 0 and a set of kk-juntas F\mathcal{F}, we give an algorithm which determines if an unknown function f:{0,1}n→[0,1]f : \{0,1\}^n \to [0,1] is ϵ106\frac{\epsilon}{10^6}-close to some function in F\mathcal{F} or is ϵ\epsilon-far from every function in F\mathcal{F}, in ℓ2\ell_2 distance, with a constant number of queries to the unknown function. This result, combined with a recent junta theorem of Feldman and \Vondrak (2016) in which they show every submodular function is ϵ\epsilon-close, in ℓ2\ell_2 distance, to another submodular function which is a O~(1ϵ2)\tilde{O}(\frac{1}{\epsilon^2})-junta, yields the constant-query testing algorithm for submodular functions. We also give constant-query testing algorithms for a variety of other natural properties of valuation functions, including fractionally additive (XOS) functions, OXS functions, unit demand functions, coverage functions, and self-bounding functions
    corecore