Testing fourier dimensionality and sparsity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5555 LNCS, Issue PART 1, 2009, Pages 500-512

  Gopalan, Parikshit ^a   O'Donnell, Ryan ^b   Servedio, Rocco A ^d   Shpilka, Amir ^c   Wimmer, Karl ^b  

^a MICROSOFT RESEARCH   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^d Columbia University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EFFICIENT ALGORITHM; FOURIER; FOURIER COEFFICIENTS; FOURIER SPECTRA; IMPLICIT LEARNING; LOW-DIMENSIONAL SUBSPACE; LOWER BOUNDS; NEW RESULTS; NON-ZERO COEFFICIENTS; POLYNOMIAL FACTOR; QUERY COMPLEXITY; TECHNICAL CONTRIBUTION; TESTING ALGORITHM;

ADAPTIVE ALGORITHMS; CONTROL THEORY; FOURIER TRANSFORMS; GATES (TRANSISTOR); LEARNING ALGORITHMS; LINGUISTICS; TRANSLATION (LANGUAGES);

BOOLEAN FUNCTIONS;

EID: 70449091996     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02927-1_42     Document Type: Conference Paper

References (22)

1. Alon, N., Fischer, E., Newman, I., Shapira, A.: A combinatorial characterization of the testable graph properties: It's all about regularity. In: Proc. STOC (2006)
2. Alon, N., Kaufman, T., Krivelevich, M., Litsyn, S., Ron, D.: Testing low-degree polynomials over GF(2). In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003. LNCS, vol. 2764, pp. 188-199. Springer, Heidelberg (2003)
3. Alon, N., Shapira, A.: A characterization of the (natural) graph properties testable with onesided error. In: Proc. FOCS, pp. 429-438 (2005)
4. Alon, N., Shapira, A.: Every monotone graph property is testable. In: Proc. STOC, pp. 128-137 (2005)
5. Austin, T., Tao, T.: On the testability and repair of hereditary hypergraph properties. Random Structures and Algorithms (submitted, 2008)
6. Bellare, M., Coppersmith, D., Hastad, J., Kiwi, M., Sudan, M.: Linearity testing in characteristic two. IEEE Trans, on Information Theory 42(6), 1781-1795 (1996)
7. Bellare, M., Goldreich, O., Sudan, M.: Free bits, peps and non-approximability-towards tight results. SIAM J. Comput. 27(3), 804-915 (1998)
8. Bernasconi, A., Codenotti, B.: Spectral analysis of boolean functions as a graph eigenvalue problem. IEEE Trans. Computers 48(3), 345-351 (1999)
9. Blais, E.: Improved bounds for testing juntas. In: Goel, A., Jansen, K., Rolim, J.D.P., Ru-binfeld, R. (eds.) APPROX and RANDOM 2008. LNCS, vol. 5171, pp. 317-330. Springer, Heidelberg (2008)
10. Blum, M., Luby, M., Rubinfeld, R.: Self-testing/correcting with applications to numerical problems. J. Comp. Sys. Sci. 47, 549-595 (1993); Earlier version in STOC 1990
11. Diakonikolas, I., Lee, H., Matulef, K., Onak, K., Rubinfeld, R., Servedio, R., Wan, A.: Testing for concise representations. In: Proc. FOCS, pp. 549-558 (2007)
12. Feldman, V., Gopalan, P., Khot, S., Ponnuswami, A.: New results for learning noisy parities and halfspaces. In: Proc. FOCS, pp. 563-576 (2006)
13. Fischer, E.: The art of uninformed decisions: A primer to property testing. Bulletin of the European Association for Theoretical Computer Science 75, 97-126 (2001)
14. Fischer, E., Kindler, G., Ron, D., Safra, S., Samorodnitsky, A.: Testing juntas. J. Computer & System Sciences 68(4), 753-787 (2004)
15. Jackson, J.: An efficient membership-query algorithm for learning DNF with respect to the uniform distribution. Journal of Computer and System Sciences 55, 414-440 (1997)
16. Kaufman, T., Sudan, M.: Sparse random linear codes are locally decodable and testable. In: Proc. FOCS, pp. 590-600 (2007)
17. Kaufman, T., Sudan, M.: Algebraic property testing: the role of invariance. In: Proc. 40th Annual ACM Symposium on Theory of Computing (STOC), pp. 403-412 (2008)
18. Kushilevitz, E., Mansour, Y.: Learning decision trees using the fourier spectrum. SIAM Journal on Computing 22(6), 1331-1348 (1993)
19. Linial, N., Mansour, Y., Nisan, N.: Constant depth circuits, Fourier transform and learnability. Journal of the ACM 40(3), 607-620 (1993)
20. Matulef, K., O'Donnell, R., Rubinfeld, R., Servedio, R.: Testing halfspaces. In: Proc. SODA, pp. 256-264 (2009)
21. Parnas, M., Ron, D., Samorodnitsky, A.: Testing basic boolean formulae. SIAM J. Disc. Math. 16, 20-46 (2002)
22. th ACM Symposium on the Theory of Computing (STOC 2007), pp. 506-515 (2007)