Locally Differentially Private Online Federated Learning With Correlated Noise

We introduce a locally differentially private (LDP) algorithm for online federated learning that employs temporally correlated noise to improve utility while preserving privacy. To address challenges posed by the correlated noise and local updates with streaming non-IID data, we develop a perturbed iterate analysis that controls the impact of the noise on the utility. Moreover, we demonstrate how the drift errors from local updates can be effectively managed for several classes of nonconvex loss functions. Subject to an (ε, δ)-LDP budget, we establish a dynamic regret bound that quantifies the impact of key parameters and the intensity of changes in the dynamic environment on the learning performance. Numerical experiments confirm the efficacy of the proposed algorithm.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Signal Processing
Published
2025-01-01
DOI
https://doi.org/10.1109/tsp.2025.3553355
Citations
5
Primary Topic
Privacy-Preserving Technologies in Data
Type
article
Field-Weighted Citation Impact
12.40
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Locally Differentially Private Online Federated Learning With Correlated Noise

Mikael Johansson, Linglingzhi Zhu, Dominik Fay, Jiaojiao Zhang
5 citations
IEEE Transactions on Signal Processing
Privacy-Preserving Technologies in Data
12.40
article

Locally Differentially Private Online Federated Learning With Correlated Noise

Mikael Johansson, Linglingzhi Zhu, Dominik Fay, Jiaojiao Zhang
article en
5 citations

Abstract

We introduce a locally differentially private (LDP) algorithm for online federated learning that employs temporally correlated noise to improve utility while preserving privacy. To address challenges posed by the correlated noise and local updates with streaming non-IID data, we develop a perturbed iterate analysis that controls the impact of the noise on the utility. Moreover, we demonstrate how the drift errors from local updates can be effectively managed for several classes of nonconvex loss functions. Subject to an (ε, δ)-LDP budget, we establish a dynamic regret bound that quantifies the impact of key parameters and the intensity of changes in the dynamic environment on the learning performance. Numerical experiments confirm the efficacy of the proposed algorithm.

IEEE Transactions on Signal ProcessingVol. 73
Georgia Institute of Technology (US), KTH Royal Institute of Technology (SE)
Openalex Percentile: Top 2%
Privacy-Preserving Technologies in Data
12.40
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.