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.
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
Fig. 1: Illustration of the main challenges and our analytical approach.
Fig. 2: Combinations of nw′ and nd′ satisfying ( 19 ).
Fig. 3: The state-aware scaling approach. The definitions of umpc(⋅) and unn(⋅) are given in ( 28 ) and ( 24 ), respectively.
Fig. 4: An example of β(x)=δ2(x)/δˉ and the input scaling function T(x) .
Fig. 5: An example of umpc(⋅) , umpc(⋅) and unn(⋅) . The shaded area in subfigure (c) represents the admissible error bound δ2(x) .
∥A∥
1.618
γ
185.9
c3
1.000
∥B∥
1.118
D(Xinv)
10.95
c4
56.84
d(U)
1
d(Xinv)
3.426
c5
246.9
D(U)
1
c0
70.39
c6
7.652×105
Lu
1.412
c1
1.069
c7
1.143×10−3
γmax
187.7
c2
15.83
δˉ
7.793×10−3
TABLE I: Constants of Theorem 1 for the system ( 34 ), with γ=0.99γmax .
Fig. 6: Sketch of the oscillating masses system [ 48 , 24 ] , with the damping not shown.
Fig. 7: Closed loop of the certified network for the system ( 34 ): 60 trajectories (blue) started at 0.97 of the boundary of Xinv (black), the set V(c6δ12) of Lemma 3 (red dashed), and the region on which the MPC input is saturated (grey).
Fig. 8: Decay of vmpc(xk) along the 60 trajectories of Fig. 7 (blue), the bound c6δ12+qkγ of Lemma 3 (dashed) and the level c6δ12 (dotted).
Fig. 9: Error ∥unn(x)−umpc(x)∥ of the two networks on the test states against ∥x∥ , for d=0.1 and d=0.001 . The dashed line is the constant bound δ of Theorem 1 , the solid line the bound δ2(x) of Theorem 2 .
Fig. 10: Closed loops of the two networks from 40 random states at 0.97 of the boundary of Xinv , with the input saturated to U : vmpc(xk) against k for d=0.1 and d=0.001 . The dotted line is the level c1d2 , whose sublevel set lies in the target set B(d) .
Fig. 11: The recursive sequence ak and its convergence behavior. The black curve is y=ψ(x) , the yellow line is the diagonal y=x , and the green line is the tangent of ψ(⋅) at its fixed point a∞ .