paper-with-me

홈 › Papers

Tensor Decompositions via Two-Mode Higher-Order SVD (HOSVD)

2016-12-12 · Miaoyan Wang, Yun S. Song

Tensor decompositions have rich applications in statistics and machine learning, and developing efficient, accurate algorithms for the problem has received much attention recently. Here, we present a new method built on Kruskal's uniqueness theorem to decompose symmetric, nearly orthogonally decomposable tensors. Unlike the classical higher-order singular value decomposition which unfolds a tensor along a single mode, we consider unfoldings along two modes and use rank-1 constraints to characterize the underlying components. This tensor decomposition method provably handles a greater level of noise compared to previous methods and achieves a high estimation accuracy. Numerical results demonstrate that our algorithm is robust to various noise distributions and that it performs especially favorably as the order increases.

📄 PDF Abstract BibTeX arXiv:1612.03839

Code (0)

등록된 구현이 없습니다.

Tasks

Tensor DecompositionVocal Bursts Valence Prediction

Similar Papers 제목 키워드 기반

Approximation of Images via Generalized Higher Order Singular Value Decomposition over Finite-dimensional Commutative Semisimple Algebra

2022-02-01 · Liang Liao, Sen Lin, Lun Li, Xiuwei Zhang 외

Low-rank approximation of images via singular value decomposition is well-received in the era of big data. However, singular value decomposition (SVD) is only for order-two data, i.e., matrices. It is necessary to flatte…

Oblivious subspace embeddings for compressed Tucker decompositions

2024-06-13 · Matthew Pietrosanu, Bei Jiang, Linglong Kong

Emphasis in the tensor literature on random embeddings (tools for low-distortion dimension reduction) for the canonical polyadic (CP) tensor decomposition has left analogous results for the more expressive Tucker decompo…

Dimensionality ReductionTensor Decomposition

A Tight Lower Bound for the Approximation Guarantee of Higher-Order Singular Value Decomposition

2025-08-08 · Matthew Fahrbach, Mehrdad Ghadiri arxiv

We prove that the classic approximation guarantee for the higher-order singular value decomposition (HOSVD) is tight by constructing a tensor for which HOSVD achieves an approximation ratio of $N/(1+\varepsilon)$, for an…

The Sup-norm Perturbation of HOSVD and Low Rank Tensor Denoising

2017-07-05 · Dong Xia, Fan Zhou

The higher order singular value decomposition (HOSVD) of tensors is a generalization of matrix SVD. The perturbation analysis of HOSVD under random noise is more delicate than its matrix counterpart. Recently, polynomial…

ClusteringDenoising

Low-Cost High-Order Singular Value Decomposition for Tensor-Based Reconstruction from Sparse Sensor Measurements: Urban Flow and Air-Quality Applications

2026-06-23 · Arindam Sengupta, Paul Jeanney, Ricardo Vinuesa, Jose Miguel Perez 외 arxiv

Urban flow and air-quality simulations generate high-dimensional datasets describing velocity and pollutant transport across multiple spatial, temporal, and physical-variable dimensions. Reconstructing these fields from …