Skip to content
DraconiticResearch
Search Sources API
178,033 studies31 sourcesUpdated 36 min ago
PreprintarXiv licencearXiv

Communication-Efficient Differentially Private Gradient Tracking for Distributed Optimization via Local Updates

Abstract

This paper studies privacy-preserving distributed optimization using gradient tracking with one communication-free local update between consecutive communication rounds. Since local computation alone does not protect gradient information, we perturb both the primal state and the gradient-tracking direction at communication iterations while keeping local updates noise-free. We establish an aggregate variable for tracking, characterize the limiting consensus point in the presence of added random noise, and prove convergence in mean under certain parameter conditions. We also establish infinite-horizon pure differential privacy for the complete communication transcript under an affine objective adjacency relation and geometrically decaying Laplace perturbations. Simulation results illustrate the advantages of the proposed method in terms of the convergence and optimization accuracy given a privacy budget.

Related

  1. Dynamic Regret and Tightened Constraint Violation for Communication-Efficient Distributed Online Bilevel Optimization
    Fan Li, Xinlei Yi, Guanghui Wen +2
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  2. Differentially Private Distributed Optimization via the Intrinsic Randomness of Zeroth-Order Estimators: Sampling Geometry, Convergence, and Privacy Guarantees
    Jiajun Wang, Yujie Tang
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  3. Distributed LLM Inference via Communication-Efficient Speculative Decoding
    Joohyun Shin, Byeonghyeon Park, Keumseo Ryum +1
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  4. Communication-Efficient Distributed Training via Ring-Based Coded Approximate All-Reduce
    Sifat Munim, Aditya Ramamoorthy
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  5. A Unified Efficient Gradient-Based Heuristic For Box-Constrained Expectation-Related and Risk-Averse Stochastic Optimization Problems
    Mazen Alamir
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
BibTeX
@misc{maithripala2026communicationefficient,
  title = {{Communication-Efficient Differentially Private Gradient Tracking for Distributed Optimization via Local Updates}},
  author = {Mihitha Maithripala and Chenyang Qiu and Zongli Lin},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.04854},
  eprint = {2610.04854},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.04854},
}
RIS
TY  - UNPB
TI  - Communication-Efficient Differentially Private Gradient Tracking for Distributed Optimization via Local Updates
AU  - Mihitha Maithripala
AU  - Chenyang Qiu
AU  - Zongli Lin
PY  - 2026
DA  - 2026/10/04
PB  - arXiv
DO  - 10.48550/arxiv.2610.04854
UR  - https://arxiv.org/abs/2610.04854
AB  - This paper studies privacy-preserving distributed optimization using gradient tracking with one communication-free local update between consecutive communication rounds. Since local computation alone does not protect gradient information, we perturb both the primal state and the gradient-tracking direction at communication iterations while keeping local updates noise-free. We establish an aggregate variable for tracking, characterize the limiting consensus point in the presence of added random noise, and prove convergence in mean under certain parameter conditions. We also establish infinite-horizon pure differential privacy for the complete communication transcript under an affine objective adjacency relation and geometrically decaying Laplace perturbations. Simulation results illustrate the advantages of the proposed method in terms of the convergence and optimization accuracy given a privacy budget.
ER  -