Privately releasing conjunctions and the statistical query barrier
暂无分享,去创建一个
Aaron Roth | Anupam Gupta | Jonathan Ullman | Moritz Hardt | Anupam Gupta | Aaron Roth | Jonathan Ullman | Moritz Hardt
[1] Jon Kleinberg,et al. Maximizing the spread of influence through a social network , 2003, KDD '03.
[2] S. Boucheron,et al. On concentration of self-bounding functions , 2009 .
[3] Cynthia Dwork,et al. Calibrating Noise to Sensitivity in Private Data Analysis , 2006, TCC.
[4] Moni Naor,et al. On the complexity of differentially private data release: efficient algorithms and hardness results , 2009, STOC '09.
[5] Aaron Roth,et al. A learning theory approach to noninteractive database privacy , 2011, JACM.
[6] S. Boucheron,et al. A sharp concentration inequality with applications , 1999, Random Struct. Algorithms.
[7] Lisa Fleischer,et al. Submodular Approximation: Sampling-based Algorithms and Lower Bounds , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[8] Guy N. Rothblum,et al. A Multiplicative Weights Mechanism for Privacy-Preserving Data Analysis , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[9] Michael Kearns,et al. Efficient noise-tolerant learning from statistical queries , 1993, STOC.
[10] Kunal Talwar,et al. On the geometry of differential privacy , 2009, STOC '10.
[11] Manfred K. Warmuth,et al. The Weighted Majority Algorithm , 1994, Inf. Comput..
[12] Maria-Florina Balcan,et al. Learning submodular functions , 2010, STOC '11.
[13] Cynthia Dwork,et al. Practical privacy: the SuLQ framework , 2005, PODS.
[14] Sanjeev Arora,et al. The Multiplicative Weights Update Method: a Meta-Algorithm and Applications , 2012, Theory Comput..
[15] Cynthia Dwork,et al. Privacy, accuracy, and consistency too: a holistic solution to contingency table release , 2007, PODS.
[16] Irit Dinur,et al. Revealing information while preserving privacy , 2003, PODS.
[17] Vitaly Feldman,et al. A Complete Characterization of Statistical Query Learning with Applications to Evolvability , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[18] Alessandro Panconesi,et al. Concentration of Measure for the Analysis of Randomized Algorithms , 2009 .
[19] Rebecca N. Wright,et al. A Practical Differentially Private Random Decision Tree Classifier , 2009, 2009 IEEE International Conference on Data Mining Workshops.
[20] Tim Roughgarden,et al. Interactive privacy via the median mechanism , 2009, STOC '10.
[21] Yishay Mansour,et al. Weakly learning DNF and characterizing statistical query learning using Fourier analysis , 1994, STOC '94.
[22] Sofya Raskhodnikova,et al. What Can We Learn Privately? , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[23] Anindya De,et al. Lower Bounds in Differential Privacy , 2011, TCC.
[24] Adam D. Smith,et al. The price of privately releasing contingency tables and the spectra of random matrices with correlated rows , 2010, STOC '10.
[25] Vahab S. Mirrokni,et al. Approximating submodular functions everywhere , 2009, SODA.
[26] Andreas Krause,et al. Near-optimal Observation Selection using Submodular Functions , 2007, AAAI.
[27] Jan Vondrák,et al. A note on concentration of submodular functions , 2010, ArXiv.