The DOI matches its Crossref record; 56 of the 59 references it cites were found in a registry or an index.
Inference Under Information Constraints I: Lower Bounds From Chi-Square Contraction
Open accessAbstract
Multiple players are each given one independent sample, about which they can only provide limited information to a central referee. Each player is allowed to describe its observed sample to the referee using a channel from a family of channels W, which can be instantiated to capture, among others, both the communication and privacy-constrained settings. The referee uses the players' messages to solve an inference problem on the unknown distribution that generated the samples. We derive lower bounds for the sample complexity of learning and testing discrete distributions in this informationconstrained setting. Underlying our bounds is a characterization of the contraction in chi-square distance between the observed distributions of the samples when information constraints are placed. This contraction is captured in a local neighborhood in terms of chi-square and decoupled chi-square fluctuations of a given channel, two quantities we introduce. The former captures the average distance between distributions of channel output for two product distributions on the input, and the latter for a product distribution and a mixture of product distribution on the input. Our bounds are tight for both publicand privatecoin protocols. Interestingly, the sample complexity of testing is order-wise higher when restricted to private-coin protocols.
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“This can enable differentially private protocols with far smaller error than what is possible in the local model, while relying on weaker trust assumptions than in the central model, e.g., [120, 178, 45, 201, 204, 200, 202, 203, 110].”
From Advances and Open Problems in Federated Learning (2021) · cites this paper as [178]
Experimental — accuracy not yet measuredThe check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“shuffling models of differential privacy can use broader classes of local randomizers, and can even select these local randomizers adaptively [178]”
From Advances and Open Problems in Federated Learning (2021) · cites this paper as [178]
Experimental — accuracy not yet measured
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
Cites
Differential Privacy: A Survey of Results
Dwork, C. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-79228-4_1 · Cited by 3,542 · cited 1×
“[21], [35], [9], [19]): For ρ > 0, W (y | x1) W (y | x2) ≤ e, ∀x1, x2 ∈ [k],∀y ∈ {0, 1}∗.”
A Mathematical Introduction to Compressive Sensing
Foucart, S., & Rauhut, H. (2013) · Applied and Numerical Harmonic Analysis · doi:10.1007/978-0-8176-4948-7 · Cited by 2,548 · cited 1×
“where the first inequality is by the decoupling inequality E e T Mθ ≤ E e T Mθ (used in [27] as well) and the second uses sub-Gaussianity once again.”
MethodConcentration Inequalities: A Nonasymptotic Theory of Independence
Boucheron, S., Lugosi, G., & Massart, P. (2013) · doi:10.1093/acprof:oso/9780199535255.001.0001 · Cited by 1,768 · cited 1×
“…where V 1 , . . . , V k/ 2 are independent and distributed uniformly over {− 1 , +1 , so that we can bound the decoupled chi-square fluctuation using Hoeffding’s Lemma ( cf. [12]) as Thus, Lemma III.6 implies that Ω( √ k/ε 2 ) samples are needed for testing (in particular, for uniformity testing).”
MethodInformation Theory: Coding Theorems for Discrete Memoryless Systems
Csiszár, I., & Körner, J. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9780511921889 · Cited by 1,308
Distributed detection with multiple sensors I. Fundamentals
Viswanathan, R., & Varshney, P. K. (1997) · Proceedings of the IEEE · doi:10.1109/5.554208 · Cited by 1,066 · cited 1×
“Interestingly, such setups have received a lot of attention in the sensor network literature where a fusion center combines local decisions using simple rules such as majority; see [51] for an early review.”
BackgroundLocal Privacy and Statistical Minimax Rates
Duchi, J. C., Jordan, M. I., & Wainwright, M. J. (2013) · 2013 IEEE 54th Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2013.53 · Cited by 954 · cited 3×
“Distribution learning under LDP constraints has been studied in [4], [21], [37], [52], [56], all providing sample-optimal schemes with different merits.”
BackgroundDistributed detection with multiple sensors I. Advanced topics
Blum, R. S., Kassam, S. A., & Poor, H. V. (1997) · Proceedings of the IEEE · doi:10.1109/5.554209 · Cited by 727
Kasiviswanathan, S. P., Lee, H. K., Nissim, K., Raskhodnikova, S., & Smith, A. (2008) · 2008 49th Annual IEEE Symposium on Foundations of Computer Science · doi:10.1109/focs.2008.27 · Cited by 334
Yu, B. (1997) · Festschrift for Lucien Le Cam · doi:10.1007/978-1-4612-1880-7_29 · Cited by 309 · cited 1×
“We can relate the accuracy of a probability estimate to the probability of error for the multiple hypothesis testing problem with hypotheses given by p z using the standard Fano’s method ( cf. [55]).”
MethodOn the Choice of the Number of Class Intervals in the Application of the Chi Square Test
Mann, H. B., & Wald, A. (1942) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177731569 · Cited by 275 · cited 2×
“[39]), with particular interest on the large-support and small-sample case where the usual normal approximations of statistics do not apply (cf.”
Background
Research works printed but not linked: 6
- ingster, 1986, A minimax test of nonparametric hypotheses on the density of a distribution in $L_{p}$ metrics, Teor Veroyatnost i Primenen, 31, 384
- han, 2018, Geometric lower bounds for distributed parameter estimation under communication constraints, Proc 31st Conf Learn Theory COLT, 75, 3163
- acharya, 2019, Inference under information constraints III: Local privacy constraints, arXiv 2007 10979
- cover, 2006, Elements of Information Theory
- tsitsiklis, 1993, Decentralized detection, Advances in Statistical Signal Processing, 2, 297
- pollard, 2003, Asymptopia
Cited by
Advances and Open Problems in Federated Learning
Kairouz, P., & McMahan, H. B. (2021) · Foundations and Trends in Machine Learning · doi:10.1561/2200000083 · Cited by 7,772
Communication-Efficient Federated Learning via Optimal Client Sampling
Ribero, M., & Vikalo, H. (2020) · LatinX in AI at International Conference on Machine Learning (LXAI) · doi:10.52591/lxai2020071310 · Cited by 131
Breaking the Communication-Privacy-Accuracy Trilemma
Chen, W., Kairouz, P., & Özgür, A. (2022) · IEEE Transactions on Information Theory · doi:10.1109/tit.2022.3218772 · Cited by 94
“If we further assume X are drawn from some discrete distribution p, then the problem falls into distribution estimation under local differential privacy [9], [13], [34], [36], [42], [43], [44], [45], [46] and limited communication [11], [25], [45], [46], [47], [48], [49], [50].”
BackgroundGeometric Lower Bounds for Distributed Parameter Estimation Under Communication Constraints
Han, Y., Özgür, A., & Weissman, T. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3108952 · Cited by 73
Communication-Efficient Federated Learning With Binary Neural Networks
Yang, Y., Zhang, Z., & Yang, Q. (2021) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2021.3118415 · Cited by 63
“Therefore, many research efforts have been made to theoretically characterize the fundamental trade-offs between the performance of the trained models and the communication costs of the FL framework[5][6][7][8][9].”
Metadata
- Authors
- Acharya, J., Canonne, C. L., & Tyagi, H.
- Affiliations
- Cornell University (US)
- Robert Bosch (India) (IN)
- Venue
- IEEE Transactions on Information Theory
- Published
- 2020-12
- Volume
- 66
- Issue
- 12
- Pages
- 7835-7855
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2907436114
- Cited by
- 59
- References
- 59
- Citations by year
- 2025: 4 · 2024: 7 · 2023: 9 · 2022: 10 · 2021: 15 · 2020: 7
- FWCI
- 4.03
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- Locations
- IEEE Transactions on Information Theory (publishedVersion)
- NOT FOUND REPOSITORY (Indian Institute of Science Bangalore) (acceptedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- NSF-CCF (NSF-CCF-1846300 (CAREER), NSF-CCF-1815893)
- Google Faculty Fellowship
- Motwani Postdoctoral Fellowship at Stanford University
- Research Grant from the Robert Bosch Center for Cyberphysical Systems (RBCCPS), Indian Institute of Science, Bengaluru
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
- Physical Sciences › Computer Science › Computer Networks and Communications › Distributed Sensor Networks and Detection Algorithms
- Physical Sciences › Mathematics › Statistics and Probability › Probability and Statistical Research
- Keywords
- information constraints, sample complexity, distribution testing, public-coin protocols, lower bounds
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: Inference Under Information Constraints I: Lower Bounds From Chi-Square Contraction. https://app.cochat.ai/papers/10.1109/tit.2020.3028440
- The paper
- Acharya, J., Canonne, C. L., & Tyagi, H. (2020). Inference Under Information Constraints I: Lower Bounds From Chi-Square Contraction. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2020.3028440
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.