Low-Rank Matrix Estimation in the Presence of Change-Points
Abstract
We consider a general trace regression model with multiple structural changes and propose a universal approach for simultaneous exact or near-low-rank matrix recovery and change-point detection. It incorporates nuclear norm penalized least-squares minimization into a grid search scheme that determines the potential structural break. Under a set of general conditions, we establish the non-asymptotic error bounds with a nearly-oracle rate for the matrix estimators as well as the super-consistency rate for the change-point localization. We use concrete random design instances to justify the appropriateness of the proposed conditions. Numerical results demonstrate the validity and effectiveness of the proposed scheme.
Cite
Text
Shi et al. "Low-Rank Matrix Estimation in the Presence of Change-Points." Journal of Machine Learning Research, 2024.Markdown
[Shi et al. "Low-Rank Matrix Estimation in the Presence of Change-Points." Journal of Machine Learning Research, 2024.](https://mlanthology.org/jmlr/2024/shi2024jmlr-lowrank/)BibTeX
@article{shi2024jmlr-lowrank,
title = {{Low-Rank Matrix Estimation in the Presence of Change-Points}},
author = {Shi, Lei and Wang, Guanghui and Zou, Changliang},
journal = {Journal of Machine Learning Research},
year = {2024},
pages = {1-71},
volume = {25},
url = {https://mlanthology.org/jmlr/2024/shi2024jmlr-lowrank/}
}