Robust Low-rank Tensor Recovery: Models and Algorithms
원문 초록
Robust tensor recovery plays an instrumental role in robustifying tensor decompositions for multilinear data analysis against outliers, gross corruptions and missing values and has a diverse array of applications. In this paper, we study the problem of robust low-rank tensor recovery in a convex optimization framework, drawing upon recent advances in robust Principal Component Analysis and tensor completion. We propose tailored optimization algorithms with global convergence guarantees for solving both the constrained and the Lagrangian formulations of the problem. These algorithms are based on the highly efficient alternating direction augmented Lagrangian and accelerated proximal gradient methods. We also propose a nonconvex model that can often improve the recovery results from the convex models. We investigate the empirical recoverability properties of the convex and nonconvex formulations and compare the computational performance of the algorithms on simulated data. We demonstrate through a number of real applications the practical effectiveness of this convex optimization framework for robust low-rank tensor recovery.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Leveraging Predictive Equivalence in Decision Trees
Cross-Domain Conditional Diffusion Models for Time Series Imputation
RADAR: Benchmarking Language Models on Imperfect Tabular Data
IMTS is Worth Time $\times$ Channel Patches: Visual Masked Autoencoders for Irregular Multivariate Time Series Prediction
Integrative Analysis and Imputation of Multiple Data Streams via Deep Gaussian Processes
ImputeINR: Time Series Imputation via Implicit Neural Representations for Disease Diagnosis with Missing Data
토론
이 논문과 연결된 포럼 글이 아직 없습니다.