Interactive Inference under Information Constraints

July 21, 2020 Β· Declared Dead Β· πŸ› IEEE Transactions on Information Theory

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Jayadev Acharya, ClΓ©ment L. Canonne, Yuhan Liu, Ziteng Sun, Himanshu Tyagi arXiv ID 2007.10976 Category cs.DS: Data Structures & Algorithms Cross-listed cs.DM, cs.IT, cs.LG, math.ST Citations 42 Venue IEEE Transactions on Information Theory Last Checked 3 months ago
Abstract
We study the role of interactivity in distributed statistical inference under information constraints, e.g., communication constraints and local differential privacy. We focus on the tasks of goodness-of-fit testing and estimation of discrete distributions. From prior work, these tasks are well understood under noninteractive protocols. Extending these approaches directly for interactive protocols is difficult due to correlations that can build due to interactivity; in fact, gaps can be found in prior claims of tight bounds of distribution estimation using interactive protocols. We propose a new approach to handle this correlation and establish a unified method to establish lower bounds for both tasks. As an application, we obtain optimal bounds for both estimation and testing under local differential privacy and communication constraints. We also provide an example of a natural testing problem where interactivity helps.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Data Structures & Algorithms

Died the same way β€” πŸ‘» Ghosted