For an $n$-variate degree–$2$ real polynomial $p$, we prove that $E_{xsim mathcal{D}}[sgn(p(x))]$ is determined up to an additive $eps$ as long as $mathcal{D}$ is a $k$-wise independent distribution over $bits^n$ for $k = poly(1/eps)$. This gives a broad class of explicit pseudorandom generators against degree-$2$ boolean threshold functions, and answers an open question of Diakonikolas et al. (FOCS 2009).
{"title":"Bounded Independence Fools Degree-2 Threshold Functions","authors":"Ilias Diakonikolas, D. Kane, Jelani Nelson","doi":"10.1109/FOCS.2010.8","DOIUrl":"https://doi.org/10.1109/FOCS.2010.8","url":null,"abstract":"For an $n$-variate degree–$2$ real polynomial $p$, we prove that $E_{xsim mathcal{D}}[sgn(p(x))]$ is determined up to an additive $eps$ as long as $mathcal{D}$ is a $k$-wise independent distribution over $bits^n$ for $k = poly(1/eps)$. This gives a broad class of explicit pseudorandom generators against degree-$2$ boolean threshold functions, and answers an open question of Diakonikolas et al. (FOCS 2009).","PeriodicalId":228365,"journal":{"name":"2010 IEEE 51st Annual Symposium on Foundations of Computer Science","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131416168","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Bounds on Monotone Switching Networks for Directed Connectivity","authors":"Aaron Potechin","doi":"10.1145/3080520","DOIUrl":"https://doi.org/10.1145/3080520","url":null,"abstract":"We prove that any monotone switching network solving directed connectivity on $N$ vertices must have size $N^{Omega(log N)}$","PeriodicalId":228365,"journal":{"name":"2010 IEEE 51st Annual Symposium on Foundations of Computer Science","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114090559","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Arnab Bhattacharyya, Swastik Kopparty, G. Schoenebeck, M. Sudan, David Zuckerman
We consider the problem of testing if a given function $f : F_2^n right arrow F_2$ is close to any degree $d$ polynomial in $n$ variables, also known as the Reed-Muller testing problem. %The Gowers norm is based on a natural $2^{d+1}$-query test for this property. Alon et al.~cite{AKKLR} proposed and analyzed a natural $2^{d+1}$-query test for this problem. This test turned out to be intimately related to the Gowers norm. Alon et. al. showed that this test accepts every degree $d$ polynomial with probability $1$, while it rejects functions that are $Omega(1)$-far with probability $Omega(1/(d 2^{d}))$. We give an asymptotically optimal analysis of this test, and show that it rejects functions that are (even only) $Omega(2^{-d})$-far with $Omega(1)$-probability (so the rejection probability is a universal constant independent of $d$ and $n$). This implies a tight relationship between the $(d+1)^{rm{st}}$-Gowers norm of a function and its maximal correlation with degree $d$ polynomials, when the correlation is close to 1. Our proof works by induction on $n$ and yields a new analysis of even the classical Blum-Luby-Rubinfeld~cite{BLR} linearity test, for the setting of functions mapping $F_2^n$ to $F_2$. The optimality follows from a tighter analysis of counterexamples to the ``inverse conjecture for the Gowers norm'' constructed by cite{GT07, LMS}. Our result has several implications. First, it shows that the Gowers norm test is tolerant, in that it also accepts close code words. Second, it improves the parameters of an XOR lemma for polynomials given by Viola and Wigderson~cite{VW}. Third, it implies a ``query hierarchy'' result for property testing of affine-invariant properties. That is, for every function $q(n)$, it gives an affine-invariant property that is testable with $O(q(n))$-queries, but not with $o(q(n))$-queries, complementing an analogous result of cite{GKNR08} for graph properties.
我们考虑测试一个给定函数$f : F_2^n right arrow F_2$是否接近$n$变量中的任意次$d$多项式的问题，也称为Reed-Muller测试问题。 %The Gowers norm is based on a natural $2^{d+1}$-query test for this property. Alon et al.~cite{AKKLR} proposed and analyzed a natural $2^{d+1}$-query test for this problem. This test turned out to be intimately related to the Gowers norm. Alon et. al. showed that this test accepts every degree $d$ polynomial with probability $1$, while it rejects functions that are $Omega(1)$-far with probability $Omega(1/(d 2^{d}))$. We give an asymptotically optimal analysis of this test, and show that it rejects functions that are (even only) $Omega(2^{-d})$-far with $Omega(1)$-probability (so the rejection probability is a universal constant independent of $d$ and $n$). This implies a tight relationship between the $(d+1)^{rm{st}}$-Gowers norm of a function and its maximal correlation with degree $d$ polynomials, when the correlation is close to 1. Our proof works by induction on $n$ and yields a new analysis of even the classical Blum-Luby-Rubinfeld~cite{BLR} linearity test, for the setting of functions mapping $F_2^n$ to $F_2$. The optimality follows from a tighter analysis of counterexamples to the ``inverse conjecture for the Gowers norm'' constructed by cite{GT07, LMS}. Our result has several implications. First, it shows that the Gowers norm test is tolerant, in that it also accepts close code words. Second, it improves the parameters of an XOR lemma for polynomials given by Viola and Wigderson~cite{VW}. Third, it implies a ``query hierarchy'' result for property testing of affine-invariant properties. That is, for every function $q(n)$, it gives an affine-invariant property that is testable with $O(q(n))$-queries, but not with $o(q(n))$-queries, complementing an analogous result of cite{GKNR08} for graph properties.
{"title":"Optimal Testing of Reed-Muller Codes","authors":"Arnab Bhattacharyya, Swastik Kopparty, G. Schoenebeck, M. Sudan, David Zuckerman","doi":"10.1109/FOCS.2010.54","DOIUrl":"https://doi.org/10.1109/FOCS.2010.54","url":null,"abstract":"We consider the problem of testing if a given function $f : F_2^n right arrow F_2$ is close to any degree $d$ polynomial in $n$ variables, also known as the Reed-Muller testing problem. %The Gowers norm is based on a natural $2^{d+1}$-query test for this property. Alon et al.~cite{AKKLR} proposed and analyzed a natural $2^{d+1}$-query test for this problem. This test turned out to be intimately related to the Gowers norm. Alon et. al. showed that this test accepts every degree $d$ polynomial with probability $1$, while it rejects functions that are $Omega(1)$-far with probability $Omega(1/(d 2^{d}))$. We give an asymptotically optimal analysis of this test, and show that it rejects functions that are (even only) $Omega(2^{-d})$-far with $Omega(1)$-probability (so the rejection probability is a universal constant independent of $d$ and $n$). This implies a tight relationship between the $(d+1)^{rm{st}}$-Gowers norm of a function and its maximal correlation with degree $d$ polynomials, when the correlation is close to 1. Our proof works by induction on $n$ and yields a new analysis of even the classical Blum-Luby-Rubinfeld~cite{BLR} linearity test, for the setting of functions mapping $F_2^n$ to $F_2$. The optimality follows from a tighter analysis of counterexamples to the ``inverse conjecture for the Gowers norm'' constructed by cite{GT07, LMS}. Our result has several implications. First, it shows that the Gowers norm test is tolerant, in that it also accepts close code words. Second, it improves the parameters of an XOR lemma for polynomials given by Viola and Wigderson~cite{VW}. Third, it implies a ``query hierarchy'' result for property testing of affine-invariant properties. That is, for every function $q(n)$, it gives an affine-invariant property that is testable with $O(q(n))$-queries, but not with $o(q(n))$-queries, complementing an analogous result of cite{GKNR08} for graph properties.","PeriodicalId":228365,"journal":{"name":"2010 IEEE 51st Annual Symposium on Foundations of Computer Science","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124367712","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：