eess.SYJan 23, 2026

ReLU Networks for Model Predictive Control: Network Complexity and Performance Guarantees

Authors: Xingchen Li, Keyou You

Organizations: Department of Automation, and Beijing National Research Center for Info. Sci. & Tech. (BNRist), Tsinghua University, Beijing 100084, China.

Abstract

Recent years have witnessed a resurgence in using ReLU neural networks (NNs) to represent model predictive control (MPC) policies. However, determining the sufficient network complexity to ensure closed-loop guarantees remains a fundamental open problem. This involves a critical precision-complexity trade-off: undersized networks may fail to capture the MPC policy, while oversized ones may outweigh the benefits of ReLU network approximation. In this work, we project the MPC actions onto a tightened constraint set to satisfy the hard constraints, and establish a state-dependent Lipschitz continuity property for the optimal MPC cost function, which enables sharp convergence analysis of the closed-loop system. For the first time, we derive explicit bounds on ReLU network width and depth for approximating MPC policies with closed-loop guarantees. To reduce network complexity for the convergence to user-specified target sets, we propose a non-uniform error framework with a state-aware scaling function to adaptively adjust both the input and output of the ReLU network. Our contributions provide a foundational step toward certifiable ReLU NN-based MPC.

Figures & tables

Explore similar work

CardsList
  1. Certified Neural Approximation of Robust Nonlinear Model Predictive Control

    Oct 21, 2026Hendrik Alsmeier, Maik Pfefferkorn, Rolf FindeisenNeural Network ControlNonlinear MPC

  2. Optimal Control with Learned Critics under Unmodeled State Dependencies

    Oct 4, 2026Philipp Schoch, Markus RyllResidual Dynamics LearningRobot Dynamics Learning