Fetching the paper…
Reading the bibliography…
We consider the problems of distribution estimation and heavy hitter (frequency) estimation under privacy and communication constraints.
S. L. Warner, “Randomized response: A survey technique for eliminating evasive answer bias,” Journal of the American Statistical Association , vol. 60, no. 309, pp. 63–69, 1965
1965
Earlier work this paper cites.
T. Dalenius, “Towards a methodology for statistical disclosure control,” Statistisk Tidskrift , vol. 15, pp. 429–444, 1977
1977
Earlier work this paper cites.
L. Devroye and G. Lugosi, Combinatorial Methods in Density Estimation . Springer, 2001
2001
Earlier work this paper cites.
L. Sweeney, “k-anonymity: A model for protecting privacy,” International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems , vol. 10, no. 05, pp. 557–570, 2002
2002
Earlier work this paper cites.
I. Dinur and K. Nissim, “Revealing information while preserving privacy,” in Proceedings of the 22nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems , ser. PODS ’03. New York, NY, USA: ACM, 2003, pp. 202–210
2003
Earlier work this paper cites.
C. Dwork, F. McSherry, K. Nissim, and A. Smith, “Calibrating noise to sensitivity in private data analysis,” in Proceedings of the 3rd Conference on Theory of Cryptography , ser. TCC ’06. Berlin, Heidelberg: Springer, 2006, pp. 265–284
2006
Earlier work this paper cites.
F. McSherry and K. Talwar, “Mechanism design via differential privacy,” in 48th Annual IEEE Symposium on Foundations of Computer Science . IEEE, 2007, pp. 94–103
2007
Earlier work this paper cites.
N. Homer, S. Szelinger, M. Redman, D. Duggan, W. Tembe, J. Muehling, J. V. Pearson, D. A. Stephan, S. F. Nelson, and D. W. Craig, “Resolving individuals contributing trace amounts of DNA to highly complex mixtures using high-density SNP genotyping microarrays,” PLoS Genetics , vol. 4, no. 8, pp. 1–9, 2008
2008
Earlier work this paper cites.
A. Beimel, K. Nissim, and E. Omri, “Distributed private data analysis: Simultaneously solving how and what,” in Proceedings of the 28th Annual International Cryptology Conference , ser. CRYPTO ’08. Berlin, Heidelberg: Springer, 2008, pp. 451–468
2008
Earlier work this paper cites.
L. Wasserman and S. Zhou, “A statistical framework for differential privacy,” Journal of the American Statistical Association , vol. 105, no. 489, pp. 375–389, 2010
2010
Earlier work this paper cites.
K. Chaudhuri, C. Monteleoni, and A. D. Sarwate, “Differentially private empirical risk minimization,” Journal of Machine Learning Research , vol. 12, pp. 1069–1109, 2011
2011
Earlier work this paper cites.
S. P. Kasiviswanathan, H. K. Lee, K. Nissim, S. Raskhodnikova, and A. Smith, “What can we learn privately?” SIAM Journal on Computing , vol. 40, no. 3, pp. 793–826, 2011
2011
Earlier work this paper cites.
M. J. Wainwright, M. I. Jordan, and J. C. Duchi, “Privacy aware learning,” in Advances in Neural Information Processing Systems , 2012, pp. 1430–1438
2012
Earlier work this paper cites.
J. Hsu, S. Khanna, and A. Roth, “Distributed private heavy hitters,” in International Colloquium on Automata, Languages, and Programming . Springer, 2012, pp. 461–472
2012
Earlier work this paper cites.
A. Blum, K. Ligett, and A. Roth, “A learning theory approach to noninteractive database privacy,” Journal of the ACM (JACM) , vol. 60, no. 2, p. 12, 2013
2013
Cited alongside, same era.
J. C. Duchi, M. I. Jordan, and M. J. Wainwright, “Local privacy and statistical minimax rates,” in Proceedings of the 54st Annual IEEE Symposium on Foundations of Computer Science , ser. FOCS ’13. IEEE, 2013, pp. 429–438
2013
Cited alongside, same era.
J. Duchi, M. J. Wainwright, and M. I. Jordan, “Local privacy and minimax bounds: Sharp rates for probability estimation,” in Advances in Neural Information Processing Systems , 2013, pp. 1529–1537
2013
Cited alongside, same era.
C. Dwork and A. Roth, “The algorithmic foundations of differential privacy,” Foundations and Trends® in Theoretical Computer Science , vol. 9, no. 3–4, pp. 211–407, 2014
2014
Cited alongside, same era.
I. Diakonikolas, E. Grigorescu, J. Li, A. Natarajan, K. Onak, and L. Schmidt, “Communication-efficient distributed learning of discrete distributions,” in Advances in Neural Information Processing Systems 30 , I. Guyon, U. V. Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett, Eds. Curran Associates, Inc., 2017, pp. 6394–6404
2017
Later among the works it cites.
A. Smith, A. Thakurta, and J. Upadhyay, “Is interaction necessary for distributed private learning?” in Security and Privacy (SP), 2017 IEEE Symposium on . IEEE, 2017, pp. 58–77
2017
Later among the works it cites.
R. Bassily, K. Nissim, U. Stemmer, and A. G. Thakurta, “Practical locally private heavy hitters,” in Advances in Neural Information Processing Systems , 2017, pp. 2285–2293
2017
Later among the works it cites.
O. Sheffet, “Differentially private ordinary least squares,” in Proceedings of the 34th International Conference on Machine Learning , ser. ICML ’17. JMLR, Inc., 2017, pp. 3105–3114
2017
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Ú. Erlingsson, V. Pihur, and A. Korolova, “RAPPOR: Randomized aggregatable privacy-preserving ordinal response,” in Proceedings of the 2014 ACM Conference on Computer and Communications Security , ser. CCS ’14. New York, NY, USA: ACM, 2014, pp. 1054–1067
2014
Cited alongside, same era.
R. Bassily and A. Smith, “Local, private, efficient protocols for succinct histograms,” in Proceedings of the 47th Annual ACM Symposium on Theory of Computing . ACM, 2015, pp. 127–135
2015
Cited alongside, same era.
P. Rigollet, “Lecture notes. 18.s997: High dimensional statistics,” MIT Courses/Mathematics, 2015. https://ocw.mit.edu/courses/mathematics/18-s997-high-dimensional-statistics-spring-2015 , 2015
2015
Cited alongside, same era.
M. Braverman, A. Garg, T. Ma, H. L. Nguyen, and D. P. Woodruff, “Communication lower bounds for statistical estimation problems via a distributed data processing inequality,” in Proceedings of the 48th Annual ACM Symposium on Theory of Computing . ACM, 2016, pp. 1011–1020
2016
Cited alongside, same era.
Z. Qin, Y. Yang, T. Yu, I. Khalil, X. Xiao, and K. Ren, “Heavy hitter estimation over set-valued data with local differential privacy,” in Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security . ACM, 2016, pp. 192–203
2016
Cited alongside, same era.
2016
Cited alongside, same era.
P. Kairouz, K. Bonawitz, and D. Ramage, “Discrete distribution estimation under local privacy,” in Proceedings of the 33rd International Conference on International Conference on Machine Learning - Volume 48 , ser. ICML’16, 2016, pp. 2436–2444
2016
Cited alongside, same era.
P. Kairouz, S. Oh, and P. Viswanath, “The composition theorem for differential privacy,” IEEE Transactions on Information Theory , vol. 63, no. 6, pp. 4037–4049, 2017
2017
Cited alongside, same era.
Later among the works it cites.
Y. Dagan and O. Shamir, “Detecting correlations with little memory and communication,” in Proceedings of the 31st Conference On Learning Theory , ser. Proceedings of Machine Learning Research, S. Bubeck, V. Perchet, and P. Rigollet, Eds., vol. 75. PMLR, 06–09 Jul 2018, pp. 1145–1198. [Online]. Available: http://proceedings.mlr.press/v75/dagan18a.html
2018
Later among the works it cites.
Y. Han, A. Özgür, and T. Weissman, “Geometric lower bounds for distributed parameter estimation under communication constraints,” ser. Proceedings of Machine Learning Research, vol. 75. PMLR, 2018, pp. 3163–3188
2018
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
M. Ye and A. Barg, “Optimal schemes for discrete distribution estimation under locally differential privacy,” IEEE Transactions on Information Theory , vol. 64, pp. 5662–5676, 2018
2018
Later among the works it cites.
M. Bun, J. Nelson, and U. Stemmer, “Heavy hitters and the structure of local privacy,” in Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems . ACM, 2018, pp. 435–447
2018
Later among the works it cites.
M. Gaboardi and R. Rogers, “Local private hypothesis testing: Chi-square tests,” in International Conference on Machine Learning , 2018, pp. 1612–1621
2018
Later among the works it cites.
J. Acharya, Z. Sun, and H. Zhang, “Hadamard response: Estimating distributions privately, efficiently, and with little communication,” in Proceedings of Machine Learning Research , ser. Proceedings of Machine Learning Research, K. Chaudhuri and M. Sugiyama, Eds., vol. 89. PMLR, 16–18 Apr 2019, pp. 1120–1129
2019
Closest in time.
R. Bassily, “Linear queries estimation with local differential privacy,” in Proceedings of Machine Learning Research , ser. Proceedings of Machine Learning Research, K. Chaudhuri and M. Sugiyama, Eds., vol. 89. PMLR, 16–18 Apr 2019, pp. 721–729
2019
Closest in time.
J. Acharya, C. L. Canonne, C. Freitag, and H. Tyagi, “Test without trust: Optimal locally private distribution testing,” in Artificial Intelligence and Statistics , 2019
2019
Closest in time.