.png){kind=icon}
返回
Dynamic Matrix Recovery
.png){kind=icon}
OA
AI
DOI：10.1080/01621459.2023.2297468.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Matrix recovery from sparse observations is an extensively studied topic emerging in various applications, such as recommendation system and signal processing, which includes the matrix completion and compressed sensing models as special cases. In this article, we propose a general framework for dynamic matrix recovery of low-rank matrices that evolve smoothly over time. We start from the setting that the observations are independent across time, then extend to the setting that both the design matrix and noise possess certain temporal correlation via modified concentration inequalities. By pooling neighboring observations, we obtain sharp estimation error bounds of both settings, showing the influence of the underlying smoothness, the dependence and effective samples. We propose a dynamic fast iterative shrinkage-thresholding algorithm that is computationally efficient, and characterize the interplay between algorithmic and statistical convergence. Simulated and real data examples are provided to support such findings. Supplementary materials for this article are available online.
Keyword:
Compressed sensing
Local smoothing
Low rank
Matrix completion
期刊
J
IF:
3
论文数:
5.2K
被引数:
4.8W
机构
引用论文
DC Offset Error Compensation Algorithm for PR Current Control of a Single-Phase Grid-Tied Inverter.png)
EnergiesOAAI
EnergiesIF0
OAAI分享收藏
Graphene/Ionic Liquid Binary Electrode Material for High Performance Supercapacitor用于高性能超级电容器的石墨烯/离子液体二元电极材料
PREAI
分享收藏Effect of ferric chloride on the electrical conductivity and characterization of polyethylene oxide/polyvinyl chloride/polyaniline conductive films三氯化铁对聚氧化乙烯/聚氯乙烯/聚苯胺导电薄膜的电导率和表征的影响
PREAI
分享收藏
查看更多内容