AI Paper Atlas

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

Online Optimal Control with Affine Constraints

AAAI 2021 · Bandits and online learning › Online convex optimization and games · approach: Constrained and unconstrained OCO algorithms · 24 citations (OpenAlex)

Read the paperCheck your idea against 108,967 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.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use a larger buffer zone (0.4 instead of 0.04) (ablation)OGD-BZ · HVAC thermal controlregretHurt
Use a larger buffer zone (0.4 instead of 0.04) (ablation)OGD-BZ · HVAC thermal controlstate range from constraintsHelped
Use a larger buffer zone (0.4 instead of 0.04) (ablation)OGD-BZ · HVAC thermal controlaction rangeHurt
Add buffer zones to the policy search constraintsOGD-BZ · Constrained online optimal controlrobust constraint satisfactionHelped
Increase the buffer sizeOGD-BZ · Constrained online optimal controlpolicy regret upper boundHurt
Use a sufficiently small OGD stepsizeOGD-BZ · Constrained online optimal controlrobust constraint satisfactionHelped
Use a larger OGD stepsizeOGD-BZ · Constrained online optimal controlpolicy regretHelped

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