Fetching the paper…
Reading the bibliography…
We consider parameter estimation in distributed networks, where each sensor in the network observes an independent sample from an underlying distribution and has $k$ bits to communicate its sample to a centralized processor which computes an estimate of a desired parameter.
Über die verallgemeinerung des begriffes der zueinander konjugierten potenzen
Z Birnbaum and W-f Orlicz · 1931
Earlier work this paper cites.
A characterization of limiting distributions of regular estimates
Jaroslav Hájek · 1970
Earlier work this paper cites.
Local asymptotic minimax and admissibility in estimation
Jaroslav Hájek · 1972
Earlier work this paper cites.
A theorem on the entropy of certain binary sequences and applications–ii
A Wyner · 1973
Earlier work this paper cites.
Deux remarques sur l’estimation
Patrice Assouad · 1983
Earlier work this paper cites.
Communication Complexity
E Kushilevitz and N Nisan · 1997
Earlier work this paper cites.
Assouad, Fano, and Le Cam
Bin Yu · 1997
Earlier work this paper cites.
An information statistics approach to data stream and communication complexity
Ziv Bar-Yossef, Thathachar S Jayram, Ravi Kumar, and D Sivakumar · 2004
Earlier work this paper cites.
The concentration of measure phenomenon
Michel Ledoux · 2005
Earlier work this paper cites.
Probability and computing: Randomized algorithms and probabilistic analysis
Michael Mitzenmacher and Eli Upfal · 2005
Earlier work this paper cites.
A coincidence-based test for uniformity given very sparsely sampled discrete data
Liam Paninski · 2008
Earlier work this paper cites.
Introduction to Nonparametric Estimation
A. Tsybakov · 2008
Earlier work this paper cites.
Introduction to the non-asymptotic analysis of random matrices
Roman Vershynin · 2010
Earlier work this paper cites.
On optimal data compression in multiterminal statistical inference
Shun-ichi Amari · 2011
Earlier work this paper cites.
Distributed optimization and statistical learning via the alternating direction method of multipliers
Stephen Boyd, Neal Parikh, Eric Chu, Borja Peleato, and Jonathan Eckstein · 2011
Earlier work this paper cites.
Distributed learning, communication complexity and privacy
Maria Florina Balcan, Avrim Blum, Shai Fine, and Yishay Mansour · 2012
Earlier work this paper cites.
Optimal distributed online prediction using mini-batches
Ofer Dekel, Ran Gilad-Bachrach, Ohad Shamir, and Lin Xiao · 2012
Earlier work this paper cites.
Protocols for learning classifiers on distributed data
Hal Daume III, Jeff Phillips, Avishek Saha, and Suresh Venkatasubramanian · 2012
Earlier work this paper cites.
Efficient protocols for distributed classification and optimization
Hal Daumé, Jeff M Phillips, Avishek Saha, and Suresh Venkatasubramanian · 2012
Earlier work this paper cites.
Local privacy and statistical minimax rates
John C Duchi, Michael I Jordan, and Martin J Wainwright · 2013
Cited alongside, same era.
Distance-based and continuum fano inequalities with applications to statistical estimation
John C Duchi and Martin J Wainwright · 2013
Cited alongside, same era.
Statistical estimation: asymptotic theory
Ilʹdar Abdulovich Ibragimov and Rafail Z Has’minskii · 2013
Cited alongside, same era.
Yuchen Zhang, John Duchi, Michael I Jordan, and Martin J Wainwright · 2013
Cited alongside, same era.
On communication cost of distributed statistical estimation and dimensionality
Ankit Garg, Tengyu Ma, and Huy Nguyen · 2014
Cited alongside, same era.
Minimax bounds for distributed logistic regression
Leighton Pate Barnes and Ayfer Ozgur · 2019
Closest in time.
Lower bounds for locally private estimation via communication complexity
John Duchi and Ryan Rogers · 2019
Closest in time.
Lecture 8: multiple hypothesis testing: tree, fano, and assouad
Yanjun Han · 2019
Closest in time.
Advances and open problems in federated learning
Peter Kairouz, H Brendan McMahan, Brendan Avent, Aurélien Bellet, Mehdi Bennis, Arjun Nitin Bhagoji, Keith Bonawitz, Zachary Charles, Graham Cormode, Rachel Cummings, et al · 2019
Closest in time.
Domain compression and its application to randomness-optimal distributed goodness-of-fit
Jayadev Acharya, Clément L Canonne, Yanjun Han, Ziteng Sun, and Himanshu Tyagi · 2020
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Fundamental limits of online and distributed algorithms for statistical learning and estimation
Ohad Shamir · 2014
Cited alongside, same era.
Communication lower bounds for statistical estimation problems via a distributed data processing inequality
Mark Braverman, Ankit Garg, Tengyu Ma, Huy L Nguyen, and David P Woodruff · 2016
Cited alongside, same era.
On bayes risk lower bounds
Xi Chen, Adityanand Guntuboyina, and Yuchen Zhang · 2016
Cited alongside, same era.
Discrete distribution estimation under local privacy
Peter Kairouz, Keith Bonawitz, and Daniel Ramage · 2016
Cited alongside, same era.
Communication-efficient distributed learning of discrete distributions
Ilias Diakonikolas, Elena Grigorescu, Jerry Li, Abhiram Natarajan, Krzysztof Onak, and Ludwig Schmidt · 2017
Cited alongside, same era.
Communication-efficient learning of deep networks from decentralized data
Brendan McMahan, Eider Moore, Daniel Ramage, Seth Hampson, and Blaise Aguera y Arcas · 2017
Cited alongside, same era.
Information-theoretic lower bounds on Bayes risk in decentralized estimation
Aolin Xu and Maxim Raginsky · 2017
Cited alongside, same era.
Jayadev Acharya, Clément L Canonne, Yuhan Liu, Ziteng Sun, and Himanshu Tyagi · 2020
Closest in time.
Distributed signal detection under communication constraints
Jayadev Acharya, Clément L Canonne, and Himanshu Tyagi · 2020
Closest in time.
Inference under information constraints i: Lower bounds from chi-square contraction
Jayadev Acharya, Clément L Canonne, and Himanshu Tyagi · 2020
Closest in time.
Inference under information constraints ii: Communication constraints and shared randomness
Jayadev Acharya, Clément L Canonne, and Himanshu Tyagi · 2020
Closest in time.
Pan-private uniformity testing
Kareem Amin, Matthew Joseph, and Jieming Mao · 2020
Closest in time.
Estimating sparse discrete distributions under local privacy and communication constraints
Jayadev Acharya, Peter Kairouz, Yuhan Liu, and Ziteng Sun · 2020
Closest in time.
Locally private non-asymptotic testing of discrete distributions is faster using interactive mechanisms
Thomas Berrett and Cristina Butucea · 2020
Closest in time.
Fisher information under local differential privacy
Leighton Pate Barnes, Wei-Ning Chen, and Ayfer Özgür · 2020
Closest in time.
Lower bounds for learning distributions under communication constraints via Fisher information
Leighton Pate Barnes, Yanjun Han, and Ayfer Özgür · 2020
Closest in time.
Breaking the communication-privacy-accuracy trilemma
Wei-Ning Chen, Peter Kairouz, and Ayfer Ozgur · 2020
Closest in time.
Inference under information constraints iii: Local privacy constraints
Jayadev Acharya, Clément L Canonne, Cody Freitag, Ziteng Sun, and Himanshu Tyagi · 2021
Closest in time.
Unified lower bounds for interactive high-dimensional estimation under information constraints
Jayadev Acharya, Clément L Canonne, and Himanshu Tyagi · 2021
Closest in time.
Breaking the dimension dependence in sparse distribution estimation under communication constraints
Wei-Ning Chen, Peter Kairouz, and Ayfer Özgür · 2021
Closest in time.