Research map / Federated learning and privacy / Communication-efficient FL

SAGDA: Achieving $\mathcal{O}(\epsilon^{-2})$ Communication Complexity in Federated Min-Max Learning

NeurIPS 2022 · Federated learning and privacy › Communication-efficient FL · approach: Federated optimization algorithms

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Closest papers by meaning

• Solving a Class of Non-Convex Minimax Optimization in Federated Learning (NeurIPS 2023 · similarity 0.93)
• SCAFFLSA: Taming Heterogeneity in Federated Linear Stochastic Approximation and TD Learning (NeurIPS 2024 · similarity 0.90)
• Federated Learning under Periodic Client Participation and Heterogeneous Data: A New Communication-Efficient Algorithm and Analysis (NeurIPS 2024 · similarity 0.88)
• Decentralized Sporadic Federated Learning: A Unified Algorithmic Framework with Convergence Guarantees (ICLR 2025 · similarity 0.88)
• The Sample-Communication Complexity Trade-off in Federated Q-Learning (NeurIPS 2024 · similarity 0.88)
• Exact and Linear Convergence for Federated Learning under Arbitrary Client Participation is Attainable (NeurIPS 2025 · similarity 0.87)