Research map / Federated learning and privacy / Communication-efficient FL
Federated Compositional Deep AUC Maximization
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
- A Federated Stochastic Multi-level Compositional Minimax Algorithm for Deep AUC Maximization (ICML 2024 · similarity 0.95)
- On the Convergence of Local Stochastic Compositional Gradient Descent with Momentum (ICML 2022 · similarity 0.89)
- A Doubly Recursive Stochastic Compositional Gradient Descent Method for Federated Multi-Level Compositional Optimization (ICML 2024 · similarity 0.89)
- LS$^{2}$MC-GDA: A Smoothed Algorithm for Federated Stochastic Multi-Level Compositional Minimax Optimization (ICML 2026 · similarity 0.89)
- A Near-Optimal Single-Loop Stochastic Algorithm for Convex Finite-Sum Coupled Compositional Optimization (ICML 2025 · similarity 0.85)
- Communication-Efficient Gradient Descent-Accent Methods for Distributed Variational Inequalities: Unified Analysis and Local Updates (ICLR 2024 · similarity 0.84)
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.