Tensor vs Matrix Methods: Robust Tensor Decomposition under Block Sparse Perturbations
원문 초록
Robust tensor CP decomposition involves decomposing a tensor into low rank and sparse components. We propose a novel non-convex iterative algorithm with guaranteed recovery. It alternates between low-rank CP decomposition through gradient ascent (a variant of the tensor power method), and hard thresholding of the residual. We prove convergence to the globally optimal solution under natural incoherence conditions on the low rank component, and bounded level of sparse perturbations. We compare our method with natural baselines which apply robust matrix PCA either to the {\em flattened} tensor, or to the matrix slices of the tensor. Our method can provably handle a far greater level of perturbation when the sparse tensor is block-structured. This naturally occurs in many applications such as the activity detection task in videos. Our experiments validate these findings. Thus, we establish that tensor methods can tolerate a higher level of gross corruptions compared to matrix methods.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Multi-Stage Speaker Diarization for Noisy Classrooms
Optimizing Large Language Models for ESG Activity Detection in Financial Texts
VANPY: Voice Analysis Framework
When do they StOP?: A First Step Towards Automatically Identifying Team Communication in the Operating Room
Pre-Equalization Aided Grant-Free Massive Access in Massive MIMO System
Automatic detection and prediction of nAMD activity change in retinal OCT using Siamese networks and Wasserstein Distance for ordinality
토론
이 논문과 연결된 포럼 글이 아직 없습니다.