Submodular functions are noise stable
暂无分享,去创建一个
[1] Jan Vondrák,et al. Symmetry and Approximability of Submodular Maximization Problems , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[2] Jack Edmonds,et al. Matroids and the greedy algorithm , 1971, Math. Program..
[3] Cynthia Dwork,et al. Practical privacy: the SuLQ framework , 2005, PODS.
[4] Elchanan Mossel,et al. Submodularity of Influence in Social Networks: From Local to Global , 2010, SIAM J. Comput..
[5] Nathan Linial,et al. The influence of variables on Boolean functions , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[6] Vahab Mirrokni,et al. Maximizing Non-Monotone Submodular Functions , 2007, FOCS 2007.
[7] Michael Kearns,et al. Efficient noise-tolerant learning from statistical queries , 1993, STOC.
[8] Ryan O'Donnell,et al. Noise stability of functions with low influences: Invariance and optimality , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[9] Jan Vondrák,et al. Submodular maximization by simulated annealing , 2010, SODA '11.
[10] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[11] Vahab S. Mirrokni,et al. Maximizing Non-Monotone Submodular Functions , 2011, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[12] László Lovász,et al. Submodular functions and convexity , 1982, ISMP.
[13] Sofya Raskhodnikova,et al. What Can We Learn Privately? , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[14] R. Schapire,et al. Toward efficient agnostic learning , 1992, COLT '92.
[15] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[16] I. Benjamini,et al. Noise sensitivity of Boolean functions and applications to percolation , 1998 .
[17] Rocco A. Servedio,et al. Learning intersections and thresholds of halfspaces , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[18] Maria-Florina Balcan,et al. Learning submodular functions , 2010, STOC '11.
[19] Cynthia Dwork,et al. Calibrating Noise to Sensitivity in Private Data Analysis , 2006, TCC.
[20] Mokshay M. Madiman,et al. Information Inequalities for Joint Distributions, With Interpretations and Applications , 2008, IEEE Transactions on Information Theory.
[21] Ryan O'Donnell,et al. Hardness amplification within NP , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[22] Aaron Roth,et al. Privately releasing conjunctions and the statistical query barrier , 2010, STOC '11.
[23] Ryan O'Donnell,et al. Learning Geometric Concepts via Gaussian Surface Area , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[24] Sean W. Smith,et al. Improved learning of AC0 functions , 1991, COLT '91.
[25] Noam Nisan,et al. Truthful randomized mechanisms for combinatorial auctions , 2006, STOC '06.