Research map / Optimization / Nonconvex and smooth optimization
LS$^{2}$MC-GDA: A Smoothed Algorithm for Federated Stochastic Multi-Level Compositional Minimax Optimization
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 Doubly Recursive Stochastic Compositional Gradient Descent Method for Federated Multi-Level Compositional Optimization (ICML 2024 · similarity 0.92)
- On the Convergence of Local Stochastic Compositional Gradient Descent with Momentum (ICML 2022 · similarity 0.90)
- A Federated Stochastic Multi-level Compositional Minimax Algorithm for Deep AUC Maximization (ICML 2024 · similarity 0.90)
- How Does Black-Box Impact the Learning Guarantee of Stochastic Compositional Optimization? (NeurIPS 2024 · similarity 0.87)
- Scaffold with Stochastic Gradients: New Analysis with Linear Speed-Up (ICML 2025 · similarity 0.87)
- Faster Stochastic Variance Reduction Methods for Compositional MiniMax Optimization (AAAI 2024 · similarity 0.86)
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.