Skip to content

SWB-DM: A Calibrated Sliced-Wasserstein-Barycenter Aggregator with Delayed-Momentum Caching for Byzantine-Robust Federated Learning under Partial Participation

Sep 2026 · 0 citations · 12 references
Computer Science

TL;DR

SWB-DM's cache carries a real warm-up cost, but extending all baselines to the same round budget shows its CIFAR-10 gains are disproportionately large, and on CIFAR-100, FLTrust benefits more -- for reasons entirely unrelated to caching.

Abstract

Robust aggregation methods for federated learning quietly rest on a fragile assumption: that whoever shows up in a given round is a fair sample of the full population. In practice, they rarely are. When only a handful of clients participate per round, even a modest fraction of adversaries can dominate that sample and silently invalidate the finite-sample guarantees that coordinate-wise median, Krum, Bulyan, and trimmed mean all depend on. We introduce SWB-DM to address this directly. SWB treats each slice of a client update as a one-dimensional distribution, computes a trimmed Wasserstein barycenter across clients, and recovers coordinate identity via a medoid-based gauge-fixing step -- a heuristic we developed and do not claim it belongs to standard optimal-transport theory. DeMoA-style delayed momentum then caches updates across the full client population each round, decoupling robustness from whoever happened to be sampled. Trim ratio calibration is not cosmetic: under-trimming causes collapse at corruption levels a properly calibrated model survives. Across 448 CIFAR-10 configurations, plus CIFAR-100, FEMNIST, and a 500-client scalability run, we find several mechanistically distinct failure modes. Even-sample coordinate-wise median degrades to a deterministic wrong answer. Krum silently violates its own n greater than 2f+2 precondition and diverges without warning. Bulyan's n greater than or equal to 4f+3 threshold produces a sharp pass/fail boundary. On attacks, IPM defeats order-statistic defenses -- including SWB -- more reliably than ALIE, confirmed through delta-space measurements against a convergence bound. SWB-DM's cache carries a real warm-up cost, but extending all baselines to the same round budget shows its CIFAR-10 gains are disproportionately large. On CIFAR-100, FLTrust benefits more -- for reasons entirely unrelated to caching.

View source

Similar papers

2026

Selective Tensor Freezing for Efficient Fine-Tuning in Resource-Constrained Federated Learning

Fine-tuning remains essential for adapting large models to diverse downstream tasks, yet doing so in a privacy-preserving and resource-efficient manner is challenging, particularly in federated learning (FL) on edge devices. Parameter tensor freezing is a promising solution. However, current methods face key limitation...

Zhong-Xiang Wei, Zhi-Xiong Zhang, Yi-Peng Zhou et al. · 0 citations
Conference Aug 2026

Federated Learning Architectures and Communication-Efficient Optimisation for Privacy-Preserving Distributed AI Systems

Federated learning (FL) trains a shared model across data holders that cannot pool their records, but deployments remain bounded by three coupled costs: uplink traffic from repeated model exchange, accuracy loss under statistically heterogeneous clients, and the information that updates still leak. These are usually at...

Harshavardhan Peddireddy, Sandeep Kumar Gadde, Prasad Bheemavarapu et al. · 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

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

Related blog posts

Microsoft Research Blog Nov 3, 2026

Learn the rules: The hacker mindset

Research Manager Mike Walker reflects on a career spanning hacker culture, cybersecurity, and AI, sharing lessons about trust, teamwork, leadership, and why solving difficult problems requires curiosity, judgment, agility—and an understanding of the rules. The post Learn the rules: The hacker mindset appeared first on Microsoft Research.

Google DeepMind Blog Nov 3, 2026

Agentic cheminformatics with Google Antigravity

Learn how Google Antigravity and our Cheminformatics Skills accelerate drug discovery workflows, search compounds, and propose novel rigidified macrocycles.

GPT-Lab Oct 30, 2026

Black October? The Week AI Changed the Cybersecurity Conversation

Critical flaws, compromised release channels and agentic AI threats landed within days of each other in mid-October 2026. Why “Black October” may say more about how well we now find weaknesses than about the attacks themselves. The post Black October? The Week AI Changed the Cybersecurity Conversation appeared first on GPT-Lab.

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