Learning Boolean Functions via the Fourier Transform
The importance of using the “right” representation of a function in order to “approximate” it has been widely recognized. The Fourier Transform representation of a function is a classic representation which is widely used to approximate real functions (i.e. functions whose inputs are real numbers). However, the Fourier Transform representation for functions whose inputs are boolean has been far less studied. On the other hand it seems that the Fourier Transform representation can be used to learn many classes of boolean functions.
Unable to display preview. Download preview PDF.
- [AM91]William Aiello and Milena Mihail. Learning the fourier spectrum of probabilistic lists and trees. In Proceedings SODA 91, pages 291–299. ACM, Jan 1991.Google Scholar
- [Bel92]Mihir Bellare. A technique for upper bounding the spectral norm with applications to learning. In 5th Annual Workshop on Computational Learning Theory, pages 62–70, July 1992.Google Scholar
- [BS90]J. Bruck and R. Smolensky. Polynomial threshold functions, AC° functions and spectral norms. In 31th Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, pages 632–641, October 1990.Google Scholar
- [FJS91]Merrick L. Furst, Jeffrey C. Jackson, and Sean W. Smith. Improved learning of AC° functions. In 4th Annual Workshop on Computational Learning Theory, pages 317–325, August 1991.Google Scholar
- [GL89]O. Goldreich and L. Levin. A hard-core predicate for all one-way functions. In Proc. 21st ACM Symposium on Theory of Computing, pages 25–32. ACM, 1989.Google Scholar
- [Has86]J. Hastad. Computational limitations for small depth circuits. MIT Press, 1986. Ph.D. thesis.Google Scholar
- [Kha93]Michael Kharitonov. Cryptographic hardness of distribution-specific learning. In Proceedings of STOC’ 93, pages 372–381. ACM, 1993.Google Scholar
- [KKL88]J. Kahn, G. Kalai, and N. Linial. The influence of variables on boolean functions. In 29 th Annual Symposium on Foundations of Computer Science, White Plains, New York, pages 68–80, October 1988.Google Scholar
- [KM91]E. Kushilevitz and Y. Mansour. Learning decision trees using the fourier spectrum. In Proceedings of the 23 rd Annual ACM Symposium on Theory of Computing, pages 455–464, May 1991. (To appear in Siam J. on ComputingGoogle Scholar
- [LMN89]N. Linial, Y. Mansour, and N. Nisan. Constant depth circuits, Fourier Transform and learnability. In 30 th Annual Symposium on Foundations of Computer Science, Research Triangle Park, NC, pages 574–579, October 1989.Google Scholar
- [Man92]Yishay Mansour. An O(n log n) learning algorithm for DNF under the uniform distribution. In Workshop on Computational Learning Theory, pages 53–61, July 1992.Google Scholar
- [Riv87]Ronald L. Rivest. Learning decision lists. Machine Learning, 2(3):229–246, 1987.Google Scholar
- [Yao85]A. C. Yao. Separating the polynomial-time hierarchy by oracles. In 26th Annual Symposium on Foundations of Computer Science, Portland, Oregon, pages 1–10, October 1985.Google Scholar