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

Mihitha Maithripala; Chenyang Qiu; Zongli Lin

Home/Archive/arXiv

arXiv · 2610.04854

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

Mihitha Maithripala·Chenyang Qiu·Zongli Lin

View original source ↗Read source document ↗Export metadata ↓

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.

Explore related subjects

math.OC cs.SY eess.SY

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Mihitha Maithripala, Chenyang Qiu, Zongli Lin. 2026-10-04. Communication-Efficient Differentially Private Gradient Tracking for Distributed Optimization via Local Updates. https://arxiv.org/abs/2610.04854

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Diagonally forced systems and the spectral signature of matrix cycles

Given any square matrix, $\mathbf{M}$, whose diagonal elements are negative, and which are multiplied by a variable, $σ$, we wish to find the minimal $σ$ such that the eigenvalue of $\mathbf{M}_σ$ is exactly zero. By Gershgorin, we know that $\mathbf{M}_σ$ can be made stable by making $σ$ large enough. We prove a relation which analytically determines when and how we are able to find the value of $σ$ such that the maximal eigenvalue is exactly zero. In so doing, we prove the equivalence of the roots of the characteristic polynomial of $\mathbf{M}_σ$ and the eigenvalues that arise from a scaling operation on $\mathbf{M}$. Further, through the characteristic polynomial, we are able to isolate the dominant feedback cycles comprising the elements of the matrix which, under the action of $σ$, ensures the stability of the system. We then explore, using the stabilising and destabilising cycles within the coefficients of the characteristic polynomial, an intrinsic spectral signature associated with any square matrix based on the sign (or zero) of its respective elements.

math.OC↗

arXiv2026

Nonlinear Control Allocation: A Polynomial Approach

Control allocation maps the virtual control inputs requested by a high-level control law onto the physical actuators of a system. When the actuator authority is strongly nonlinear, existing methods rely on local linearization, on incremental updates, or on general nonlinear programming, and may be inaccurate, slow, or trapped in local optima. This paper introduces Polynomial Control Allocation, in which the cost and constraints of the allocation problem are polynomial or rational functions of the states and inputs; radical, trigonometric and tabulated nonlinearities are accommodated by lifting. The first order optimality conditions then form a parametric system of polynomial equations. Its Gr{ö}bner basis and the associated multiplication matrices are computed once, offline. Online, the matrices are evaluated at the current state and all solutions are recovered from the eigenvectors of a random linear combination of them, so that the globally optimal allocation is selected at a predictable computational cost. The framework is illustrated on thrust control of a variable-pitch propeller and on multicopter force allocation, and its computational cost is quantified in terms of polynomial evaluation and eigenvector computation. The method is validated experimentally on a Quanser helicopter model at a 500 Hz control rate, where a two-layer allocation scheme combined with linear model predictive control decouples travel and elevation over multiple full rotations. Monte Carlo comparisons with nonlinear programming and incremental nonlinear control allocation show that Polynomial Control Allocation achieves the lowest allocation error together with the shortest computation time.

math.OC↗

arXiv2026

Notes on the discretization of TV-NORM regularized inverse potential problems

We describe a method to discretize optimization problems arising in the regularization of linear inverse problem having compact forward operator defined on 3-D valued measures, compactly supported on a fixed set. The criterion is a quadratic residual attached to the data, with an additive penalization of the total variation of the measure.

math.OC↗