arXiv Machine Learning By Ali Reza Daneshvar Garmroodi, Jan Drgo\v{n}a

SD-DPC: Sparse Dictionary Differentiable Predictive Control

Read the original on arXiv Machine Learning →

The paper introduces SD‑DPC, a method that learns sparse, interpretable feedback policies for nonlinear systems using data. It first identifies a prediction model via rollout‑based sparse identification of nonlinear dynamics (SINDy), then parameterizes the policy as a sparse combination of dictionary functions and trains it by differentiating a constrained finite‑horizon predictive‑control objective. The resulting explicit feedback law contains only a few terms, satisfies constraints across three benchmark problems, outperforms a distilled policy by up to an order of magnitude, and requires far less memory and online computation than an optimization benchmark while providing explicit sensitivity bounds.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Oct 12

A Scalable Learned Iterative Solver for Nonlinear MPC via Temporal Decomposition

The paper presents a scalable learned iterative solver for nonlinear model predictive control (NMPC) that removes dependence on the prediction horizon by exploiting temporal decomposition in the network architecture. It introduces a closed‑loop resampling strategy to align training with deployment, achieving up to four‑fold speedups over IPOPT while maintaining comparable control performance and avoiding constraint violations. The method outperforms the previous monolithic LISCO approach on a CSTR cascade benchmark, scaling to larger problems without increasing network size.

By Lukas L\"uken, Sergio Lucia
Hugging Face Trending Papers
Jul 14

Learning-enabled Acceleration of Scenario-based Model Predictive Control

Scenario-based model predictive control (SBMPC) is a variant of model predictive control (MPC) that explicitly accounts for uncertainty by optimizing control actions over multiple predicted scenarios. However, its computational complexity increases rapidly with the number of scenarios and prediction horizon, limiting is applicability to real-time planning and control.