SYMay 8
Covariance Stabilization for a class of Stochastic Discrete-time Linear Systems using the S-Variable ApproachKaouther Moussa, Dimitri Peaucelle
This paper deals with the problem of covariance stabilization for a class of linear stochastic discrete-time systems in the Stochastic Model Predictive Control (SMPC) framework. The considered systems are affected by independent and identically distributed (i.i.d.) additive and parametric stochastic uncertainties (potentially unbounded), in addition to polytopic deterministic uncertainties bounding the mean of the state and input parameters. The design conditions presented in this paper are formulated as Linear Matrix Inequalities (LMIs), using the S-variable approach in order to reduce the potential conservatism. These conditions are derived using a deterministic exact characterization of the covariance dynamics, the latter involves bilinear terms in the control gain. A technique to linearize such dynamics is presented, it results in a descriptor representation allowing to derive sufficient conditions for the design of a covariance-stabilizing controller. The derived condition is first compared with a known necessary and sufficient stability condition for systems without deterministic uncertainties and additive stochastic noise. Although more conservative, the proposed condition is more numerically tractable, with an LMI size scaling as O(n^2) instead of O(n^3). Then, the same condition is used to design controllers that are robust to both deterministic and stochastic uncertainties. Several numerical examples are presented for comparison and illustration.
OCOct 17, 2023
Local Lipschitz Constant Computation of ReLU-FNNs: Upper Bound Computation with Exactness VerificationYoshio Ebihara, Xin Dai, Victor Magron et al.
This paper is concerned with the computation of the local Lipschitz constant of feedforward neural networks (FNNs) with activation functions being rectified linear units (ReLUs). The local Lipschitz constant of an FNN for a target input is a reasonable measure for its quantitative evaluation of the reliability. By following a standard procedure using multipliers that capture the behavior of ReLUs,we first reduce the upper bound computation problem of the local Lipschitz constant into a semidefinite programming problem (SDP). Here we newly introduce copositive multipliers to capture the ReLU behavior accurately. Then, by considering the dual of the SDP for the upper bound computation, we second derive a viable test to conclude the exactness of the computed upper bound. However, these SDPs are intractable for practical FNNs with hundreds of ReLUs. To address this issue, we further propose a method to construct a reduced order model whose input-output property is identical to the original FNN over a neighborhood of the target input. We finally illustrate the effectiveness of the model reduction and exactness verification methods with numerical examples of practical FNNs.
OCFeb 9, 2022
Stability Analysis of Recurrent Neural Networks by IQC with Copositive MutipliersYoshio Ebihara, Hayato Waki, Victor Magron et al.
This paper is concerned with the stability analysis of the recurrent neural networks (RNNs) by means of the integral quadratic constraint (IQC) framework. The rectified linear unit (ReLU) is typically employed as the activation function of the RNN, and the ReLU has specific nonnegativity properties regarding its input and output signals. Therefore, it is effective if we can derive IQC-based stability conditions with multipliers taking care of such nonnegativity properties. However, such nonnegativity (linear) properties are hardly captured by the existing multipliers defined on the positive semidefinite cone. To get around this difficulty, we loosen the standard positive semidefinite cone to the copositive cone, and employ copositive multipliers to capture the nonnegativity properties. We show that, within the framework of the IQC, we can employ copositive multipliers (or their inner approximation) together with existing multipliers such as Zames-Falb multipliers and polytopic bounding multipliers, and this directly enables us to ensure that the introduction of the copositive multipliers leads to better (no more conservative) results. We finally illustrate the effectiveness of the IQC-based stability conditions with the copositive multipliers by numerical examples.
SYApr 10, 2019
Distribution Modeling and Stabilization Control for Discrete-Time Linear Random Dynamical Systems Using Ensemble Kalman FilterYohei Hosoe, Dimitri Peaucelle
This paper studies an output feedback stabilization control framework for discrete-time linear systems with stochastic dynamics determined by an independent and identically distributed (i.i.d.) process. The controller is constructed with an ensemble Kalman filter (EnKF) and a feedback gain designed with our earlier result about state feedback control. The EnKF is also used for modeling the distribution behind the system, which is required in the feedback gain synthesis. The effectiveness of our control framework is demonstrated with numerical experiments. This study will become the first step toward the realization of learning type control using our stochastic systems control theory.