# Communication-Efficient Federated AUC Maximization with Cyclic Client Participation

Source: [Communication-Efficient Federated AUC Maximization with Cyclic Client Participation](<https://www.sota2.com/research/paper/695c96ea53fdd5c361743514>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2026-01-07T05:00:04.583Z

Authors: Umesh Vangapally, Wenhan Wu, Chen Chen, Zhishuai Guo

Published: 2026-01-04T19:57:41.000Z

## Abstract

Federated AUC maximization is a powerful approach for learning from imbalanced data in federated learning (FL). However, existing methods typically assume full client availability, which is rarely practical. In real-world FL systems, clients often participate in a cyclic manner: joining training according to a fixed, repeating schedule. This setting poses unique optimization challenges for the non-decomposable AUC objective. This paper addresses these challenges by developing and analyzing communication-efficient algorithms for federated AUC maximization under cyclic client participation. We investigate two key settings: First, we study AUC maximization with a squared surrogate loss, which reformulates the problem as a nonconvex-strongly-concave minimax optimization. By leveraging the Polyak-{\\L}ojasiewicz (PL) condition, we establish a state-of-the-art communication complexity of $\\widetilde{O}(1/\\epsilon^{1/2})$ and iteration complexity of $\\widetilde{O}(1/\\epsilon)$. Second, we consider general pairwise AUC losses. We establish a communication complexity of $O(1/\\epsilon^3)$ and an iteration complexity of $O(1/\\epsilon^4)$. Further, under the PL condition, these bounds improve to communication complexity of $\\widetilde{O}(1/\\epsilon^{1/2})$ and iteration complexity of $\\widetilde{O}(1/\\epsilon)$. Extensive experiments on benchmark tasks in image classification, medical imaging, and fraud detection demonstrate the superior efficiency and effectiveness of our proposed methods.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2601.01649>)

[PDF](<https://arxiv.org/pdf/2601.01649.pdf>)
