Statistical algorithms and a lower bound for detecting planted cliques

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2013, Pages 655-664

  Feldman, Vitaly ^a   Grigorescu, Elena ^b   Reyzin, Lev ^c   Vempala, Santosh S ^d   Xiao, Ying ^d  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b Purdue University   (United States)

^c UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

^d Georgia Institute of Technology   (United States)

Author keywords

Lower bounds; Planted clique; Statistical algorithms; Statistical query

Indexed keywords

COMPUTATIONAL PROBLEM; CRYPTOGRAPHIC APPLICATIONS; LOWER BOUNDS; OPTIMAL LOWER BOUND; PLANTED CLIQUES; STATISTICAL ALGORITHM; STATISTICAL QUERIES; STATISTICAL QUERY MODELS;

ALGORITHMS; COMPUTATION THEORY; CONVEX OPTIMIZATION; HARDNESS; SIMULATED ANNEALING;

STATISTICS;

EID: 84879828520     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2488608.2488692     Document Type: Conference Paper

References (51)

1. N. Alon, A. Andoni, T. Kaufman, K. Matulef, R. Rubinfeld, and N. Xie. Testing k-wise and almost k-wise independence. In Proceedings of STOC, pages 496-505, 2007.
2. N. Alon, M. Krivelevich, and B. Sudakov. Finding a large hidden clique in a random graph. In SODA, pages 594-598, 1998.
3. B. P. W. Ames and S. A. Vavasis. Nuclear norm minimization for the planted clique and biclique problems. Math. Program., 129(1):69-89, 2011.
4. B. Applebaum, B. Barak, and A. Wigderson. Public-key cryptography from diffierent assumptions. In STOC, pages 171-180, 2010.
5. S. Arora, B. Barak, M. Brunnermeier, and R. Ge. Computational complexity and information asymmetry in financial products (extended abstract). In ICS, pages 49-65, 2010.
6. A. Belloni, R. M. Freund, and S. Vempala. An efficient rescaled perceptron algorithm for conic systems. Math. Oper. Res., 34(3):621-641, 2009.
7. A. Bhaskara, M. Charikar, E. Chlamtac, U. Feige, and A. Vijayaraghavan. Detecting high log-densities: an o(n1/4) approximation for densest k-subgraph. In STOC, pages 201-210, 2010.
8. A. Bhaskara, M. Charikar, A. Vijayaraghavan, V. Guruswami, and Y. Zhou. Polynomial integrality gaps for strong sdp relaxations of densest k-subgraph. In SODA, pages 388-405, 2012.
9. A. Blum, C. Dwork, F. McSherry, and K. Nissim. Practical privacy: the SuLQ framework. In Proceedings of PODS, pages 128-138, 2005.
10. A. Blum, A. M. Frieze, R. Kannan, and S. Vempala. A polynomial-time algorithm for learning noisy linear threshold functions. Algorithmica, 22(1/2):35-52, 1998.
11. A. Blum, M. L. Furst, J. C. Jackson, M. J. Kearns, Y. Mansour, and S. Rudich. Weakly learning dnf and characterizing statistical query learning using fourier analysis. In STOC, pages 253-262, 1994.
12. S. Brubaker and S. Vempala. Random tensors and planted cliques. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, volume 5687, pages 406-419. 2009.
13. C. Chu, S. Kim, Y. Lin, Y. Yu, G. Bradski, A. Ng, and K. Olukotun. Map-reduce for machine learning on multicore. In Proceedings of NIPS, pages 281-288, 2006.
14. A. Coja-Oghlan. Graph partitioning via adaptive spectral techniques. Combinatorics, Probability & Computing, 19(2):227-284, 2010.
15. Y. Dekel, O. Gurel-Gurevich, and Y. Peres. Finding hidden cliques in linear time with high probability. In Proceedings of ANALCO, pages 67-75, 2011.
16. A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum likelihood from incomplete data via the em algorithm. Journal of the Royal Statistical Society, Series B, 39(1):1-38, 1977.
17. J. Dunagan and S. Vempala. A simple polynomial-time rescaling algorithm for solving linear programs. Math. Program., 114(1):101-114, 2008.
18. U. Feige. Relations between average case complexity and approximation complexity. In IEEE Conference on Computational Complexity, page 5, 2002.
19. U. Feige and R. Krauthgamer. Finding and certifying a large hidden clique in a semirandom graph. Random Struct. Algorithms, 16(2):195-208, 2000.
20. U. Feige and R. Krauthgamer. The probable value of the Lovász-Schrijver relaxations for maximum independent set. SICOMP, 32(2):345-370, 2003.
21. U. Feige and D. Ron. Finding hidden cliques in linear time. In Proceedings of AofA, pages 189-204, 2010.
22. V. Feldman. A complete characterization of statistical query learning with applications to evolvability. Journal of Computer System Sciences, 78(5):1444-1459, 2012.
23. V. Feldman, E. Grigorescu, L. Reyzin, S. Vempala, and Y. Xiao. Statistical algorithms and a lower bound for detecting planted cliques. CoRR, abs/1201.1214, 2012.
24. A. M. Frieze and R. Kannan. A new approach to the planted clique problem. In FSTTCS, pages 187-198, 2008.
25. A. E. Gelfand and A. F. M. Smith. Sampling based approaches to calculating marginal densities. Journal of the American Statistical Association, 85:398-409, 1990.
26. J. Hástad. Some optimal inapproximability results. J. ACM, 48:798-859, July 2001.
27. W. K. Hastings. Monte carlo sampling methods using markov chains and their applications. Biometrika, 57(1):97-109, 1970.
28. E. Hazan and R. Krauthgamer. How hard is it to approximate the best nash equilibrium? SIAM J. Comput., 40(1):79-91, 2011.
29. J. Jackson. On the efficiency of noise-tolerant PAC algorithms derived from statistical queries. Annals of Mathematics and Artificial Intelligence, 39(3):291-313, Nov. 2003.
30. M. Jerrum. Large cliques elude the metropolis process. Random Struct. Algorithms, 3(4):347-360, 1992.
31. A. Juels and M. Peinado. Hiding cliques for cryptographic security. Des. Codes Cryptography, 20(3):269-280, 2000.
32. R. Kannan. personal communication.
33. R. Karp. Probabilistic analysis of graph-theoretic algorithms. In Proceedings of Computer Science and Statistics 12th Annual Symposium on the Interface, page 173, 1979.
34. M. Kearns. Efficient noise-tolerant learning from statistical queries. Journal of the ACM, 45(6):983-1006, 1998.
35. S. Khot. Ruling out ptas for graph min-bisection, densest subgraph and bipartite clique. In FOCS, pages 136-145, 2004.
36. S. Kirkpatrick, D. G. Jr., and M. P. Vecchi. Optimization by simmulated annealing. Science, 220(4598):671-680, 1983.
37. L. Kucera. Expected complexity of graph partitioning problems. Discrete Applied Mathematics, 57(2-3):193-212, 1995.
38. F. McSherry. Spectral partitioning of random graphs. In FOCS, pages 529-537, 2001.
39. N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller. Equations of state calculations by fast computing machines. Journal of Chemical Physics, 21:1087-1092, 1953.
40. L. Minder and D. Vilenchik. Small clique detection and approximate nash equilibria. 5687:673-685, 2009.
41. K. Pearson. On the criterion that a given system of deviations from the probable in the case of a correlated system of variables is such that it can be reasonably supposed to have arisen from random sampling. Philosophical Magazine, Series 5, 50(302):157-175, 1900.
42. B. Selman, H. Kautz, and B. Cohen. Local search strategies for satisfiability testing. In DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 521-532, 1995.
43. R. Servedio. Computational sample complexity and attribute-efficient learning. Journal of Computer and System Sciences, 60(1):161-178, 2000.
44. B. Szörényi. Characterizing statistical query learning: Simplified notions and proofs. In ALT, pages 186-200, 2009.
45. M. Tanner and W. Wong. The calculation of posterior distributions by data augmentation (with discussion). Journal of the American Statistical Association, 82:528-550, 1987.
46. L. G. Valiant. A theory of the learnable. Commun. ACM, 27(11):1134-1142, 1984.
47. V. Vapnik and A. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probab. and its Applications, 16(2):264-280, 1971.
48. V. Černý. Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm. Journal of Optimization Theory and Applications, 45(1):41-51, Jan. 1985.
49. K. Yang. On learning correlated boolean functions using statistical queries. In Proceedings of ALT, pages 59-76, 2001.
50. K. Yang. New lower bounds for statistical query learning. J. Comput. Syst. Sci., 70(4):485-509, 2005.
51. A. Yao. Probabilistic computations: Toward a unified measure of complexity. In FOCS, pages 222-227, 1977.