Research map / Optimization / Nonconvex and smooth optimization
A Communication-efficient Algorithm with Linear Convergence for Federated Minimax Learning
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.91)
- Federated Minimax Optimization: Improved Convergence Analyses and Algorithms (ICML 2022 · similarity 0.91)
- Jointly Improving the Sample and Communication Complexities in Decentralized Stochastic Minimax Optimization (AAAI 2024 · similarity 0.87)
- Communication-Efficient Federated Group Distributionally Robust Optimization (NeurIPS 2024 · similarity 0.87)
- Multiplayer Federated Learning: Reaching Equilibrium with Less Communication (NeurIPS 2025 · similarity 0.87)
- Communication-Efficient Gradient Descent-Accent Methods for Distributed Variational Inequalities: Unified Analysis and Local Updates (ICLR 2024 · similarity 0.87)
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.