STMEMLSep 6, 2018

Optimal Sparse Singular Value Decomposition for High-dimensional High-order Data

arXiv:1809.01796v264 citations
AI Analysis

This work addresses robust dimension reduction for sparse tensor data, which is incremental as it builds on existing tensor SVD models with a novel thresholding scheme.

The authors tackled the problem of dimension reduction for high-dimensional high-order data with sparsity by proposing STAT-SVD, a method that achieves minimax rate-optimal estimation accuracy and performs well in simulations and on a mortality rate dataset.

In this article, we consider the sparse tensor singular value decomposition, which aims for dimension reduction on high-dimensional high-order data with certain sparsity structure. A method named Sparse Tensor Alternating Thresholding for Singular Value Decomposition (STAT-SVD) is proposed. The proposed procedure features a novel double projection \& thresholding scheme, which provides a sharp criterion for thresholding in each iteration. Compared with regular tensor SVD model, STAT-SVD permits more robust estimation under weaker assumptions. Both the upper and lower bounds for estimation accuracy are developed. The proposed procedure is shown to be minimax rate-optimal in a general class of situations. Simulation studies show that STAT-SVD performs well under a variety of configurations. We also illustrate the merits of the proposed procedure on a longitudinal tensor dataset on European country mortality rates.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes