Research map / Bandits and online learning / Online convex optimization and games
Decentralized Online Convex Optimization with Efficient Communication: Improved Algorithm and Lower Bounds
Sifan Yang, Wenhao Yang, Wei Jiang, Lijun Zhang
Read the paperCheck your idea against 137,217 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
- Distributed Online Convex Optimization with Compressed Communication: Optimal Regret and Applications (NeurIPS 2026 · similarity 0.95)
- Revisiting Decentralized Online Convex Optimization with Compressed Communication (NeurIPS 2026 · similarity 0.93)
- A Reduction from Delayed to Immediate Feedback for Online Convex Optimization with Improved Guarantees (NeurIPS 2026 · similarity 0.90)
- Towards Faster Decentralized Stochastic Optimization with Communication Compression (ICLR 2025 · similarity 0.90)
- Revisiting Differentially Private Algorithms for Decentralized Online Learning (ICML 2025 · similarity 0.89)
- Small-loss Adaptive Regret for Online Convex Optimization (ICML 2024 · similarity 0.89)
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.
