Research map / Federated learning and privacy / Communication-efficient FL
Non-Convex Federated Optimization under Cost-Aware Client Selection
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
- Federated Optimization with Doubly Regularized Drift Correction (ICML 2024 · similarity 0.89)
- Stabilized Proximal-Point Methods for Federated Optimization (NeurIPS 2024 · similarity 0.89)
- SILVER: Single-loop variance reduction and application to federated learning (ICML 2024 · similarity 0.88)
- Faster Rates For Federated Variational Inequalities (NeurIPS 2026 · similarity 0.88)
- Methods with Local Steps and Random Reshuffling for Generally Smooth Non-Convex Federated Optimization (ICLR 2025 · similarity 0.88)
- Communication-Efficient Federated Non-Linear Bandit Optimization (ICLR 2024 · similarity 0.88)
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.