atlas

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

A Regret Minimization Approach to Iterative Learning Control

ICML 2021 · Bandits and online learning › Online convex optimization and games · approach: Online linear-quadratic control regret · 3 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
Replace ILC policy update with iGPC (gradient perturbation controller with open-loop plan update)iterative learning control on linear and non-linear systems · Double Integrator, Quadrotor, Reacherrollouts needed to reach loss / terminal costHelped
Use gradient perturbation (disturbance-action feedback) controller with rollout-adaptive feedback versus ILC on sinusoidal time-varying perturbations with phase shiftsiGPC vs ILC on Double Integrator · Double Integrator sinusoidal perturbationscostHelped
Use gradient perturbation controller vs ILC with gradually increasing offsetsiGPC vs ILC on Double Integrator · Double Integrator gradually increasing offsetscostNo clear effect
Use iGPC vs ILC with constant offsetsiGPC vs ILC on Double Integrator · Double Integrator constant offsetcost on first rolloutHelped

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