CoChat

A Better Bound Gives a Hundred Rounds: Enhanced Privacy Guarantees via f-Divergences

Open access
Asoodeh, Shahab, Liao, Jiachun, Calmon, Flavio P., Kosut, Oliver, Sankar, Lalitha · 2020 · 2020 IEEE International Symposium on Information Theory (ISIT)
Cited by 28

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

Abstract

We derive the optimal differential privacy (DP) parameters of a mechanism that satisfies a given level of Renyí differential privacy (RDP). Our result is based on the joint range of two f-divergences that underlie the approximate and the Renyi variations of differential privacy. We apply our result tó the moments accountant framework for characterizing privacy guarantees of stochastic gradient descent. When compared to the state-of-the-art, our bounds may lead to about 100 more stochastic gradient descent iterations for training deep learning models for the same privacy budget.

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/isit44484.2020.9174015

Cites

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

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

Cited by

See all 28

Metadata

Authors
Asoodeh, S., Liao, J., Calmon, F. P., Kosut, O., & Sankar, L.
Venue
2020 IEEE International Symposium on Information Theory (ISIT)
Publisher
IEEE
Published
2020-06
Pages
920-925
OpenAlex
W2998988480
Cited by
28
References
7
FWCI
2.32
Type
conference paper
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: A Better Bound Gives a Hundred Rounds: Enhanced Privacy Guarantees via f-Divergences. https://app.cochat.ai/papers/10.1109/isit44484.2020.9174015
The paper
Asoodeh, S., Liao, J., Calmon, F. P., Kosut, O., & Sankar, L. (2020). A Better Bound Gives a Hundred Rounds: Enhanced Privacy Guarantees via f-Divergences. 2020 IEEE International Symposium on Information Theory (ISIT). https://doi.org/10.1109/isit44484.2020.9174015

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.