Research map / Bandits and online learning / Online convex optimization and games
Online Convex Optimization Over Erdos-Renyi Random Networks
Jinlong Lei, Peng Yi, Yiguang Hong, Jie Chen, Guodong Shi
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use two-point bandit feedback instead of one-point bandit feedback (ablation) | distributed online convex optimization · bodyfat regression, N=30, p=0.2 | rescaled maximum regret SReg(T) | Improved |
| increase Erdos-Renyi link probability p from 0.1 to 0.9 (ablation) | distributed online algorithms · bodyfat, T=200, N=50 | maximum regret MReg | Improved |
| add strong convexity (mu=1) to the loss (ablation) | one-point bandit algorithm · bodyfat, N=30, p=0.2 | SReg(T) in early steps | Mixed |
Closest papers by meaning
- Decentralized Online Convex Optimization with Efficient Communication: Improved Algorithm and Lower Bounds (ICML 2026 · similarity 0.91)
- Optimal and Efficient Algorithms for Decentralized Online Convex Optimization (JMLR 2025 · similarity 0.90)
- Distributed Online Convex Optimization with Compressed Communication: Optimal Regret and Applications (NeurIPS 2026 · similarity 0.89)
- Distributed Multi-Agent Bandits Over Erdős-Rényi Random Networks (NeurIPS 2025 · similarity 0.88)
- Small-loss Adaptive Regret for Online Convex Optimization (ICML 2024 · similarity 0.88)
- From Average Sensitivity to Small-Loss Regret Bounds under Random-Order Model (NeurIPS 2026 · 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.
