Information-Theoretic Lower Bounds on Bayes Risk in Decentralized Estimation
Open accessThe DOI matches its Crossref record.
Abstract
We derive lower bounds on the Bayes risk in decentralized estimation, where the estimator does not have direct access to the random samples generated conditionally on the random parameter of interest, but only to the data received from local processors that observe the samples. The received data are subject to communication constraints due to the quantization and the noisy communication channels from the processors to the estimator. We first derive general lower bounds on the Bayes risk using information-theoretic quantities, such as mutual information, information density, small ball probability, and differential entropy. We then apply these lower bounds to the decentralized case, using strong data processing inequalities to quantify the contraction of information due to communication constraints. We treat the cases of a single processor and of multiple processors, where the samples observed by different processors may be conditionally dependent given the parameter, for noninteractive and interactive communication protocols. Our results recover and improve recent lower bounds on the Bayes risk and the minimax risk for certain decentralized estimation problems, where previously only conditionally independent sample sets and noiseless channels have been considered. Moreover, our results provide a general way to quantify the degradation of estimation performance caused by distributing resources to multiple processors, which is only discussed for specific examples in existing works.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Inference under information constraints I: Lower bounds from chi-square contraction
Acharya, J., Canonne, C. L., & Tyagi, H. (2020) · IEEE Transactions on Information Theory · doi:10.1109/tit.2020.3028440 · Cited by 59
rTop-k: A Statistical Estimation Approach to Distributed SGD
Barnes, L. P., Inan, H. A., Isik, B., & Ozgur, A. (2020) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2020.3042094 · Cited by 44
Lower bounds for learning distributions under communication constraints via Fisher information
Barnes, L. P., Han, Y., & Ozgur, A. (2019) · arXiv · doi:10.48550/arxiv.1902.02890 · Cited by 40
Metadata
- Authors
- Xu, A., & Raginsky, M.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2017-03
- Volume
- 63
- Issue
- 3
- Pages
- 1580-1600
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2963473808
- Cited by
- 48
- References
- 0
- FWCI
- 3.16
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Information-Theoretic Lower Bounds on Bayes Risk in Decentralized Estimation. https://app.cochat.ai/papers/10.1109/tit.2016.2646342
- The paper
- Xu, A., & Raginsky, M. (2017). Information-Theoretic Lower Bounds on Bayes Risk in Decentralized Estimation. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2016.2646342
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.