TY - JOUR
T1 - Regularized reduced-rank regression for structured output prediction
AU - Chen, Heng
AU - Chen, Di Rong
AU - Cheng, Kun
AU - Zhou, Yang
N1 - Publisher Copyright:
© 2025 Elsevier Inc.
PY - 2026/2
Y1 - 2026/2
N2 - Reduced-rank regression (RRR) has been widely used to strength the dependency among multiple outputs. This paper develops a regularized vector-valued RRR approach, which plays an important role in predicting multiple outputs with structures. The estimator of vector-valued RRR is obtained by minimizing the empirically squared reproducing kernel Hilbert space (RKHS) distances between output feature kernel and all r dimensional subspaces in vector-valued RKHS. The algorithm is implemented easily with kernel tricks. We establish the learning rate of vector-valued RRR estimator under mild assumptions. Moreover, as a reduced-dimensional approximation of output kernel regression function, the estimator converges to the output regression function in probability when the rank r tends to infinity appropriately. It implies the consistency of structured predictor in general settings, especially in a misspecified case where the true regression function is not contained in the hypothesis space. Numerical experiments are provided to illustrate the efficiency of our method.
AB - Reduced-rank regression (RRR) has been widely used to strength the dependency among multiple outputs. This paper develops a regularized vector-valued RRR approach, which plays an important role in predicting multiple outputs with structures. The estimator of vector-valued RRR is obtained by minimizing the empirically squared reproducing kernel Hilbert space (RKHS) distances between output feature kernel and all r dimensional subspaces in vector-valued RKHS. The algorithm is implemented easily with kernel tricks. We establish the learning rate of vector-valued RRR estimator under mild assumptions. Moreover, as a reduced-dimensional approximation of output kernel regression function, the estimator converges to the output regression function in probability when the rank r tends to infinity appropriately. It implies the consistency of structured predictor in general settings, especially in a misspecified case where the true regression function is not contained in the hypothesis space. Numerical experiments are provided to illustrate the efficiency of our method.
KW - Function approximation
KW - Reduced rank method
KW - Reproducing kernel Hilbert space
KW - Statistical learning
KW - Structured prediction
UR - https://www.scopus.com/pages/publications/105011032498
U2 - 10.1016/j.jco.2025.101977
DO - 10.1016/j.jco.2025.101977
M3 - 文章
AN - SCOPUS:105011032498
SN - 0885-064X
VL - 92
JO - Journal of Complexity
JF - Journal of Complexity
M1 - 101977
ER -