@inproceedings{BGMNW16,
  author    = {Mark Braverman and
               Ankit Garg and
               Tengyu Ma and
               Huy L. Nguyen and
               David P. Woodruff},
  title     = {Communication lower bounds for statistical estimation problems via
               a distributed data processing inequality},
  booktitle = {Symposium on Theory of Computing Conference, {STOC'16}},
  pages     = {1011--1020},
  publisher = {{ACM}},
  year      = {2016},
  bibbase_note = {<div class="well well-small bibbase"><span class="bluecite">[BGMNW16]</span> Significantly generalizes [GMN14], extending the lower bounds to the blackboard model, and the upper bounds to the SMP model. Includes tight results for sparse mean estimation. The lower bounds are obtained via a combination of strong data processing inequalities (SDPI) and the "cut-and-paste" property of Hellinger distance.</div>}
}

{"_id":"Mun7MBj3wisaBEPRt","bibbaseid":"braverman-garg-ma-nguyen-woodruff-communicationlowerboundsforstatisticalestimationproblemsviaadistributeddataprocessinginequality-2016","authorIDs":[],"author_short":["Braverman, M.","Garg, A.","Ma, T.","Nguyen, H. L.","Woodruff, D. P."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Mark"],"propositions":[],"lastnames":["Braverman"],"suffixes":[]},{"firstnames":["Ankit"],"propositions":[],"lastnames":["Garg"],"suffixes":[]},{"firstnames":["Tengyu"],"propositions":[],"lastnames":["Ma"],"suffixes":[]},{"firstnames":["Huy","L."],"propositions":[],"lastnames":["Nguyen"],"suffixes":[]},{"firstnames":["David","P."],"propositions":[],"lastnames":["Woodruff"],"suffixes":[]}],"title":"Communication lower bounds for statistical estimation problems via a distributed data processing inequality","booktitle":"Symposium on Theory of Computing Conference, STOC'16","pages":"1011–1020","publisher":"ACM","year":"2016","bibbase_note":"<div class=\"well well-small bibbase\"><span class=\"bluecite\">[BGMNW16]</span> Significantly generalizes [GMN14], extending the lower bounds to the blackboard model, and the upper bounds to the SMP model. Includes tight results for sparse mean estimation. The lower bounds are obtained via a combination of strong data processing inequalities (SDPI) and the \"cut-and-paste\" property of Hellinger distance.</div>","bibtex":"@inproceedings{BGMNW16,\n author = {Mark Braverman and\n Ankit Garg and\n Tengyu Ma and\n Huy L. Nguyen and\n David P. Woodruff},\n title = {Communication lower bounds for statistical estimation problems via\n a distributed data processing inequality},\n booktitle = {Symposium on Theory of Computing Conference, {STOC'16}},\n pages = {1011--1020},\n publisher = {{ACM}},\n year = {2016},\n bibbase_note = {<div class=\"well well-small bibbase\"><span class=\"bluecite\">[BGMNW16]</span> Significantly generalizes [GMN14], extending the lower bounds to the blackboard model, and the upper bounds to the SMP model. Includes tight results for sparse mean estimation. The lower bounds are obtained via a combination of strong data processing inequalities (SDPI) and the \"cut-and-paste\" property of Hellinger distance.</div>}\n}\n\n","author_short":["Braverman, M.","Garg, A.","Ma, T.","Nguyen, H. L.","Woodruff, D. P."],"key":"BGMNW16","id":"BGMNW16","bibbaseid":"braverman-garg-ma-nguyen-woodruff-communicationlowerboundsforstatisticalestimationproblemsviaadistributeddataprocessinginequality-2016","role":"author","urls":{},"metadata":{"authorlinks":{}},"downloads":0,"html":""},"bibtype":"inproceedings","biburl":"http://www.cs.columbia.edu/~ccanonne/tutorial-focs2020/publications-annotated.bib","creationDate":"2020-11-08T21:18:56.159Z","downloads":0,"keywords":[],"search_terms":["communication","lower","bounds","statistical","estimation","problems","via","distributed","data","processing","inequality","braverman","garg","ma","nguyen","woodruff"],"title":"Communication lower bounds for statistical estimation problems via a distributed data processing inequality","year":2016,"dataSources":["EYbwRcMzLdr2qsboR","SK4pKeSrqk4BzgaZs"]}