.png){kind=icon}
.png){kind=icon}
Return
On semiseparable kernels and efficient implementation for regularized system identification and function estimation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.automatica.2021.109682.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A long-standing problem for kernel-based regularization methods is their high computational complexity O(N-3), where N is the number of data points. In this paper, we make a breakthrough for this problem. In particular, we show that it is possible to design general semiseparable kernels through either the system theory perspective or the machine learning perspective, leading to semiseparable simulation-induced kernels or amplitude modulated locally stationary kernels, respectively. Moreover, for many frequently used test input signals in automatic control, and by exploring the semiseparable structure of a kernel and the corresponding output kernel, their computational complexity, without any approximations, can be lowered to O(Nq(2)) or O(Nq(3)), where q is the semiseparability rank of the output kernel that only depends on the chosen kernel and the input signal. Numerical simulation shows that the proposed implementation can be 10(4) times faster than a state of art implementation. (C) 2021 Elsevier Ltd. All rights reserved.
Keywords:
Kernel-based regularization
Semiseparable kernels
Output kernels
Kernel design
Efficient implementation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.9
Papers:
1.2W
Citations:
5.2W