MYMingzhou Yin

Mingzhou Yin

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Mingzhou Yin has a total of 16 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Low-Rank Matrix Regression via Least-Angle Regression

    by Mingzhou Yin, Matthias A. Müller

    Low-rank matrix regression is a fundamental problem in data science with various applications in systems and control. Nuclear norm regularization has been widely applied to solve this problem due to its convexity. However, it suffers from high computational complexity and the inability to directly specify the rank. This work introduces a novel framework for low-rank matrix regression that addresses both unstructured and Hankel matrices. By decomposing the low-rank matrix into rank-1 bases, the problem is reformulated as an infinite-dimensional sparse learning problem. The least-angle regression (LAR) algorithm is then employed to solve this problem efficiently. For unstructured matrices, a closed-form LAR solution is derived with equivalence to a normalized nuclear norm regularization problem. For Hankel matrices, a real-valued polynomial basis reformulation enables effective LAR implementation. Two numerical examples in network modeling and system realization demonstrate that the proposed approach significantly outperforms the nuclear norm method in terms of estimation accuracy and computational efficiency.


  • Open Access

    Frequency-Domain Identification of Discrete-Time Systems using Sum-of-Rational Optimization

    by Mohamed Abdalmoaty, Jared Miller, Mingzhou Yin, Roy S. Smith

    We propose a computationally tractable method for the identification of stable canonical discrete-time rational transfer function models, using frequency domain data. The problem is formulated as a global non-convex optimization problem whose objective function is the sum of weighted squared residuals at each observed frequency datapoint. Stability is enforced using a polynomial matrix inequality constraint. The problem is solved globally by a moment-sum-of-squares hierarchy of semidefinite programs through a framework for sum-of-rational-functions optimization. Convergence of the moment-sum-of-squares program is guaranteed as the bound on the degree of the sum-of-squares polynomials approaches infinity. The performance of the proposed method is demonstrated using numerical simulation examples.

  • Open Access

    A Dual System-Level Parameterization for Identification from Closed-Loop Data

    by Amber Srivastava, Mingzhou Yin, Andrea Iannelli, Roy S. Smith

    This work presents a dual system-level param-eterization (D-SLP) method for closed-loop identification of linear time-invariant systems. The recent system -level synthesis framework parameterizes all stabilizing controllers via linear constraints on closed-loop response functions, known as system-level parameters. It was demonstrated that several structural, locality, and communication constraints on the controller can be posed as convex constraints on these system-level parameters. In the current work, the identification problem is treated as a dual of the system-level synthesis problem. The plant model is identified from the dual system-level parameters associated to the plant. In comparison to existing closed-loop identification approaches (such as the dual-Youla parameterization), the D-SLP framework neither requires the knowledge of a nominal plant that is stabilized by the known controller, nor depends upon the choice of factorization of the nominal plant and the stabilizing controller. Numerical simulations demonstrate the efficacy of the proposed D-SLP method in terms of identification errors, compared to existing closed-loop identification techniques.


  • Open Access

    Stochastic Data-Driven Predictive Control: Regularization, Estimation, and Constraint Tightening

    by Mingzhou Yin, Andrea Iannelli, Roy S. Smith

    Data-driven predictive control methods based on the Willems' fundamental lemma have shown great success in recent years. These approaches use receding horizon predictive control with nonparametric data-driven predictors instead of model-based predictors. This study addresses three problems of applying such algorithms under unbounded stochastic uncertainties: 1) tuning-free regularizer design, 2) initial condition estimation, and 3) reliable constraint satisfaction, by using stochastic prediction error quantification. The regularizer is designed by leveraging the expected output cost. An initial condition estimator is proposed by filtering the measurements with the one-step-ahead stochastic data-driven prediction. A novel constraint-tightening method, using second-order cone constraints, is presented to ensure high-probability chance constraint satisfaction. Numerical results demonstrate that the proposed methods lead to satisfactory control performance in terms of both control cost and constraint satisfaction, with significantly improved initial condition estimation.

  • Open Access

    Data-driven predictive control for demand side management: Theoretical and experimental results

    by Mingzhou Yin, Hanmin Cai, Andrea Gattiglio, Fazel Khayatian, Roy S. Smith, Philipp Heer


  • Error Bounds for Kernel-Based Linear System Identification With Unknown Hyperparameters

    by Mingzhou Yin, Roy S. Smith

    Applying regularization in reproducing kernel Hilbert spaces has been successful in linear system identification using stable kernel designs. From a Gaussian process perspective, it automatically provides probabilistic error bounds for the identified models from the posterior covariance, which are useful in robust and stochastic control. However, the error bounds require knowledge of the true hyperparameters in the kernel design. They can be inaccurate with estimated hyperparameters for lightly damped systems or in the presence of high noise. In this work, we provide reliable quantification of the estimation error when the hyperparameters are unknown. The bounds are obtained by first constructing a high-probability set for the true hyperparameters from the marginal likelihood function. Then the worst-case posterior covariance is found within the set. The proposed bound is proven to contain the true model with a high probability and its validity is demonstrated in numerical simulation.

  • Open Access

    Error Bounds for Kernel-Based Linear System Identification with Unknown Hyperparameters

    by Mingzhou Yin, Roy S. Smith

    The kernel-based method has been successfully applied in linear system identification using stable kernel designs. From a Gaussian process perspective, it automatically provides probabilistic error bounds for the identified models from the posterior covariance, which are useful in robust and stochastic control. However, the error bounds require knowledge of the true hyperparameters in the kernel design and are demonstrated to be inaccurate with estimated hyperparameters for lightly damped systems or in the presence of high noise. In this work, we provide reliable quantification of the estimation error when the hyperparameters are unknown. The bounds are obtained by first constructing a high-probability set for the true hyperparameters from the marginal likelihood function and then finding the worst-case posterior covariance within the set. The proposed bound is proven to contain the true model with a high probability and its validity is verified in numerical simulation.

  • Top Cited Papers

    Maximum Likelihood Estimation in Data-Driven Modeling and Control

    by Mingzhou Yin, Andrea Iannelli, Roy S. Smith

    Recently, various algorithms for data-driven simulation and control have been proposed based on the Willems’ fundamental lemma. However, when collected data are noisy, these methods lead to ill-conditioned data-driven model structures. In this article, we present a maximum likelihood framework to obtain an optimal data-driven model, the signal matrix model, in the presence of output noise. Data compression and noise-level estimation schemes are also proposed to apply the algorithm efficiently to large datasets and unknown noise-level scenarios. Two approaches in system identification and receding horizon control are developed based on the derived optimal estimator. The first one identifies a finite impulse response model. This approach improves the least-squares estimator with less restrictive assumptions. The second one applies the signal matrix model as the predictor in predictive control. The control performance is shown to be better than existing data-driven predictive control algorithms, especially under high noise levels. Both approaches demonstrate that the derived estimator provides a promising framework to apply data-driven algorithms to noisy data.


  • Open Access

    Maximum Likelihood Estimation in Data-Driven Modeling and Control

    by Mingzhou Yin, Andrea Iannelli, Roy S. Smith

    Recently, various algorithms for data-driven simulation and control have been proposed based on the Willems' fundamental lemma. However, when collected data are noisy, these methods lead to ill-conditioned data-driven model structures. In this work, we present a maximum likelihood framework to obtain an optimal data-driven model, the signal matrix model, in the presence of output noise. Data compression and noise level estimation schemes are also proposed to apply the algorithm efficiently to large datasets and unknown noise level scenarios. Two approaches in system identification and receding horizon control are developed based on the derived optimal estimator. The first one identifies a finite impulse response model. This approach improves the least-squares estimator with less restrictive assumptions. The second one applies the signal matrix model as the predictor in predictive control. The control performance is shown to be better than existing data-driven predictive control algorithms, especially under high noise levels. Both approaches demonstrate that the derived estimator provides a promising framework to apply data-driven algorithms to noisy data.