IF 0.6 4区 计算机科学 Q4 COMPUTER SCIENCE, THEORY & METHODS
Irit Dinur, Inbal Livni Navon
{"title":"","authors":"Irit Dinur, Inbal Livni Navon","doi":"10.4086/toc.2023.v019a003","DOIUrl":null,"url":null,"abstract":"$ \\newcommand\\f{f} \\newcommand\\pf{g} $ Given a function $\\f:[N]^k\\rightarrow[M]^k$, the Z-test is a three-query test for checking if the function $\\f$ is a direct product, i.e., if there are functions $\\pf_1,\\ldots,\\pf_k:[N]\\to[M]$ such that $\\f(x_1,\\ldots,x_k)=(\\pf_1(x_1),\\ldots,\\pf_k(x_k))$ for every input $x\\in [N]^k$. This test was introduced by Impagliazzo et. al. (SICOMP 2012), who showed that if the test passes with probability $\\epsilon > \\exp(-\\sqrt k)$ then $\\f$ is $\\Omega(\\epsilon)$ correlated to a direct product function in some precise sense. It remained an open question whether the soundness of this test can be pushed all the way down to $\\exp(-k)$ (which would be optimal). This is our main result: we show that whenever $\\f$ passes the Z test with probability $\\epsilon > \\exp(-k)$, there must be a global reason for this, namely, $\\f$ is $\\Omega(\\epsilon)$ correlated to a direct product function, in the same sense of closeness. Towards proving our result we analyze the related (two-query) V-test, and prove a “restricted global structure” theorem for it. Such theorems were also proven in previous work on direct product testing in the small soundness regime. The most recent paper, by Dinur and Steurer (CCC 2014), analyzed the V test in the exponentially small soundness regime. We strengthen their conclusion by moving from an “in expectation” statement to a stronger “concentration of measure” type of statement, which we prove using reverse hyper-contractivity. This stronger statement allows us to proceed to analyze the Z test. ------------------ A preliminary version of this paper appeared in the Proceedings of the 32nd Computational Complexity Conference (CCC'17).","PeriodicalId":55992,"journal":{"name":"Theory of Computing","volume":"83 1","pages":"0"},"PeriodicalIF":0.6000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theory of Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4086/toc.2023.v019a003","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

$ \newcommand\f{f} \newcommand\pf{g} $ Given a function $\f:[N]^k\rightarrow[M]^k$, the Z-test is a three-query test for checking if the function $\f$ is a direct product, i.e., if there are functions $\pf_1,\ldots,\pf_k:[N]\to[M]$ such that $\f(x_1,\ldots,x_k)=(\pf_1(x_1),\ldots,\pf_k(x_k))$ for every input $x\in [N]^k$. This test was introduced by Impagliazzo et. al. (SICOMP 2012), who showed that if the test passes with probability $\epsilon > \exp(-\sqrt k)$ then $\f$ is $\Omega(\epsilon)$ correlated to a direct product function in some precise sense. It remained an open question whether the soundness of this test can be pushed all the way down to $\exp(-k)$ (which would be optimal). This is our main result: we show that whenever $\f$ passes the Z test with probability $\epsilon > \exp(-k)$, there must be a global reason for this, namely, $\f$ is $\Omega(\epsilon)$ correlated to a direct product function, in the same sense of closeness. Towards proving our result we analyze the related (two-query) V-test, and prove a “restricted global structure” theorem for it. Such theorems were also proven in previous work on direct product testing in the small soundness regime. The most recent paper, by Dinur and Steurer (CCC 2014), analyzed the V test in the exponentially small soundness regime. We strengthen their conclusion by moving from an “in expectation” statement to a stronger “concentration of measure” type of statement, which we prove using reverse hyper-contractivity. This stronger statement allows us to proceed to analyze the Z test. ------------------ A preliminary version of this paper appeared in the Proceedings of the 32nd Computational Complexity Conference (CCC'17).
$ \newcommand\f{f} \newcommand\pf{g} $ 给定一个函数$\f:[N]^k\rightarrow[M]^k$, z检验是一个三查询检验,用于检查函数$\f$是否是一个直接乘积,即,是否有函数$\pf_1,\ldots,\pf_k:[N]\to[M]$使得$\f(x_1,\ldots,x_k)=(\pf_1(x_1),\ldots,\pf_k(x_k))$对于每个输入$x\in [N]^k$。Impagliazzo等人(SICOMP 2012)介绍了该测试,他们表明,如果测试以概率$\epsilon > \exp(-\sqrt k)$通过,那么$\f$在某种精确意义上与直接积函数$\Omega(\epsilon)$相关。这个测试的可靠性是否可以一直推到$\exp(-k)$(这将是最优的),这仍然是一个悬而未决的问题。这是我们的主要结果:我们表明,每当$\f$以概率$\epsilon > \exp(-k)$通过Z检验时,这一定有一个全局原因,即$\f$与直接乘积函数$\Omega(\epsilon)$相关,在相同的接近意义上。为了证明我们的结果,我们分析了相关的(双查询)v检验,并证明了它的一个“受限全局结构”定理。这些定理也证明了在以前的工作中直接产品测试在小健全制度。Dinur和Steurer (CCC 2014)的最新论文分析了指数小稳健性体系中的V检验。我们通过从一个“预期”的陈述转移到一个更强的“测度集中”类型的陈述来加强他们的结论,我们使用反向超收缩性证明了这一点。这个更强的语句允许我们继续分析Z测试。------------------本文的初步版本发表在第32届计算复杂性会议论文集(CCC'17)上。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Theory of Computing
Theory of Computing Computer Science-Computational Theory and Mathematics
CiteScore
2.60
自引率
10.00%
发文量
23
期刊介绍: "Theory of Computing" (ToC) is an online journal dedicated to the widest dissemination, free of charge, of research papers in theoretical computer science. The journal does not differ from the best existing periodicals in its commitment to and method of peer review to ensure the highest quality. The scientific content of ToC is guaranteed by a world-class editorial board.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信