An introduction to online nonstochastic control that applies online convex optimization and convex relaxations to achieve low regret against the best hindsight policy in adversarial settings for classical control problems.
A regret minimization approach to iterative learning control
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2022 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Introduction to Online Control
An introduction to online nonstochastic control that applies online convex optimization and convex relaxations to achieve low regret against the best hindsight policy in adversarial settings for classical control problems.