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

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Zhang, Anru, Han, Rungang
Natura: Preprint
Pubblicazione: 2018
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866911947130142720
author Zhang, Anru
Han, Rungang
author_facet Zhang, Anru
Han, Rungang
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_1809_01796
institution arXiv
publishDate 2018
record_format arxiv
spellingShingle Optimal Sparse Singular Value Decomposition for High-dimensional High-order Data
Zhang, Anru
Han, Rungang
Statistics Theory
Methodology
Machine Learning
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.
title Optimal Sparse Singular Value Decomposition for High-dimensional High-order Data
topic Statistics Theory
Methodology
Machine Learning
url https://arxiv.org/abs/1809.01796