Pith. sign in

REVIEW 1 cited by

On the Regret of Recursive Methods for Discrete-Time Adaptive Control with Matched Uncertainty

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2404.02023 v3 pith:RJWA4MEZ submitted 2024-04-02 eess.SY cs.SY

On the Regret of Recursive Methods for Discrete-Time Adaptive Control with Matched Uncertainty

classification eess.SY cs.SY
keywords adaptivecontrolleruncertaintyconditiondiscrete-timeexcitationmatchedmethods
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Continuous-time adaptive controllers for systems with a matched uncertainty often comprise an online parameter estimator and a corresponding parameterized controller to cancel the uncertainty. However, such methods are often impossible to implement directly, as they depend on an unobserved estimation error. We consider the equivalent discrete-time setting with a causal information structure, and propose a novel, online proximal point method-based adaptive controller, that under a sufficient excitation (SE) condition is asymptotically stable and achieves finite regret, scaling only with the time required to fulfill the SE. We show the same also for the widely-used recursive least squares with exponential forgetting controller under a stronger persistence of excitation condition.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Self-Adaptive Learning and Model Predictive Control for Tracking Unknown Dynamics with No Regret

    cs.RO 2026-07 conditional novelty 6.0

    A self-adaptive MPC with multiple online-learned RFF predictors and Hedge-based selection achieves O(T^{3/4}) expected regret for tracking unknown, switching target dynamics.