AI Paper Atlas

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

NeurIPS 2020 · Bandits and online learning › Online convex optimization and games · approach: Constrained and unconstrained OCO algorithms · 4 citations (OpenAlex)

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 changedWhereMeasuredEffect
use two-point bandit feedback instead of one-point bandit feedback (ablation)distributed online convex optimization · bodyfat regression, N=30, p=0.2rescaled 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=50maximum regret MRegImproved
add strong convexity (mu=1) to the loss (ablation)one-point bandit algorithm · bodyfat, N=30, p=0.2SReg(T) in early stepsMixed

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy