Fetching the paper…
Reading the bibliography…
Multiple players are each given one independent sample, about which they can only provide limited information to a central referee.
H. Hotelling, “The consistency and ultimate distribution of optimum statistics,” Transactions of the American Mathematical Society , vol. 32, no. 4, pp. 847–859, October 1930
1930
Earlier work this paper cites.
H. B. Mann and A. Wald, “On the choice of the number of class intervals in the application of the chi square test,” The Annals of Mathematical Statistics , vol. 13, pp. 306–317, 1942
1942
Earlier work this paper cites.
S. Szarek, “On the best constants in the khinchin inequality,” Studia Mathematica , vol. 58, no. 2, pp. 197–208, 1976
1976
Earlier work this paper cites.
Y. I. Medvedev, “Separable statistics in a polynomial scheme. I,” Theory of Probability and Its Applications , vol. 22, pp. 1–15, 1977
1977
Earlier work this paper cites.
R. Ahlswede and I. Csiszár, “Hypothesis testing with communication constraints,” IEEE Transactions on Information Theory , vol. 32, no. 4, pp. 533–542, July 1986
1986
Earlier work this paper cites.
Y. I. Ingster, “A minimax test of nonparametric hypotheses on the density of a distribution in L p L_{p} metrics,” Teor. Veroyatnost. i Primenen. , vol. 31, no. 2, pp. 384–389, 1986
1986
Earlier work this paper cites.
T. S. Han, “Hypothesis testing with multiterminal data compression,” IEEE Transactions on Information Theory , vol. 33, no. 6, pp. 759–772, November 1987
1987
Earlier work this paper cites.
A. R. Barron, “Uniformly powerful goodness of fit tests,” The Annals of Mathematical Statistics , vol. 17, pp. 107–124, 1989
1989
Earlier work this paper cites.
J. N. Tsitsiklis, “Decentralized detection,” in Advances in Statistical Signal Processing , H. V. Poor and J. B. Thomas, Eds., vol. 2. JAI Press, 1993, pp. 297–344
1993
Earlier work this paper cites.
R. Viswanathan and P. Varshney, “Distributed detection with multiple sensors: Part I – Fundamentals,” Proceedings of IEEE , vol. 85, no. 1, pp. 54–63, January 1997
1997
Earlier work this paper cites.
B. Yu, “Assouad, Fano, and Le Cam,” in Festschrift for Lucien Le Cam . Springer, 1997, pp. 423–435. [Online]. Available: http://dx.doi.org/10.1007/978-1-4612-1880-7_29
1997
Earlier work this paper cites.
T. S. Han and S.-I. Amari, “Statistical inference under multiterminal data compression,” IEEE Transactions on Information Theory , vol. 44, no. 6, pp. 2300–2324, October 1998
1998
Earlier work this paper cites.
D. Pollard, “Asymptopia,” 2003, manuscript. [Online]. Available: http://www.stat.yale.edu/~pollard/Books/Asymptopia/
2003
Earlier work this paper cites.
T. M. Cover and J. A. Thomas, Elements of information theory , 2nd ed. Wiley-Interscience [John Wiley & Sons], Hoboken, NJ, 2006
2006
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.
C. Dwork, “Differential privacy: A survey of results,” in Theory and Applications of Models of Computation . Springer, 2008, vol. 4978, pp. 1–19
2008
Earlier work this paper cites.
S. P. Kasiviswanathan, H. K. Lee, K. Nissim, S. Raskhodnikova, and A. Smith, “What can we learn privately?” in 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008 . IEEE, Oct 25–28 2008, pp. 531–540
2008
Earlier work this paper cites.
L. Paninski, “A coincidence-based test for uniformity given very sparsely sampled discrete data,” IEEE Transactions on Information Theory , vol. 54, no. 10, pp. 4750–4755, 2008
2008
Earlier work this paper cites.
I. Csiszár and J. Körner, Information theory: Coding theorems for discrete memoryless channels. 2nd edition . Cambridge University Press, 2011
2011
Earlier work this paper cites.
R. Rubinfeld, “Taming big probability distributions,” XRDS: Crossroads, The ACM Magazine for Students , vol. 19, no. 1, p. 24, sep 2012. [Online]. Available: http://dx.doi.org/10.1145/2331042.2331052
2012
Earlier work this paper cites.
S. Boucheron, G. Lugosi, and P. Massart, Concentration Inequalities: A Nonasymptotic Theory of Independence . OUP Oxford, 2013
2013
Cited alongside, same era.
J. C. Duchi, M. I. Jordan, and M. J. Wainwright, “Local privacy and statistical minimax rates,” in 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013 . IEEE Computer Society, 2013, pp. 429–438
2013
Cited alongside, same era.
2013
Cited alongside, same era.
S. Foucart and H. Rauhut, A mathematical introduction to compressive sensing , ser. Applied and Numerical Harmonic Analysis. Birkhäuser/Springer, New York, 2013. [Online]. Available: https://doi.org/10.1007/978-0-8176-4948-7
2013
Cited alongside, same era.
A. Xu and M. Raginsky, “Information-theoretic lower bounds on Bayes risk in decentralized estimation,” IEEE Transactions on Information Theory , vol. 63, no. 3, pp. 1580–1600, 2017
2017
Later among the works it cites.
S. Balakrishnan and L. Wasserman, “Hypothesis testing for high-dimensional multinomials: A selective review,” The Annals of Applied Statistics , vol. 12, no. 2, pp. 727–749, 2018. [Online]. Available: https://doi.org/10.1214/18-AOAS1155SF
2018
Closest in time.
O. Fischer, U. Meir, and R. Oshman, “Distributed uniformity testing,” in Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, PODC 2018 . ACM, 2018, pp. 455–464
2018
Closest in time.
Y. Han, P. Mukherjee, A. Özgür, and T. Weissman, “Distributed statistical estimation of high-dimensional and non-parametric distributions,” in Proceedings of the 2018 IEEE International Symposium on Information Theory (ISIT’18) , 2018, pp. 506–510
2018
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Y. Xiang and Y. H. Kim, “Interactive hypothesis testing against independence,” in Proceedings of the 2013 IEEE International Symposium on Information Theory (ISIT’13) , 2013, pp. 1782–1786
2013
Cited alongside, same era.
Y. Zhang, J. Duchi, M. I. Jordan, and M. J. Wainwright, “Information-theoretic lower bounds for distributed statistical estimation with communication constraints,” in Advances in Neural Information Processing Systems 26 , 2013, pp. 2328–2336
2013
Cited alongside, same era.
A. Garg, T. Ma, and H. L. Nguyen, “On communication cost of distributed statistical estimation and dimensionality,” in Advances in Neural Information Processing Systems 27 , 2014, pp. 2726–2734
2014
Cited alongside, same era.
O. Shamir, “Fundamental limits of online and distributed algorithms for statistical learning and estimation,” in Advances in Neural Information Processing Systems 27 , 2014, pp. 163–171
2014
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 Symposium on Theory of Computing Conference, STOC’16 . ACM, 2016, pp. 1011–1020
2016
Cited alongside, same era.
I. Diakonikolas, “Learning structured distributions,” in Handbook of Big Data . CRC Press, 2016
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 Machine Learning, ICML 2016 , ser. JMLR Workshop and Conference Proceedings, vol. 48. JMLR.org, 2016, pp. 2436–2444
2016
Cited alongside, same era.
J. Steinhardt, G. Valiant, and S. Wager, “Memory, communication, and statistical queries,” in Proceedings of the 29th Conference on Learning Theory, COLT 2016 , ser. Proceedings of Machine Learning Research, V. Feldman, A. Rakhlin, and O. Shamir, Eds., vol. 49. New York, New York, USA: PMLR, 23–26 Jun 2016, pp. 1490–1516
2016
Cited alongside, same era.
2018
Closest in time.
Y. Han, A. Özgür, and T. Weissman, “Geometric lower bounds for distributed parameter estimation under communication constraints,” in Proceedings of the 31st Conference on Learning Theory, COLT 2018 , ser. Proceedings of Machine Learning Research, vol. 75. PMLR, 2018, pp. 3163–3188
2018
Closest in time.
K. R. Sahasranand and H. Tyagi, “Extra samples can reduce communication for independence testing,” in Proceedings of the 2018 IEEE International Symposium on Information Theory (ISIT’18) . IEEE, 2018
2018
Closest in time.
O. Sheffet, “Locally private hypothesis testing,” in Proceedings of the 35th International Conference on Machine Learning , ser. Proceedings of Machine Learning Research, J. Dy and A. Krause, Eds., vol. 80. Stockholmsmässan, Stockholm Sweden: PMLR, 10–15 Jul 2018, pp. 4612–4621
2018
Closest in time.
M. Ye and A. Barg, “Optimal schemes for discrete distribution estimation under locally differential privacy,” IEEE Transactions on Information Theory , vol. 64, no. 8, pp. 5662–5676, 2018
2018
Closest in time.
2019
Closest in time.
J. Acharya, Z. Sun, and H. Zhang, “Hadamard response: Estimating distributions privately, efficiently, and with little communication,” ser. Proceedings of Machine Learning Research, K. Chaudhuri and M. Sugiyama, Eds., vol. 89. PMLR, 16–18 Apr 2019, pp. 1120–1129. [Online]. Available: http://proceedings.mlr.press/v89/acharya19a.html
2019
Closest in time.
A. Andoni, T. Malkin, and N. Shekel Nosatzki, “Two party distribution testing: communication and security,” in 46th International Colloquium on Automata, Languages, and Programming , ser. LIPIcs. Leibniz Int. Proc. Inform. Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2019, vol. 132, pp. Art. No. 15, 16
2019
Closest in time.
Q. Berthet and V. Kanade, “Statistical windows in testing for the initial distribution of a reversible markov chain,” in AISTATS , ser. Proceedings of Machine Learning Research, vol. 89. PMLR, 2019, pp. 246–255
2019
Closest in time.
——, “Distribution testing lower bounds via reductions from communication complexity,” ACM Trans. Comput. Theory , vol. 11, no. 2, pp. Art. 6, 37, 2019, journal version of [ 11 ] . [Online]. Available: https://doi.org/10.1145/3305270
2019
Closest in time.
I. Diakonikolas, T. Gouleakis, D. M. Kane, and S. Rao, “Communication and memory efficient testing of discrete distributions,” in Proceedings of the 32nd Conference on Learning Theory, COLT 2019 , ser. Proceedings of Machine Learning Research, vol. 99. PMLR, 2019, pp. 1070–1106
2019
Closest in time.
2020
Closest in time.
C. L. Canonne, A Survey on Distribution Testing: Your Data is Big. But is it Blue? , ser. Graduate Surveys. Theory of Computing Library, 2020, no. 9. [Online]. Available: http://www.theoryofcomputing.org/library.html
2020
Closest in time.
O. Goldreich, “The uniform distribution is complete with respect to testing identity to a fixed distribution,” in Computational Complexity and Property Testing - On the Interplay Between Randomness and Computation , ser. Lecture Notes in Computer Science, O. Goldreich, Ed. Springer, 2020, vol. 12050, pp. 152–172. [Online]. Available: https://doi.org/10.1007/978-3-030-43662-9_10
2020
Closest in time.
J. Acharya, C. L. Canonne, C. Freitag, and H. Tyagi, “Test without trust: Optimal locally private distribution testing,” in AISTATS , ser. Proceedings of Machine Learning Research, vol. 89. PMLR, 2019, pp. 2067–2076
2076
Closest in time.