Abstract
We prove that for every distribution D on n bits with Shannon entropy ≥ n − a, at most O(2da logd+1g)/γ5 of the bits Di can be predicted with advantage γ by an AC0 circuit of size g and depth D that is a function of all of the bits of D except Di. This answers a question by Meir and Wigderson, who proved a corresponding result for decision trees.
We also show that there are distributions D with entropy ≥ n − O(1) such that any subset of O(n/ log n) bits of D on can be distinguished from uniform by a circuit of depth 2 and size poly(n). This separates the notions of predictability and distinguishability in this context.
- Miklos Ajtai and Avi Wigderson. 1989. Deterministic simulation of probabilistic constant-depth circuits. Advances in Computing Research: Randomness and Computation 5 (1989), 199--223.Google Scholar
- Sandro Coretti, Yevgeniy Dodis, Siyao Guo, and John Steinberger. 2018. Random oracles and non-uniformity. In Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT’18).Google Scholar
Cross Ref
- Thomas Cover and Joy Thomas. 2006. Elements in Information Theory. Wiley Series in Telecommunications and Signal Processing. Wiley InterScience. Google Scholar
Digital Library
- Yevgeniy Dodis, Siyao Guo, and Jonathan Katz. 2017. Fixing cracks in the concrete: Random oracles with auxiliary input, revisited. In Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT’17). 473--495. DOI:http://dx.doi.org/10.1007/978-3-319-56614-6_16Google Scholar
Cross Ref
- Jeff Edmonds, Russell Impagliazzo, Steven Rudich, and Jiri Sgall. 2001. Communication complexity towards lower bounds on circuit depth. Computational Complexity 10, 3 (2001), 210--246.Google Scholar
Cross Ref
- Bill Fefferman, Ronen Shaltiel, Christopher Umans, and Emanuele Viola. 2013. On beating the hybrid argument. Theory of Computing 9 (2013), 809--843.Google Scholar
Cross Ref
- Oded Goldreich. 2001. Foundations of Cryptography: Volume 1, Basic Tools. Cambridge University Press. Google Scholar
Digital Library
- Aryeh Grinberg, Ronen Shaltiel, and Emanuele Viola. 2018. Indistinguishability by adaptive procedures with advice, and lower bounds on hardness amplification proofs. In Proceedings of the Symposium on Foundations of Computer Science (FOCS’18).Google Scholar
Cross Ref
- Johan Håstad. 2014. On the correlation of parity and small-depth circuits. SIAM Journal on Computing 43, 5 (2014), 1699--1708.Google Scholar
Cross Ref
- Wassily Hoeffding. 1963. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association 58 (1963), 13--30.Google Scholar
Cross Ref
- Or Meir and Avi Wigderson. 2017. Prediction from partial information and hindsight, with application to circuit lower bounds. Electronic Colloquium on Computational Complexity (ECCC) 24 (2017), 149. https://eccc.weizmann.ac.il/report/2017/149Google Scholar
- Ran Raz. 1998. A parallel repetition theorem. SIAM Journal on Computing 27, 3 (1998), 763--803. Google Scholar
Digital Library
- Ronen Shaltiel and Emanuele Viola. 2010. Hardness amplification proofs require majority. SIAM Journal on Computing 39, 7 (2010), 3122--3154. Google Scholar
Digital Library
- Alexander Smal and Navid Talebanfard. 2017. Prediction from partial information and hindsight, an alternative proof. Electronic Colloquium on Computational Complexity 24 (2017), 191. https://eccc.weizmann.ac.il/report/2017/191Google Scholar
- Luca Trevisan. 2004. A note on approximate counting for k-DNF. In Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques. Lecture Notes in Computer Science, Vol. 3122. Springer, 417--426.Google Scholar
- Dominique Unruh. 2007. Random oracles and auxiliary input. In Proceedings of the International Cryptology Conference (CRYPTO’07). 205--223. DOI:http://dx.doi.org/10.1007/978-3-540-74143-5_12 Google Scholar
Digital Library
- Andrew Yao. 1982. Theory and applications of trapdoor functions. In Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science (FOCS’82). IEEE, Los Alamitos, CA, 80--91. Google Scholar
Digital Library
Index Terms
AC0 Unpredictability
Recommendations
Learning and lower bounds for AC0 with threshold gates
APPROX/RANDOM'10: Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniquesIn 2002 Jackson et al. [JKS02] asked whether AC0 circuits augmented with a threshold gate at the output can be efficiently learned from uniform random examples. We answer this question affirmatively by showing that such circuits have fairly strong ...
An Isomorphism Theorem for Circuit Complexity
CCC '96: Proceedings of the 11th Annual IEEE Conference on Computational ComplexityWe show that all sets complete for NC1 under AC0 reductions are isomorphic under AC0-computable isomorphisms. Although our proof does not generalize directly to other complexity classes, we do show that, for all complexity classes C closed under NC1-...
On the AC0 Complexity of Subgraph Isomorphism
FOCS '14: Proceedings of the 2014 IEEE 55th Annual Symposium on Foundations of Computer ScienceLet P be a fixed graph (hereafter called a "pattern"), and let Subgraph(P) denote the problem of deciding whether a given graph G contains a subgraph isomorphic to P. We are interested in AC0-complexity of this problem, determined by the smallest ...






Comments