FedAVOT: Exact Distribution Alignment in Federated Learning via Masked Optimal Transport
Not on the map. Why?
Abstract (arXiv)
Federated Learning (FL) allows distributed model training without sharing raw data, but suffers when client participation is partial. In practice, the distribution of available users (availability distribution q) rarely aligns with the distribution defining the optimization objective (importance distribution p), leading to biased and unstable updates under classical FedAvg. We propose textbfFereated AVerage with Optimal Transport (FedAVOT), which formulates aggregation as a masked optimal transport problem aligning q and p. Using Sinkhorn scaling, FedAVOT computes transport-based aggregation weights with provable convergence guarantees. FedAVOT achieves a standard O(1/√T) rate under a nonsmooth convex FL setting, independent of the number of participating users per round. Our experiments confirm drastically improved performance compared to FedAvg across heterogeneous, fairness-sensitive, and low-availability regimes, even when only two clients participate per round.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 18 of its 28 references that are in the map. First posted on arXiv 17 Sep 2025.
Builds on
18 of 28 references.
References · 18
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
- 2019Advances and Open Problems in Federated Learningcited by 3,046
- 2018Federated Optimization in Heterogeneous Networkscited by 2,987
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
- 2019On the Convergence of FedAvg on Non-IID Datacited by 1,229
- 2018Federated Learning with Non-IID Datacited by 1,108
- 2020Tackling the Objective Inconsistency Problem in Heterogeneous Federated Optimizationcited by 906
- 2019Towards Federated Learning at Scale: System Designcited by 832
- 2018Computational Optimal Transportcited by 780
- 2019Agnostic Federated Learningcited by 456
- 2019Fair Resource Allocation in Federated Learningcited by 394
- 2020Optimal Client Sampling for Federated Learningcited by 124
6 more
- 2022Federated Learning Under Intermittent Client Availability and Time-Varying Communication Constraintscited by 30
- 2020Optimal Importance Sampling for Federated Learningcited by 20
- 2022FedGS: Federated Graph-based Sampling with Arbitrary Client Availabilitycited by 10
- 2023Federated Learning Under Restricted User Availabilitycited by 4
- 2025The Stochastic Multi-Proximal Method for Nonsmooth Optimizationcited by 3
- 2025Convergence of Agnostic Federated Averagingcited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.