Differentially Private Distributed Optimization
Open accessThe 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.
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
“current work on the hybrid model typically assumes that regardless of the user trust preference, their data comes from the same distribution [40, 39, 57].”
From Advances and Open Problems in Federated Learning (2021) · cites this paper as [57]
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
Consensus and Cooperation in Networked Multi-Agent Systems
Olfati-Saber, R., Fax, J. A., & Murray, R. M. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887293 · Cited by 10,522 · cited 1×
“For instance, such algorithms have been designed for the smart grids [3] and sensor networks [13].”
MethodDwork, C. (2006) · Lecture Notes in Computer Science · doi:10.1007/11787006_1 · Cited by 5,291 · cited 1×
“Categories and Subject Descriptors D.1.3 [Software]: Concurrent Programming—Distributed programming General Terms Algorithm Keywords Distributed Optimization, Differential Privacy, Iterative Consensus”
BackgroundInfluentialDistributed Subgradient Methods for Multi-Agent Optimization
Nedic, A., & Ozdaglar, A. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.2009515 · Cited by 3,719 · cited 2×
“Categories and Subject Descriptors D.1.3 [Software]: Concurrent Programming—Distributed programming General Terms Algorithm Keywords Distributed Optimization, Differential Privacy, Iterative Consensus”
BackgroundInfluentialDifferential 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×
“Categories and Subject Descriptors D.1.3 [Software]: Concurrent Programming—Distributed programming General Terms Algorithm Keywords Distributed Optimization, Differential Privacy, Iterative Consensus”
BackgroundInfluentialDistributed asynchronous deterministic and stochastic gradient optimization algorithms
Tsitsiklis, J., Bertsekas, D., & Athans, M. (1986) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1986.1104412 · Cited by 1,967
Our Data, Ourselves: Privacy Via Distributed Noise Generation
Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., & Naor, M. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_29 · Cited by 1,835
Differentially Private Empirical Risk Minimization
Chaudhuri, K., Monteleoni, C., & Sarwate, A. (2009) · Journal of machine learning research · doi:10.5555/1953048.2021036 · Cited by 1,634 · cited 1×
“In [1, 9] the authors solve a privacy preserving optimization problem with two methods: output perturbation and objective perturbation.”
Method(2011) · PubMed · Cited by 990 · cited 1×
“In [1, 9] the authors solve a privacy preserving optimization problem with two methods: output perturbation and objective perturbation.”
MethodGradient methods for minimizing composite objective function
Nesterov, Y. E. (2007) · Cited by 867
Distributed Stochastic Subgradient Projection Algorithms for Convex Optimization
Sundhar Ram, S., Nedić, A., & Veeravalli, V. V. (2010) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-010-9737-7 · Cited by 814 · cited 1×
“Categories and Subject Descriptors D.1.3 [Software]: Concurrent Programming—Distributed programming General Terms Algorithm Keywords Distributed Optimization, Differential Privacy, Iterative Consensus”
BackgroundInfluential
Research works printed but not linked: 1
- 10.5555/1791834.1791836 · doi:10.5555/1791834.1791836
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
Federated learning of predictive models from federated Electronic Health Records
Brisimi, T. S., Chen, R., Mela, T., Olshevsky, A., Paschalidis, I. C., & Shi, W. (2018) · International Journal of Medical Informatics · doi:10.1016/j.ijmedinf.2018.01.007 · Cited by 997
Secure and Privacy-Preserving Consensus
Ruan, M., Gao, H., & Wang, Y. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2019.2890887 · Cited by 347
“ng and control systems such as power systems and wireless sensor networks. To address the pressing need for privacy and security in consensus, recently, several solutions have been proposed [6], [7], [8], [9], [10], [11], [12], [13]. Most of these approaches use the idea of obfuscation to mask the true state values by…”
BackgroundMethodDifferentially private average consensus: Obstructions, trade-offs, and optimal algorithm design
Nozari, E., Tallapragada, P., & Cortés, J. (2017) · Automatica · doi:10.1016/j.automatica.2017.03.016 · Cited by 334
“O C ] 2 8 Fe b 20 17 et al., 2012, 2014, Wang et al., 2014], estimation [Ny and Pappas, 2014], and optimization [Han et al., 2014, Huang et al., 2015, Nozari et al., 2017].”
Privacy-Preserving Average Consensus via State Decomposition
Wang, Y. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2019.2902731 · Cited by 334
“Onecommonlyusedtoolis differentialprivacyfromthedatabaseliteratureincomputerscience [10],[11]–[15].”
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
- green
- arxiv.org
- 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.