Submodular functions are noise stable

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2012, Pages 1586-1592

  Cheraghchi, Mahdi ^a   Klivans, Adam ^b   Kothari, Pravesh ^b   Lee, Homin K ^b  

^a Carnegie Mellon University   (United States)

^b University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

ACCURACY PARAMETERS; AGNOSTIC SETTING; AVERAGE ERRORS; NON NEGATIVES; POLYNOMIAL-TIME; PRODUCT DISTRIBUTIONS; SIMPLE ALGORITHM; SUBMODULAR FUNCTIONS;

LEARNING ALGORITHMS;

EID: 84860183429     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973099.126     Document Type: Conference Paper

References (28)

1. Raghu Bahadur. A representation of the joint distribution of responses to n dichotomous items. In Studies in Item Analysis and Prediction, pages 158-168. Stanford University Press, 1961.
2. Maria-Fiorina Balcan and Nicholas J. A. Harvey. Learning submodular functions. In Proc. 43rd Annual ACM Symposium on Theory of Computing (STOC). ACM Press, 2011.
3. Itai Benjamini, Gil Kalai, and Oded Schramm. Noise sensitivity of boolean functions and applications to percolation. Publications Mathématiques de l'I.H.E.S., 90:5-43, 1999.
4. Avrim Blum, Cynthia Dwork, Frank Mcsherry, and Kobbi Nissim. Practical privacy: The sulq framework. In Proceedings of the Twenty-fourth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), pages 128-138. ACM Press, 2005.
5. Shahar Dobzinski, Noam Nisan, and Michael Schapira. Truthful randomized mechanisms for combinatorial auctions. In Proc. 38th Annual ACM Symposium on Theory of Computing (STOC), pages 644-652. ACM Press, 2006.
6. Cynthia Dwork, Frank McSherry, Kobbi Nissim, and Adam Smith. Calibrating noise to sensitivity in private data analysis. In Proc. 3rd Theory of Cryptography Conference (TCC), Lecture Notes in Computer Science. Springer-Verlag, 2006.
7. Jack Edmonds. Matroids and the greedy algorithm. Mathematical Programming, 1(1): 127-136, 1971.
8. Uriel Feige, Vahab S. Mirrokni, and Jan Vondrák. Maximizing non-monotone submodular functions. In Proc. 48th IEEE Symposium on Foundations of Computer Science (FOCS), pages 461-471. IEEE Computer Society Press, 2007.
9. Marshall L. Fischer, George L. Nemhauser, and Laurence A. Wolsey. An analysis of approximations for maximizing submodular set functions II. Mathematical Programming Studies, 8:73-87, 1978.
10. 0 functions. In Proc. of the 4th Annual Conference on Computational Learning Theory (COLT), Lecture Notes in Computer Science, pages 317-325. Springer-Verlag, 1991.
11. Anupam Gupta, Moritz Hardt, Aaron Roth, and Jonathan Ullman. Privately releasing conjunctions and the statistical query barrier. In Proc. 43rd Annual ACM Symposium on Theory of Computing (STOC). ACM Press, 2011.
12. Johan Håstad. Some optimal inapproximability results. Journal of the ACM, 48(4):798-859, 2001. Prelim. ver. in Proc. of STOC'97.
13. Jeff Kahn, Gil Kalai, and Nathan Linial. The influence of variables on Boolean functions. In Proc. 29th IEEE Symposium on Foundations of Computer Science (FOCS), pages 68-80. IEEE Computer Society Press, 1988.
14. Adam Kalai. Personal communication, 2011.
15. Adam Kalai, Adam Klivans, Yishay Mansour, and Rocco A. Servedio. Learning intersections and thresholds of halfspaces. SIAM Journal on Computing, 37(6): 1777-1805, 2008. Prelim. ver. in Proc. of FOCS'05.
16. Shiva Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, and Adam Smith. What can we learn privately? In Proc 49th IEEE Symposium on Foundations of Computer Science (FOCS), 2008.
17. Michael J. Kearns. Efficient noise-tolerant learning from statistical queries. Journal of the ACM, 45(6):983-1006, 1998. Prelim. ver. in Proc. of STOC'93.
18. Michael J. Kearns, Robert E. Schapire, and Linda M. Sellie. Toward efficient agnostic learning. Machine Learning, 17:115-141, 1994. Prelim. ver. in Proc. of COLT'92.
19. Adam Klivans, Ryan O'Donnell, and Rocco A. Servedio. Learning intersections and thresholds of halfspaces. Journal of Computer and System Sciences, 68(4):808-840, 2004. Prelim, ver. in Proc. of FOCS'02.
20. Adam Klivans, Ryan O'Donnell, and Rocco A. Servedio. Learning geometric concepts via Gaussian surface area. In Proc. 49th IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society Press, 2008.
21. László Lovász. Submodular functions and convexity. In A. Bachem et al., editor, Mathematical Programming: The State of the Art, pages 235-257. Springer-Verlag, 1983.
22. Mokshay Madiman and Prasad Tetali. Information inequalities for joint distributions, with interpretations and applications. IEEE Transactions on Information Theory, 56(6):2699-2713, 2010.
23. Elchanan Mossel, Ryan O'Donnell, and Krzysztof Oleszkiewicz. Noise stability of functions with low influences: invariance and optimality. Annals of Mathematics, 171(1):295-341, 2010. Prelim. ver. in Proc. of FOCS'05.
24. Elchanan Mossel and Sebastien Roch. On the submodularity of influence in social networks. In Proc. 39th Annual ACM Symposium on Theory of Computing (STOC), pages 128-134. ACM Press, 2007.
25. G. L. Nemhauser, L. A. Wolsey, and M. L. Fischer. An analysis of approximations for maximizing submodular set functions I. Mathematical Programming, 14(1):265-294, 1978.
26. Ryan O'Donnell. Hardness amplification within NP. Journal of Computer and System Sciences, 69(1):68-94, 2004. Prelim. ver. in Proc. of STOC'02.
27. Shayan Oveis Gharan and Jan Vondrák. Submodular maximization by simulated annealing. In Proc. of the 22nd Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms (SODA), 2011.
28. Jan Vondrák. Symmetry and approximability of submodular maximization problems. In Proc. 50th IEEE Symposium on Foundations of Computer Science (FOCS), pages 651-670. IEEE Computer Society Press, 2009.