Learning-Augmented Control: Adaptively Confidence Learning for Competitive MPC

We introduce Learning-Augmented Control (LAC), an approach that integrates untrusted machine learning predictions into the control of constrained, nonlinear dynamical systems. LAC is designed to achieve the "best-of-both-worlds" guarantees, i.e, near-optimal performance when predictions are accurate, and robust, safe performance when they are not. The core of our approach is a delayed confidence learning procedure that optimizes a confidence parameter online, adaptively balancing between ML and nominal predictions. We establish formal competitive ratio bounds for general nonlinear systems under standard MPC regularity assumptions. For the linear quadratic case, we derive a competitive ratio bound that is provably tight, thereby characterizing the fundamental limits of this learning-augmented approach. The effectiveness of LAC is demonstrated in numerical studies, where it maintains stability and outperforms standard methods under adversarial prediction errors.

Authors

Publication Details

Journal
ArXiv.org
Published
2025-07-19
Primary Topic
Adaptive Dynamic Programming Control
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Learning-Augmented Control: Adaptively Confidence Learning for Competitive MPC

Tongxin Li
ArXiv.org
Adaptive Dynamic Programming Control
article

Learning-Augmented Control: Adaptively Confidence Learning for Competitive MPC

Tongxin Li
article en

Abstract

We introduce Learning-Augmented Control (LAC), an approach that integrates untrusted machine learning predictions into the control of constrained, nonlinear dynamical systems. LAC is designed to achieve the "best-of-both-worlds" guarantees, i.e, near-optimal performance when predictions are accurate, and robust, safe performance when they are not. The core of our approach is a delayed confidence learning procedure that optimizes a confidence parameter online, adaptively balancing between ML and nominal predictions. We establish formal competitive ratio bounds for general nonlinear systems under standard MPC regularity assumptions. For the linear quadratic case, we derive a competitive ratio bound that is provably tight, thereby characterizing the fundamental limits of this learning-augmented approach. The effectiveness of LAC is demonstrated in numerical studies, where it maintains stability and outperforms standard methods under adversarial prediction errors.

ArXiv.org
Openalex Percentile: Top 63%
Adaptive Dynamic Programming Control
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.