List your company

Online Convex Optimization on Online Convex Optimization Theoretical

1Constraint ViolationLi et al
0.921.4622.54Mar 22, 2026

Evaluation results

MethodLinks
Li et alConstraints=affine (static), Loss=convex, Memory (Obj.)=true, Memory (Constr.)=true, Predictions=false2026.031—
Lekeufack et alConstraints=adversarial, Loss=convex, Memory (Obj.)=false, Memory (Constr.)=false, Predictions=true2026.031—
This workConstraints=adversarial, Loss=convex, Memory (Obj.)=true, Memory (Constr.)=false, Predictions=true2026.031—
This workConstraints=ad. separable, Loss=ad. separable, Memory (Obj.)=true, Memory (Constr.)=false, Predictions=true2026.031—
This workConstraints=ad. separable, Loss=ad. separable, Memory (Obj.)=true, Memory (Constr.)=true, Predictions=true2026.031—
Liu et alConstraints=adversarial, Loss=convex, Memory (Obj.)=true, Memory (Constr.)=true, Predictions=false2026.0322
This workConstraints=adversarial, Loss=convex, Memory (Obj.)=true, Memory (Constr.)=false, Predictions=false2026.0333
This workConstraints=adversarial, Loss=convex, Memory (Obj.)=true, Memory (Constr.)=true, Predictions=false2026.0333
Anava et alConstraints=none, Loss=convex, Memory (Obj.)=true, Memory (Constr.)=false, Predictions=false2026.03—3