[1] M. Abadi, A. Chu, I. Goodfellow, H. B. McMahan, I. Mironov, K. Talwar, and L. Zhang. Deep learning with differential privacy. In Proceedings of the 2016 ACM SIGSAC conference on computer and communications security, pages 308-318, 2016.
[2] J. Acharya, C. L. Canonne, and H. Tyagi. Inference under information constraints II: Communication constraints and shared randomness. arXiv preprint arXiv:1905.08302, 2019.
[3] J. Acharya, C. L. Canonne, and H. Tyagi. Inference under information constraints: Lower bounds from chi-square contraction. In Conference on Learning Theory, pages 3-17. PMLR, 2019.
[4] J. Acharya, C. L. Canonne, and H. Tyagi. General lower bounds for interactive high-dimensional estimation under information constraints. arXiv preprint arXiv:2010.06562, 2020.
[5] J. Acharya and Z. Sun. Communication complexity in locally private distribution estimation and heavy hitters. In International Conference on Machine Learning, pages 51-60, 2019.
[6] J. Acharya, Z. Sun, and H. Zhang. Hadamard response: Estimating distributions privately, efficiently, and with little communication. In The 22nd International Conference on Artificial Intelligence and Statistics, pages 1120-1129, 2019.
[7] J. Acharya, Z. Sun, and H. Zhang. Differentially private Assouad, Fano, and Le Cam. In Algorithmic Learning Theory, pages 48-78. PMLR, 2021.
[8] N. Agarwal, P. Kairouz, and Z. Liu. The Skellam mechanism for differentially private federated learning. Advances in Neural Information Processing Systems, 34:5052-5064, 2021.
[9] N. Agarwal, A. T. Suresh, F. X. X. Yu, S. Kumar, and B. McMahan. cpSGD: Communication-efficient and differentially-private distributed sgd. In Advances in Neural Information Processing Systems, pages 7564-7575, 2018.
[10] D. Alistarh, D. Grubic, J. Li, R. Tomioka, and M. Vojnovic. QSGD: Communication-efficient sgd via gradient quantization and encoding. In Advances in Neural Information Processing Systems 30, pages 1709-1720, 2017.
[11] J. Allen, B. Ding, J. Kulkarni, H. Nori, O. Ohrimenko, and S. Yekhanin. An algorithmic framework for differentially private data analysis on trusted processors. Advances in Neural Information Processing Systems, 32, 2019.
[12] V. Balcer and A. Cheu. Separating local & shuffled differential privacy via histograms. arXiv preprint arXiv:1911.06879, 2019.
[13] V. Balcer and S. Vadhan. Differential privacy on finite computers. arXiv preprint arXiv:1709.05396, 2017.
[14] B. Balle, G. Barthe, and M. Gaboardi. Privacy amplification by subsampling: Tight analyses via couplings and divergences. Advances in Neural Information Processing Systems, 31, 2018.
[15] B. Balle and Y.-X. Wang. Improving the gaussian mechanism for differential privacy: Analytical calibration and optimal denoising. In International Conference on Machine Learning, pages 394-403. PMLR, 2018.
[16] L. P. Barnes, W.-N. Chen, and A. Ozgur. Fisher information under local differential privacy. arXiv preprint arXiv:2005.10783, 2020.
[17] L. P. Barnes, Y. Han, and A. Ozgur. Lower bounds for learning distributions under communication constraints via fisher information, 2019.
[18] L. P. Barnes, H. A. Inan, B. Isik, and A. Ozgur. rTop-k: A statistical estimation approach to distributed SGD, 2020.
[19] R. Bassily, K. Nissim, U. Stemmer, and A. Thakurta. Practical locally private heavy hitters. In Proceedings of the 31st International Conference on Neural Information Processing Systems, NIPS'17, page 2285-2293, Red Hook, NY, USA, 2017. Curran Associates Inc.