CoChat

Optimal Schemes for Discrete Distribution Estimation Under Locally Differential Privacy

Open access
Ye, Min, Barg, Alexander · 2018 · IEEE Transactions on Information Theory

The DOI matches its Crossref record; 20 of the 24 references it cites were found in a registry or an index.

Abstract

We consider the minimax estimation problem of a discrete distribution with support size k under privacy constraints. A privatization scheme is applied to each raw sample independently, and we need to estimate the distribution of the raw samples from the privatized samples. A positive number ∈ measures the privacy level of a privatization scheme. For a given ∈, we consider the problem of constructing optimal privatization schemes with ∈-privacy level, i.e., schemes that minimize the expected estimation loss for the worst-case distribution. Two schemes known in the literature provide order optimal performance in the high privacy regime where E is very close to 0, and in the low privacy regime where e∈≈ k, respectively. In this paper, we propose a new family of schemes which substantially improve the performance of the existing schemes in the medium privacy regime when 1 ≪ e∈≪ k. More concretely, we prove that when 3.822metric and by 30% under ℓ1metric over the existing schemes. We also prove a lower bound for the region e∈≪ k, which implies that our schemes are order optimal in this regime.

Overview

Integrity signals

Registry

Crossref · 10.1109/tit.2018.2809790

Cites

20 of 20 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

Citations

Cites

Show all 20 references

Research works printed but not linked: 2

  1. assouad, 1983, Deux remarques sur l’estimation, Comptes Rendus Math Acad Sci Paris, 296, 1021
  2. royden, 2010, Real Analysis

Cited by

See all 163

Metadata

Authors
Ye, M., & Barg, A.
Affiliations
University of Maryland, College Park (US)
Venue
IEEE Transactions on Information Theory
Published
2018-08
Volume
64
Issue
8
Pages
5662-5676
ISSN
  • 0018-9448 (ISSN-L)
  • 1557-9654
OpenAlex
W2792817205
Cited by
158
References
24
Citations by year
2026: 9 · 2025: 15 · 2024: 15 · 2023: 14 · 2022: 15 · 2021: 28 · 2020: 36 · 2019: 22 · 2018: 2
FWCI
12.32
Type
journal article
Language
en
Open access
Locations
  • IEEE Transactions on Information Theory (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
National Science Foundation (CCF1422955, CCF 1422955, CCF 1618603)
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 › Computer Science › Artificial Intelligence › Internet Traffic Analysis and Secure E-voting
Keywords
discrete distribution estimation, minimax estimation, privacy-utility trade-off, lower bounds, order optimality

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: Optimal Schemes for Discrete Distribution Estimation Under Locally Differential Privacy. https://app.cochat.ai/papers/10.1109/tit.2018.2809790
The paper
Ye, M., & Barg, A. (2018). Optimal Schemes for Discrete Distribution Estimation Under Locally Differential Privacy. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2018.2809790

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.