Skip to content
Preprint

How Much Regularization Survives Averaging? Update Masking in Federated Learning

Aug 2026 · 0 citations · 11 references
Computer Science

TL;DR

It is proved that when each client draws its own mask, federated averaging weakens that charge by exactly the cohort size, and that giving every client the same mask brings it back by a factor equal to the inverse gradient diversity of the cohort.

Abstract

Federated learning on non-IID data seeks flat minima to generalize across clients, and existing methods borrow sharpness-aware minimization from centralized training. There is a second way to reach flat minima, in which the regularization comes for free from noise added to the parameter updates, and it has never been carried over to the federated setting as an implicit regularizer. We show the reason. Masking charges the optimizer for moving in sharp directions. We prove that when each client draws its own mask, federated averaging weakens that charge by exactly the cohort size, and that giving every client the same mask brings it back by a factor equal to the inverse gradient diversity of the cohort. In our experiment setting on CIFAR-10, that factor is 1.19 out of a possible 10. Turning off minibatch sampling raises it to 8.96, while changing data heterogeneity a thousandfold leaves it between 1.17 and 1.50. The configurations keeping the regularization train far too poorly to use.

View source

Similar papers

#machine learning Preprint Sep 2026

Beyond Conventional Federated Learning via High-Order Regularization

HiFedProx is introduced, which replaces the quadratic penalty with a scale-matched power-type regularizer indexed by p, and combines this geometry with finite-budget stochastic client optimization and same-minibatch Armijo backtracking.

Alireza Kabgani, Masoud Ahookhosh · 0 citations
#machine learning Preprint Sep 2026

FedeRage: Provably Convergent Agnostic Federated Learning under General Client Drift

Federated learning (FL) enables collaborative model training without sharing raw data, but its performance degrades under non-IID data and stochastic client participation. Remedies built on classical Federated Averaging (FedAvg) typically presuppose that client participation probabilities are known to the server, which...

Herlock Rahimi, Dionysis Kalogerias · 0 citations
#machine learning Preprint Aug 2026

Coordination on a Budget: Federated Active Learning with Few Labels

A new FAL framework is proposed that utilizes federated representation learning to align client data in a shared embedding space that achieves performance that surpasses existing FAL methods even when they are given substantially larger annotation budgets, demonstrating the value of centralized coordination under priva...

Liam Mohr, D. Weinshall · 0 citations
#machine learning Preprint Sep 2026

Byzantine-Robust Federated Representation Learning

We study federated learning (FL) with adversarial clients, where the goal is to minimize the average loss of the honest (non-adversarial) clients without knowing their identity. Under heterogeneity, a single shared model parameter is statistically inappropriate: it cannot capture the distinct data-generating processes...

L. F. Toso, James Anderson, Rafael Pinot et al. · 0 citations
#machine learning Preprint Aug 2026

Capacity Confounds and Coverage Guarantees in Adaptive Sub-model Federated Learning

Sub-model federated learning lets resource-constrained clients train width-reduced versions of a global model, but existing methods allocate capacity by device resources alone. A natural next step, allocating capacity by each client's data heterogeneity as estimated from the updates the server already observes, has bee...

Alireza Moayedikia, A. T. Lora · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.