Jiayun Li

Jiayun Li

Auto-generated profile, based on publicly available information

Jiayun Li

Tsinghua University

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 June 2025 in Neural Networks
Verified
Journal Article
Closed access
JLJiayun Li
Jiayun Li
YCYuxiao Cheng
Yuxiao Cheng
YLYiwen Lu
Yiwen Lu
ZXZhuofan Xia
Zhuofan Xia
YMYilin Mo
Yilin Mo
GHGao Huang
Gao Huang

29 October 2025 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
SSShuai Sun
Shuai Sun
JLJiayun Li
Jiayun Li
YMYilin Mo
Yilin Mo
This paper is concerned with the finite sample identification performance of an n dimensional discrete-time Multiple-Input Multiple-Output (MIMO) Linear Time-Invariant system, with p inputs and m outputs. We prove that the widely-used Ho-Kalman algorithm and Multivariable Output Error State Space (MOESP) algorithm are ill-conditioned for MIMO systems when n/m or n/p is large. Moreover, by analyzing the Fisher Information matrix and the Cramér–Rao bound, we derive a fundamental limit for identifying the real and stable (or marginally stable) poles of MIMO systems. Specifically, we prove that the required sample complexity to lower bound the Fisher Information matrix explodes superpolynomially with respect to n/(pm). Numerical results are provided to illustrate the illconditionedness of Ho-Kalman algorithm and MOESP algorithm as well as the fundamental limit on identification.

24 December 2024 in IEEE Transactions on Control Systems Technology
Verified
Journal Article
Closed access
BYBo Yang
Bo Yang
ZLZishuo Li
Zishuo Li
JLJiayun Li
Jiayun Li
YMYilin Mo
Yilin Mo
JYJiaqi Yan
Jiaqi Yan
In this article, we address the model predictive control (MPC) problem for continuous-time linear time-invariant systems, with both state and input constraints. For computational efficiency, existing approaches typically discretize both dynamics and constraints, which potentially leads to constraint violations in between discrete-time instants. In contrast, to ensure strict constraint satisfaction, we equivalently replace the differential equations with linear mappings between state, input, and flat output, leveraging the differential flatness property of linear systems. By parameterizing the flat output with piecewise polynomials and employing Markov–Lukács theorem, the original MPC problem is then transformed into a semidefinite programming (SDP) problem, which guarantees the strict constraints satisfaction at all time. Furthermore, exploiting the fact that the proposed SDP contains numerous small-sized positive semidefinite (PSD) matrices as optimization variables, we propose a primal-dual hybrid gradient (PDHG) algorithm that can be efficiently parallelized, expediting the optimization procedure with GPU parallel computing. The simulation and experimental results demonstrate that our approach guarantees rigorous adherence to constraints at all time, and our solver exhibits superior computational speed compared to existing solvers for the proposed SDP problem.

1 November 2026 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
JLJiayun Li
Jiayun Li
YLYiwen Lu
Yiwen Lu
YMYilin Mo
Yilin Mo
JCJie Chen
Jie Chen
This paper is concerned with performance analysis and pole selection problem in identifying linear time-invariant (LTI) systems using orthogonal basis functions (OBFs), a system identification approach that consists of solving least-squares problems and selecting poles within the OBFs. Specifically, we analyze the convergence properties and asymptotic bias of the OBF algorithm, and propose a pole selection algorithm that robustly minimizes the worst-case identification bias, with the bias measured under the $\mathcal {H}_{2}$ error criterion. Our results include an analytical expression for the convergence rate and an explicit bound on the asymptotic identification bias, which depends on both the true system poles and the preselected model poles. Furthermore, we demonstrate that the pole selection algorithm is asymptotically optimal, achieving the fundamental lower bound on the identification bias. The algorithm explicitly determines the model poles as the so-called Tsuji points, and the asymptotic identification bias decreases exponentially with the number of basis functions, with the rate of decrease governed by the hyperbolic Chebyshev constant. Numerical experiments validate the derived bounds and demonstrate the effectiveness of the proposed pole selection algorithm.