Research map / Federated learning and privacy / Communication-efficient FL
Taming Fat-Tailed (“Heavier-Tailed” with Potentially Infinite Variance) Noise in Federated Learning
Haibo Yang, Peiwen Qiu, Jia Liu
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Add clipping of client updates once per communication round | FedAvg-style federated learning · Synthetic strongly convex objective with Cauchy-tailed noise | convergence | Improved |
| Clip gradients before each local update instead of clipping the accumulated update once per round (ablation) | FAT-Clipping-PR · Synthetic strongly convex objective with Cauchy-tailed noise | convergence speed | Improved |
| Clip gradients before each local update | FedAvg-style federated learning · CIFAR-10 non-i.i.d. (p=2) | successful training rate: fails in all 5 trials -> 100% | Improved |
| Clip gradients before each local update | FedAvg-style federated learning · CIFAR-10 i.i.d. (p=10) | successful training rate: fails in all 5 trials -> 100% | Improved |
| Clip gradients before each local update rather than clipping accumulated updates once per round (ablation) | FAT-Clipping-PR · CIFAR-10 non-i.i.d. (p=2) | successful training rate: 60% -> 100% | Improved |
| Clip gradients before each local update rather than clipping accumulated updates once per round (ablation) | FAT-Clipping-PR · CIFAR-10 i.i.d. (p=10) | successful training rate: 20% -> 100% | Improved |
| Apply clipping with per-round updates in the non-fat-tailed case (α=2) (ablation) | FAT-Clipping-PR · Strongly convex and nonconvex objectives with non-fat-tailed noise | convergence rate relative to FedAvg | No clear effect |
| Apply clipping with per-iteration updates in the non-fat-tailed case (α=2) (ablation) | FAT-Clipping-PI · Strongly convex and nonconvex objectives with non-fat-tailed noise | convergence rate relative to FedAvg | No clear effect |
Closest papers by meaning
- Efficient Distributed Optimization under Heavy-Tailed Noise (ICML 2025 · similarity 0.87)
- Improving Generalization in Federated Learning with Highly Heterogeneous Data via Momentum-Based Stochastic Controlled Weight Averaging (ICML 2025 · similarity 0.86)
- FedDiv: Collaborative Noise Filtering for Federated Learning with Noisy Labels (AAAI 2024 · similarity 0.86)
- Exact and Linear Convergence for Federated Learning under Arbitrary Client Participation is Attainable (NeurIPS 2025 · similarity 0.86)
- Federated Learning with Extremely Noisy Clients via Negative Distillation (AAAI 2024 · similarity 0.86)
- FedWMSAM: Fast and Flat Federated Learning via Weighted Momentum and Sharpness-Aware Minimization (NeurIPS 2025 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
