Table of Contents
Fetching ...

FLUE: Federated Learning with Un-Encrypted model weights

Elie Atallah

TL;DR

The paper tackles privacy in federated learning by proposing FLUE, which forgoes encryption and instead employs coded local gradients and proxy-weight exchanges augmented with surplus noise to protect private data. The core idea is to encode data partitions with a singular matrix ${\bf B}$ and propagate proxies ${\bf\bar{x}}$ through a designed aggregation scheme built around matrices ${\bf A}$, ${\bar{\bar{\bf A}}}^l$, and ${\bf D}^l$; two variants (general with surpluses and a special no-surplus form) support fixed or time-varying coding schemes with replication options. Convergence guarantees are established for both static and time-varying networks, leveraging stochastic indecomposable-aperiodic (SIA) matrices and careful spectral analysis of the update operators; the convergence rate depends on the coding structure, with a reported rate of $O(\log k/\sqrt{k})$ for common step sizes. Simulation results on convex problems and neural-network-scale MNIST experiments show that FLUE can match or surpass traditional distributed gradient methods under appropriate coding-data alignment, while providing encryption-free privacy through coded updates and proxy-weight privacy. This work suggests a scalable, privacy-conscious alternative to encryption in federated settings, with avenues for stronger zero-coordination privacy and randomized encoding in future work.

Abstract

Federated Learning enables diverse devices to collaboratively train a shared model while keeping training data locally stored, avoiding the need for centralized cloud storage. Despite existing privacy measures, concerns arise from potential reverse engineering of gradients, even with added noise, revealing private data. To address this, recent research emphasizes using encrypted model parameters during training. This paper introduces a novel federated learning algorithm, leveraging coded local gradients without encryption, exchanging coded proxies for model parameters, and injecting surplus noise for enhanced privacy. Two algorithm variants are presented, showcasing convergence and learning rates adaptable to coding schemes and raw data characteristics. Two encryption-free implementations with fixed and random coding matrices are provided, demonstrating promising simulation results from both federated optimization and machine learning perspectives.

FLUE: Federated Learning with Un-Encrypted model weights

TL;DR

The paper tackles privacy in federated learning by proposing FLUE, which forgoes encryption and instead employs coded local gradients and proxy-weight exchanges augmented with surplus noise to protect private data. The core idea is to encode data partitions with a singular matrix and propagate proxies through a designed aggregation scheme built around matrices , , and ; two variants (general with surpluses and a special no-surplus form) support fixed or time-varying coding schemes with replication options. Convergence guarantees are established for both static and time-varying networks, leveraging stochastic indecomposable-aperiodic (SIA) matrices and careful spectral analysis of the update operators; the convergence rate depends on the coding structure, with a reported rate of for common step sizes. Simulation results on convex problems and neural-network-scale MNIST experiments show that FLUE can match or surpass traditional distributed gradient methods under appropriate coding-data alignment, while providing encryption-free privacy through coded updates and proxy-weight privacy. This work suggests a scalable, privacy-conscious alternative to encryption in federated settings, with avenues for stronger zero-coordination privacy and randomized encoding in future work.

Abstract

Federated Learning enables diverse devices to collaboratively train a shared model while keeping training data locally stored, avoiding the need for centralized cloud storage. Despite existing privacy measures, concerns arise from potential reverse engineering of gradients, even with added noise, revealing private data. To address this, recent research emphasizes using encrypted model parameters during training. This paper introduces a novel federated learning algorithm, leveraging coded local gradients without encryption, exchanging coded proxies for model parameters, and injecting surplus noise for enhanced privacy. Two algorithm variants are presented, showcasing convergence and learning rates adaptable to coding schemes and raw data characteristics. Two encryption-free implementations with fixed and random coding matrices are provided, demonstrating promising simulation results from both federated optimization and machine learning perspectives.
Paper Structure (49 sections, 21 theorems, 147 equations, 6 figures, 1 algorithm)

This paper contains 49 sections, 21 theorems, 147 equations, 6 figures, 1 algorithm.

Key Result

Lemma 1

The matrix $\hat{\bf A}$ is row stochastic with simple eigenvalue one.

Figures (6)

  • Figure 1: Absolute and consensus errors vs iteration of FLUE and DGD with fixed coding matrices $\bar{\bf A}^{l}$ using FLUE \ref{['fixedQepsT']} on a $5$-node network
  • Figure 2: Test Accuracy per iterations for FedAvg algorithm with $E = 5$ epochs and batchsize $B = \{10, 100, 1000, 1000 \}$ on MNIST dataset.
  • Figure 3: Test Accuracy per iterations for FLUE algorithm with $E = 5$ epochs and batchsize $B = \{10, 100, 1000, 1000 \}$ on MNIST dataset.
  • Figure 4: Absolute and consensus errors vs iteration of FLUE and DGD for with random coding matrices $\bar{\bf A}^{l}$ using FLUE \ref{['varyingQepsT']} on a $5$-node network
  • Figure 5: Absolute and consensus errors vs iteration of FLUE and DGD with fixed coding matrices $\bar{\bf A}^{l}$ using FLUE \ref{['fixedQepsT']} on a $7$-node network
  • ...and 1 more figures

Theorems & Definitions (44)

  • Remark 1
  • Definition 1
  • Definition 2
  • Definition 3
  • Definition 4
  • Definition 5
  • Remark 2
  • Remark 3
  • Remark 4
  • Lemma 1
  • ...and 34 more