Adaptive Huber trace regression with low-rank matrix parameter via nonconvex regularization
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
Original language | English |
---|---|
Article number | 101871 |
Journal / Publication | Journal of Complexity |
Volume | 85 |
Online published | 11 Jun 2024 |
Publication status | Published - Dec 2024 |
Link(s)
Abstract
In this paper, we consider the adaptive Huber trace regression model with matrix covariates. A non-convex penalty function is employed to account for the low-rank structure of the unknown parameter. Under some mild conditions, we establish an upper bound for the statistical rate of convergence of the regularized matrix estimator. Theoretically, we can deal with heavy-tailed distributions with bounded (1 + δ)-th moment for any δ > 0. Furthermore, we derive the effect of the adaptive parameter on the final estimator. Some simulations, as well as a real data example, are designed to show the finite sample performance of the proposed method. © 2024 Elsevier Inc.
Research Area(s)
- Huber trace regression model, Low-rank, Nonconvex regularization, Oracle inequality
Citation Format(s)
Adaptive Huber trace regression with low-rank matrix parameter via nonconvex regularization. / Tan, Xiangyong; Peng, Ling; Lian, Heng et al.
In: Journal of Complexity, Vol. 85, 101871, 12.2024.
In: Journal of Complexity, Vol. 85, 101871, 12.2024.
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review