On the Fourier spectrum of symmetric Boolean functions
- 73 Downloads
We study the following question
What is the smallest t such that every symmetric boolean function on κ variables (which is not a constant or a parity function), has a non-zero Fourier coefficient of order at least 1 and at most t?
We exclude the constant functions for which there is no such t and the parity functions for which t has to be κ. Let τ (κ) be the smallest such t. Our main result is that for large κ, τ (κ)≤4κ/logκ.
The motivation for our work is to understand the complexity of learning symmetric juntas. A κ-junta is a boolean function of n variables that depends only on an unknown subset of κ variables. A symmetric κ-junta is a junta that is symmetric in the variables it depends on. Our result implies an algorithm to learn the class of symmetric κ-juntas, in the uniform PAC learning model, in time n o(κ) . This improves on a result of Mossel, O’Donnell and Servedio in , who show that symmetric κ-juntas can be learned in time n 2κ/3.
Mathematics Subject Classification (2000)42B05 68Q32
Unable to display preview. Download preview PDF.
- N. Alon, A. Andoni, T. Kaufman, K. Matulef, R. Rubinfeld and N. Xie: Testing κ-wise and almost κ-wise independence, in: STOC, pages 496–505, 2007.Google Scholar
- A. Bernasconi: Mathematical Techniques for the Analysis of Boolean Functions, PhD thesis, Università degli Studi di Pisa, Dipartimento de Informatica, 1998.Google Scholar
- A. Blum: Relevant examples and relevant features: Thoughts from computational learning theory; in: AAAI Symposium on Relevance, 1994.Google Scholar
- A. Blum: Open problems, COLT, 2003.Google Scholar
- A. Blum, M. Furst, M. Kearns and R. J. Lipton: Cryptographic primitives based on hard learning problems, in: CRYPTO, pages 278–291, 1993.Google Scholar
- N. Bshouty, J. Jackson and C. Tamon: More efficient PAC learning of DNF with membership queries under the uniform distribution, in: Annual Conference on Computational Learning Theory, pages 286–295, 1999.Google Scholar
- P. Cameron: Combinatorics: topics, techniques, algorithms; Cambridge University Press, 1994.Google Scholar
- M. Kolountzakis, E. Markakis and A. Mehta: Learning symmetric juntas in time n o(κ), in: Proceedings of the conference Interface entre l’analyse harmonique et la theorie des nombres, CIRM, Luminy, 2005.Google Scholar
- A. Kumchev: The distribution of prime numbers, manuscript, 2005.Google Scholar
- R. Lipton, E. Markakis, A. Mehta and N. Vishnoi: On the fourier spectrum of symmetric boolean functions with applications to learning symmetric juntas, in: IEEE Conference on Computational Complexity (CCC), pages 112–119, 2005.Google Scholar
- E. Mossel, R. O’Donnell and R. Servedio: Learning juntas, in: STOC, pages 206-212, 2003.Google Scholar
- G. Pólya and G. Szegő: Problems and theorems in Analysis, II; Springer, 1976.Google Scholar
- K. Verbeurgt: Learning DNF under the uniform distribution in quasi-polynomial time, in: Annual Workshop on Computational Learning Theory, pages 314–326, 1990.Google Scholar
- K. Verbeurgt: Learning sub-classes of monotone DNF on the uniform distribution, in: Algorithmic Learning Theory, 9th International Conference (Michael M. Richter, Carl H. Smith, Rolf Wiehagen, and Thomas Zeugmann, editors), pages 385–399, 1998.Google Scholar