Almost tight upper bound for finding fourier coefficients of bounded pseudo-boolean functions

21st Annual Conference on Learning Theory, COLT 2008

Volumn , Issue , 2008, Pages 123-134

  Choi, Sung Soon ^a   Jung, Kyomin ^b   Kim, Jeong Han ^a  

^a Yonsei University   (South Korea)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FOURIER COEFFICIENTS; HIGH PROBABILITY; INDEPENDENT RANDOM VARIABLES; LARGE DEVIATIONS; NON-ZERO FOURIER COEFFICIENTS; PSEUDO-BOOLEAN FUNCTION; RANDOMIZED ALGORITHMS; REAL-VALUED FUNCTIONS;

ALGORITHMS; BOOLEAN FUNCTIONS; FOURIER ANALYSIS; MOLECULAR BIOLOGY; WAVEFORM ANALYSIS;

FUNCTION EVALUATION;

EID: 77951135782     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (44)

1. N. Alon and V. Asodi. Learning a hidden subgraph. In Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP 2004), pages 110-121, 2004.
2. N. Alon and V. Asodi. Learning a hidden subgraph. SIAM Journal on Discrete Mathematics, 18(4): 697-712, 2005.
3. N. Alon, R. Beigel, S. Kasif, S. Rudich, and B. Sudakov. Learning a hidden matching. In Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2002), pages 197-206, 2002.
4. N. Alon, R. Beigel, S. Kasif, S. Rudich, and B. Sudakov. Learning a hidden matching. SIAM Journal on Computing, 33(2): 487-501, 2004.
5. D. Angluin and J. Chen. Learning a hidden graph using O(log n) queries per edge. In Proceedings of the 17th Annual Conference on Learning Theory (COLT 2004), pages 210-223, 2004.
6. D. Angluin and J. Chen. Learning a hidden hypergraph. In Proceedings of the 18th Annual Conference on Learning Theory (COLT 2005), pages 561-575, 2005.
7. D. Angluin and J. Chen. Learning a hidden hypergraph. Journal of Machine Learning Research, 7: 2215-2236, 2006.
8. R. Beigel, N. Alon, M. S. Apaydin, L. Fortnow, and S. Kasif. An optimal procedure for gap closing in whole genome shotgun sequencing. In Proceedings of the Fifth Annual International Conference on Computational Molecular Biology (RECOMB 2001), pages 22-30, 2001.
9. M. Bouvel, V. Grebinski, and G. Kucherov. Combinatorial search on graphs motivated by bioinformatics applications: A brief survey. In the 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2005), pages 16-27, 2005.
10. N. H. Bshouty, J. C. Jackson, and C. Tamon. More efficient PAC-learning of DNF with membership queries under the uniform distribution. Journal of Computer and System Sciences, 68(1): 205-234, 2004.
11. N. H. Bshouty and C. Tamon. On the Fourier spectrum of monotone functions. Journal of the ACM, 43(4): 747-770, 1996.
12. D. J. Coffin and C. D. Clack. gLINC: Identifying composability using group perturbation. In Proceedings of the Genetic and Evolutionary Computation Conference, pages 1133-1140, 2006.
13. H. Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals of Mathematical Statistics, 23: 493-509, 1952.
14. S. S. Choi, K. Jung, and B. R. Moon. Lower and upper bounds for linkage discovery. IEEE Trans. on Evolutionary Computation, 2008. In press.
15. S. S. Choi and J. H. Kim. Optimal query complexity bounds for finding graphs. In Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC 2008), 2008. To appear.
16. J. S. de Bonet, C. L. Isbell, Jr., and P. Viola. MIMIC: Finding optima by estimating probability densities. In Proceedings of the Advances in Neural Information Processing Systems, volume 9, pages 424-430. The MIT Press, 1997.
17. W. Ewens. Mathematical Population Genetics. Springer Verlag, 1979.
18. I. Franklin and R. Lewontin. Is the gene the unit of selection? Genetics, 65: 707-734, 1970.
19. W. Fontana, P. Stadler, E. Bornberg-Bauer, T. Griesmacher, I. Hofacker, M. Tacker, P. Tarazona, E. Weinberger, and P. Schuster. RNA folding and combinatory landscapes. Physical Review E, 47(3): 2083-2099, 1993.
20. M. R. Garey, D. S. Johnson, and L. Stockmeyer. Some simplified NP-complete graph problems. Theoretical Computer Science, 1: 237-267, 1976.
21. V. Grebinski and G. Kucherov. Optimal reconstruction of graphs under the additive model. Algorithmica, 28: 104-124, 2000.
22. D. E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison Wesley, 1989.
23. G. R. Harik and D. E. Goldberg. Learning linkage. In Foundations of Genetic Algorithms, volume 4, pages 247-262. Morgan Kaufmann, 1997.
24. R. B. Heckendorn and D. Whitley. Predicting epistasis directly from mathematical models. Evolutionary Computation, 7(1): 69-101, 1999.
25. R. B. Heckendorn and A. H. Wright. Efficient linkage discovery by limited probing. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2003), pages 1003-1014, 2003.
26. R. B. Heckendorn and A. H. Wright. Efficient linkage discovery by limited probing. Evolutionary Computation, 12(4): 517-545, 2004.
27. J. Jackson. An efficient membership-query algorithm for learning DNF with respect to the uniform distribution. Journal of Computer and System Sciences, 55(3): 42-65, 1997.
28. S. A. Kauffman. Adaptation on rugged fitness landscapes. In D. Stein, editor, Lectures in the Sciences of Complexity, pages 527-618. Addison Wesley, 1989.
29. S. A. Kauffman. The Origins of Order: Self-Organization and Selection in Evolution. Oxford University Press, 1993.
30. S. A. Kauffman and S. Levin. Towards a general theory of adaptive walks on rugged landscapes. Journal of Theoretical Biology, 128: 11-45, 1987.
31. E. Kushilevitz and Y. Mansour. Learning decision trees using the Fourier spectrum. SIAM Journal on Computing, 22(6): 1331-1348, 1993.
32. H. Kargupta and B. Park. Gene expression and fast construction of distributed evolutionary representation. Evolutionary Computation, 9(1): 1-32, 2001.
33. R. Lewontin. The Genetic Basis of Evolutionary Change. Columbia University Press, 1974.
34. Y. Mansour. Learning Boolean functions via the Fourier transform. In V. Roychowdhury, K. Y. Siu, and A. Orlitsky, editors, Theoretical Advances in Neural Computation and Learning, pages 391-424. Kluwer Academic, 1994.
35. M. Munetomo and D. E. Goldberg. Identifying linkage groups by nonlinearity/non-monotonicity detection. In Proceedings of the Genetic and Evolutionary Computation Conference, pages 433-440, 1999.
36. H. Mühlenbein and T. Mahnig. FDA - A scalable evolutionary algorithm for the optimization of additively decomposed functions. Evolutionary Computation, 7(1): 45-68, 1999.
37. C. A. Macken and A. S. Perelson. Protein evolution on rugged landscapes. In Proceedings of the National Academic of Science, USA, volume 86, pages 6191-6195, 1989.
38. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
39. M. Pelikan and D. E. Goldberg. Hierarchical problem solving by the Bayesian optimization algorithm. In Proceedings of the Genetic and Evolutionary Computation Conference, pages 267-274, 2000.
40. M. Pelikan, D. E. Goldberg, and E. Cantú-Paz. Linkage problem, distribution estimation, and Bayesian networks. Evolutionary Computation, 8(3): 311-340, 2000.
41. L. Reyzin and N. Srivastava. Learning and verifying graphs using queries with a focus on edge counting. In Proceedings of the 18th International Conference on Algorithmic Learning Theory (ALT 2007), pages 285-297, 2007.
42. M. J. Streeter. Upper bounds on the time and space complexity of optimizing additively separable functions. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2004), pages 186-197, 2004.
43. J. L. Walsh. A closed set of orthogonal functions. American Journal of Mathematics, 55: 5-24, 1923.
44. A. C. Yao. Probabilistic computations: Toward a unified measure of complexity. In Proceedings of the 18th Annual IEEE Symposium on Foundations of Computer Science, pages 222-227, 1977.