Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

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 access
Acharya, Jayadev, Canonne, Clement L., Tyagi, Himanshu · 2020 · IEEE Transactions on Information Theory

Abstract

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tit.2020.3028440

Cites

56 of 56 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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?

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

Show all 59 references

Research works printed but not linked: 6

  1. ingster, 1986, A minimax test of nonparametric hypotheses on the density of a distribution in $L_{p}$ metrics, Teor Veroyatnost i Primenen, 31, 384
  2. han, 2018, Geometric lower bounds for distributed parameter estimation under communication constraints, Proc 31st Conf Learn Theory COLT, 75, 3163
  3. acharya, 2019, Inference under information constraints III: Local privacy constraints, arXiv 2007 10979
  4. cover, 2006, Elements of Information Theory
  5. tsitsiklis, 1993, Decentralized detection, Advances in Statistical Signal Processing, 2, 297
  6. pollard, 2003, Asymptopia

Cited by

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
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

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.