A contemporary and comprehensive survey on streaming tensor decomposition
Tensor decomposition has been demonstrated to be successful in a wide range of
applications, from neuroscience and wireless communications to social networks. In an …
applications, from neuroscience and wireless communications to social networks. In an …
Cross tensor approximation methods for compression and dimensionality reduction
Cross Tensor Approximation (CTA) is a generalization of Cross/skeleton matrix and CUR
Matrix Approximation (CMA) and is a suitable tool for fast low-rank tensor approximation. It …
Matrix Approximation (CMA) and is a suitable tool for fast low-rank tensor approximation. It …
Schizophrenia recognition based on the phase space dynamic of EEG signals and graphical features
Schizophrenia is a mental disorder that causes adverse effects on the mental capacity of a
person, emotional inclinations, and quality of personal and social life. The official statistics …
person, emotional inclinations, and quality of personal and social life. The official statistics …
Subquadratic kronecker regression with applications to tensor decomposition
Kronecker regression is a highly-structured least squares problem $\min_ {\mathbf
{x}}\lVert\mathbf {K}\mathbf {x}-\mathbf {b}\rVert_ {2}^ 2$, where the design matrix $\mathbf …
{x}}\lVert\mathbf {K}\mathbf {x}-\mathbf {b}\rVert_ {2}^ 2$, where the design matrix $\mathbf …
Fast and accurate randomized algorithms for low-rank tensor decompositions
Low-rank Tucker and CP tensor decompositions are powerful tools in data analytics. The
widely used alternating least squares (ALS) method, which solves a sequence of over …
widely used alternating least squares (ALS) method, which solves a sequence of over …
Practical leverage-based sampling for low-rank tensor decomposition
The low-rank canonical polyadic tensor decomposition is useful in data analysis and can be
computed by solving a sequence of overdetermined least squares subproblems. Motivated …
computed by solving a sequence of overdetermined least squares subproblems. Motivated …
Randomized algorithms for rounding in the tensor-train format
The tensor-train (TT) format is a highly compact low-rank representation for high-
dimensional tensors. TT is particularly useful when representing approximations to the …
dimensional tensors. TT is particularly useful when representing approximations to the …
Fast cross tensor approximation for image and video completion
This paper presents a framework that suggests the utilization of cross tensor approximation
or tensor CUR approximation to reconstruct incomplete images and videos. The proposed …
or tensor CUR approximation to reconstruct incomplete images and videos. The proposed …
A DEIM Tucker tensor cross algorithm and its application to dynamical low-rank approximation
We introduce a Tucker tensor cross approximation method that constructs a low-rank
representation of a d-dimensional tensor by sparsely sampling its fibers. These fibers are …
representation of a d-dimensional tensor by sparsely sampling its fibers. These fibers are …
Mode-wise tensor decompositions: Multi-dimensional generalizations of CUR decompositions
Low rank tensor approximation is a fundamental tool in modern machine learning and data
science. In this paper, we study the characterization, perturbation analysis, and an efficient …
science. In this paper, we study the characterization, perturbation analysis, and an efficient …