[20] Yanjun Han, Ayfer Özgür, and Tsachy Weissman. Geometric Lower Bounds for Distributed Parameter Estimation under Communication Constraints. ArXiv e-prints, abs/1802.08417v1, February 2018. First version (https://arxiv.org/abs/1802.08417v1).
[21] Yanjun Han, Ayfer Ozgur, and Tsachy Weissman. Geometric lower bounds for distributed parameter estimation under communication constraints. IEEE Transactions on Information Theory, 67(12), 2021.
[22] T. S. Jayram. Hellinger strikes back: a note on the multi-party information complexity of AND. In Approximation, randomization, and combinatorial optimization, volume 5687 of Lecture Notes in Comput. Sci., pages 562-573. Springer, Berlin, 2009. doi: 10.1007/978-3-642-03685-9_42. URL https://doi.org/10.1007/978-3-642-03685-9_42.
[23] Matthew Joseph, Janardhan Kulkarni, Jieming Mao, and Steven Z. Wu. Locally private gaussian estimation. In H. Wallach, H. Larochelle, A. Beygelzimer, F. d'Alché-Buc, E. Fox, and R. Garnett, editors, Advances in Neural Information Processing Systems 32, pages 2984-2993. Curran Associates, Inc., 2019.
[24] Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, and Adam Smith. What can we learn privately? SIAM J. Comput., 40(3):793-826, 2011. ISSN 0097-5397.
[25] Septimia Sarbu and Abdellatif Zaidi. On learning parametric distributions from quantized samples. In Proceedings of the 2021 IEEE International Symposium on Information Theory (ISIT'21), June 2021.
[26] Ohad Shamir. Fundamental limits of online and distributed algorithms for statistical learning and estimation. In Advances in Neural Information Processing Systems 27, pages 163-171, 2014.
[27] Ramon van Handel. Probability in High Dimensions. December 2016. URL https://web.math.princeton.edu/~rvan/APC550.pdf.
[28] Martin J. Wainwright. Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting. IEEE Trans. Inform. Theory, 55(12):5728-5741, 2009. ISSN 0018-9448. doi: 10.1109/TIT.2009.2032816. URL https://doi.org/10.1109/TIT.2009.2032816.
[29] Stanley L. Warner. Randomized response: A survey technique for eliminating evasive answer bias. Journal of the American Statistical Association, 60(309):63-69, 1965. doi: 10.1080/01621459.1965.10480775.
[30] Yihong Wu. Lecture notes on: Information-theoretic methods for high-dimensional statistics, 2020. URL http://www.stat.yale.edu/\~yw562/teaching/it-stats.pdf.
[31] Aolin Xu and Maxim Raginsky. Information-theoretic lower bounds on Bayes risk in decentralized estimation. IEEE Transactions on Information Theory, 63(3):1580-1600, 2017.
[32] Min Ye and Alexander Barg. Optimal schemes for discrete distribution estimation under locally differential privacy. IEEE Trans. Inform. Theory, 64(8):5662-5676, 2018. ISSN 0018-9448. doi: 10.1109/TIT.2018.2809790. URL https://doi.org/10.1109/TIT.2018.2809790.
[33] Bin Yu. Assouad, Fano, and Le Cam. In Festschrift for Lucien Le Cam, pages 423-435. Springer, 1997. doi: 10.1007/978-1-4612-1880-7_29. URL http://dx.doi.org/10.1007/978-1-4612-1880-7_29.
[34] Yuchen Zhang, John Duchi, Michael I. Jordan, and Martin J. Wainwright. Information-theoretic lower bounds for distributed statistical estimation with communication constraints. In Advances in Neural Information Processing Systems 26, pages 2328-2336, 2013.