Preventing false discovery in interactive data analysis is hard

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2014, Pages 454-463

  Hardt, Moritz ^a   Ullman, Jonathan ^b  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

STATISTICS;

COLLABORATIVE RESEARCH; COMPUTATIONAL BARRIERS; COMPUTATIONALLY EFFICIENT; INTERACTIVE DATA ANALYSIS; PERCEIVED DIFFICULTIES; STATISTICAL QUERIES; STATISTICAL VALIDITY; UNDERLYING DISTRIBUTION;

QUERY PROCESSING;

EID: 84919969763     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2014.55     Document Type: Conference Paper

References (14)

1. C. Dwork, V. Feldman, M. Hardt, T. Pitassi, O. Reingold, and A. Roth, "Guilt-free data exploration (tentative title)," Manuscript, 2014.
2. Y. Benjamini and Y. Hochberg, "Controlling the false discovery rate: a practical and powerful approach to multiple testing," Journal of the Royal Statistical Society. Series B (Methodological), vol. 57, no. 1, pp. 289-300, 1995.
3. M. J. Kearns, "Efficient noise-tolerant learning from statistical queries," in STOC, S. R. Kosaraju, D. S. Johnson, and A. Aggarwal, Eds. ACM, 1993, pp. 392-401.
4. D. Boneh and J. Shaw, "Collusion-secure fingerprinting for digital data," IEEE Transactions on Information Theory, vol. 44, no. 5, pp. 1897-1905, 1998.
5. M. Bun, J. Ullman, and S. P. Vadhan, "Fingerprinting codes and the price of approximate differential privacy," in STOC. ACM, May 31-June 3 2014, pp. 1-10.
6. C. Dwork, F. McSherry, K. Nissim, and A. Smith, "Calibrating noise to sensitivity in private data analysis," in TCC, ser. Lecture Notes in Computer Science, S. Halevi and T. Rabin, Eds., vol. 3876. Springer, 2006, pp. 265-284.
7. J. Ullman, "Answering n2+o(1) counting queries with differential privacy is hard," in STOC, D. Boneh, T. Roughgarden, and J. Feigenbaum, Eds. ACM, 2013, pp. 361-370.
8. O. Bousquet and A. Elisseeff, "Stability and generalization," Journal of Machine Learning Research, vol. 2, pp. 499-526, 2002.
9. A. Roth and T. Roughgarden, "Interactive privacy via the median mechanism," in Proc. 42nd Symposium on Theory of Computing (STOC). ACM, 2010, pp. 765-774.
10. M. Hardt and G. Rothblum, "A multiplicative weights mechanism for privacy-preserving data analysis," in Proc. 51st Foundations of Computer Science (FOCS). IEEE, 2010.
11. B. Chor, A. Fiat, and M. Naor, "Tracing traitors," in CRYPTO, ser. Lecture Notes in Computer Science, Y. Desmedt, Ed., vol. 839. Springer, 1994, pp. 257-270.
12. C. Dwork, M. Naor, O. Reingold, G. N. Rothblum, and S. P. Vadhan, "On the complexity of differentially private data release: efficient algorithms and hardness results," in STOC. ACM, 2009, pp. 381-390.
13. M. Hardt and D. P. Woodruff, "How robust are linear sketches to adaptive inputs " in STOC, D. Boneh, T. Roughgarden, and J. Feigenbaum, Eds. ACM, 2013, pp. 121-130.
14. G. Tardos, "Optimal probabilistic fingerprint codes," J. ACM, vol. 55, no. 2, 2008.