AI Paper Atlas

Research map / Bandits and online learning / Online convex optimization and games

Online Learning under Adversarial Nonlinear Constraints

Pavel Kolev, Georg Martius, Michael Muehlebach

NeurIPS 2023 · Bandits and online learning › Online convex optimization and games · approach: Online learning with feedback graphs · 0 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
Replace Online Gradient Descent full projection with CVV-Pro velocity projection using only violated constraintsonline constrained learner · Two-player game with shared resourcesaverage runtime per iteration (s): 0.18 -> 0.11Improved
Replace OGD with CVV-Proonline constrained learner · Two-player game with shared resourcesregret vs 5 sqrt(t)Improved
Run CVV-Pro with random problem instances (n=100, m=10, T=4000)CVV-Pro · Two-player game, 5 sampled instancesregret, constraint violation, averaged decisions rateImproved

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