CoChat

Differentially Private Distributed Optimization

Open access
Huang, Zhenqi, Mitra, Sayan, Vaidya, Nitin · 2015 · Proceedings of the 16th International Conference on Distributed Computing and Networking

The DOI matches its Crossref record; 16 of the 17 references it cites were found in a registry or an index, and 1 are not checked yet.

Abstract

In distributed optimization and iterative consensus literature, a standard problem is for N agents to minimize a function f over a subset of Euclidean space, where the cost function is expressed as a sum Σ fi. In this paper, we study the private distributed optimization problem (PDOP) with the additional requirement that the cost function of the individual agents should remain differentially private. The adversary attempts to infer information about the private cost functions from the messages that the agents exchange. Achieving differential privacy requires that any change of an individual's cost function only results in unsubstantial changes in the statistics of the messages. We propose a class of iterative algorithms for solving PDOP, which achieves differential privacy and convergence to a common value. Our analysis reveals the dependence of the achieved accuracy and the privacy levels on the the parameters of the algorithm. We observe that to achieve ϵ-differential privacy the accuracy of the algorithm has the order of O(1/ϵ2).

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.1145/2684464.2684480

Cites

16 of 17 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 17 references

Research works printed but not linked: 1

  1. 10.5555/1791834.1791836 · doi:10.5555/1791834.1791836

Cited by

See all 274

Metadata

Authors
Huang, Z., Mitra, S., & Vaidya, N.
Affiliations
University of Illinois Urbana-Champaign (US)
Venue
Proceedings of the 16th International Conference on Distributed Computing and Networking
Publisher
ACM
Published
2015-01-04
Pages
1-10
OpenAlex
W2092845654
Cited by
266
References
17
Citations by year
2026: 15 · 2025: 24 · 2024: 37 · 2023: 33 · 2022: 27 · 2021: 24 · 2020: 23 · 2019: 26 · 2018: 23 · 2017: 14 · 2016: 12 · 2015: 5
FWCI
10.14
Type
conference paper
Language
en
Open access
Locations
  • International Conference on Distributed Computing and Networking (ICDCN) (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • National Science Foundation (CAREER CNS 10-54247)
  • NSA (SoS W911NSF-13-0086)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
  • Physical Sciences › Engineering › Control and Systems Engineering › Distributed Control Multi-Agent Systems
  • Physical Sciences › Computer Science › Computer Networks and Communications › Distributed Sensor Networks and Detection Algorithms
Keywords
differential privacy, distributed optimization, multi-agent systems, privacy-accuracy trade-off, convergence analysis, iterative methods, privacy-preserving optimization

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: Differentially Private Distributed Optimization. https://app.cochat.ai/papers/10.1145/2684464.2684480
The paper
Huang, Z., Mitra, S., & Vaidya, N. (2015). Differentially Private Distributed Optimization. Proceedings of the 16th International Conference on Distributed Computing and Networking. https://doi.org/10.1145/2684464.2684480

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.