AI Paper Atlas

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

Safe Online Convex Optimization with Unknown Linear Safety Constraints

AAAI 2022 · Bandits and online learning › Online convex optimization and games · approach: Constrained and unconstrained OCO algorithms · 14 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 SO-PGD with safe exploration and a conservative safe-set estimateonline convex optimization with unknown linear safety constraints · f1 simulationR(t)/t^(2/3): ~20Mixed
Use SO-PGD with safe exploration and a conservative safe-set estimateonline convex optimization with unknown linear safety constraints · f2 simulationR(t)/t^(2/3): ~4Mixed
Replace the conservative safe-set estimate with a naive least-squares safe-set estimate (ablation)SO-PGD · linear safety constraintssafetyHurt
Use SO-PGD for data center scheduling with unknown safety constraintsdata center scheduling · Data center schedulingconstraint violations: zero violationsHelped

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