Adaptive Huber trace regression with low-rank matrix parameter via nonconvex regularization

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Article number101871
Journal / PublicationJournal of Complexity
Volume85
Online published11 Jun 2024
Publication statusPublished - Dec 2024

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