FedMPDD: Communication-Efficient Federated Learning with Privacy Preservation Attributes via Projected Directional Derivative
Mohammadreza Rostami, Solmaz S. Kia

TL;DR
FedMPDD is a communication-efficient federated learning algorithm that uses projected directional derivatives to reduce communication costs and enhance privacy, with proven convergence and practical effectiveness.
Contribution
It introduces a novel gradient encoding method using multiple projections, achieving reduced communication and improved privacy in federated learning.
Findings
Reduces uplink communication from O(d) to O(m) with m << d.
Converges at a rate of O(1/√K), matching FedSGD.
Provides inherent privacy protection against gradient inversion attacks.
Abstract
This paper introduces \texttt{FedMPDD} (\textbf{Fed}erated Learning via \textbf{M}ulti-\textbf{P}rojected \textbf{D}irectional \textbf{D}erivatives), a novel algorithm that simultaneously optimizes bandwidth utilization and enhances privacy in Federated Learning. The core idea of \texttt{FedMPDD} is to encode each client's high-dimensional gradient by computing its directional derivatives along multiple random vectors. This compresses the gradient into a much smaller message, significantly reducing uplink communication costs from to , where . The server then decodes the aggregated information by projecting it back onto the same random vectors. Our key insight is that averaging multiple projections overcomes the dimension-dependent convergence limitations of a single projection. We provide a rigorous theoretical analysis, establishing that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPrivacy-Preserving Technologies in Data · Stochastic Gradient Optimization Techniques · Cryptography and Data Security
