Pith. sign in

REVIEW 1 cited by

On the impact of regularization in data-driven predictive control

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 2304.00263 v2 pith:EYCLDVPL submitted 2023-04-01 eess.SY cs.SY

On the impact of regularization in data-driven predictive control

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

Model predictive control (MPC) is a control strategy widely used in industrial applications. However, its implementation typically requires a mathematical model of the system being controlled, which can be a time-consuming and expensive task. Data-driven predictive control (DDPC) methods offer an alternative approach that does not require an explicit mathematical model, but instead optimize the control policy directly from data. In this paper, we study the impact of two different regularization penalties on the closed-loop performance of a recently introduced data-driven method called $\gamma$-DDPC. Moreover, we discuss the tuning of the related coefficients in different data and noise scenarios, to provide some guidelines for the end user.

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. Projection-Regularized Indirect Data-Driven Predictive Control

    eess.SY 2026-07 conditional novelty 6.0

    Projection-regularized indirect DPC reduces EIV prediction error versus SPC, adapts via covariance blending, and yields high-probability recursive feasibility and ISpS under martingale noise bounds.