Randomized tensor wheel decomposition

DOI10.1137/23M1583934MaRDI QIDQ6551213zbMATH OpenFDO

Authors Meng-yu Wang, Hanyu Li

Publication date 6 June 2024

Published in SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/23M1583934

zbMATH Keywords

alternating least squaresKronecker subsampled randomized Fourier transformleverage samplingrandomized algorithmtensor wheel decompositiontensorsketch

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Decomposition methods (49M27) Numerical linear algebra (65F99) Randomized algorithms (68W20) Approximation algorithms (68W25)

Recommendations

• SVD-based algorithms for tensor wheel decomposition
• A random sampling algorithm for fully-connected tensor network decomposition with applications
• A randomized tensor singular value decomposition based on the t-product.
• A Practical Randomized CP Tensor Decomposition
• Parallel Randomized Tucker Decomposition Algorithms

Cites work

• A Practical Randomized CP Tensor Decomposition
• An efficient randomized algorithm for computing the approximate Tucker decomposition
• Compressed matrix multiplication
• Faster Johnson-Lindenstrauss transforms via Kronecker products
• Fully-connected tensor network decomposition for robust tensor completion problem
• scientific article; zbMATH DE number 2086663 (Why is no real title available?)
• Low-rank Tucker approximation of a tensor from streaming data
• Multi-dimensional image recovery via fully-connected tensor network decomposition under the learnable transforms
• Practical alternating least squares for tensor ring decomposition.
• Practical leverage-based sampling for low-rank tensor decomposition
• Practical sketching-based randomized tensor ring decomposition.
• Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
• Randomized Algorithms for Rounding in the Tensor-Train Format
• Randomized algorithms for the approximations of Tucker and the tensor train decompositions
• Randomized algorithms for the low multilinear rank approximations of tensors
• Randomized numerical linear algebra: Foundations and algorithms
• Streaming Tensor Train Approximation
• Tensor completion via fully-connected tensor network decomposition with regularized factors
• Tensor Decomposition for Signal Processing and Machine Learning
• Tensor Decompositions and Applications
• Tensor networks for dimensionality reduction and large-scale optimization. I: Low-rank tensor decompositions
• Tensor-train decomposition
• The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection
• Tucker Dimensionality Reduction of Three-Dimensional Arrays in Linear Time

Cited in

(7)

• A random sampling algorithm for fully-connected tensor network decomposition with applications
• SVD-based algorithms for tensor wheel decomposition
• Accelerated alternating least squares for tensor wheel decomposition with applications
• Robust tensor completion via tensor wheel decomposition with difference factors regularization for hyperspectral image restoration
• Alternating iterative methods for solving the inverse eigenvalue problems on the manifold of tensors with fixed TT-ranks
• Block-randomized stochastic methods for tensor ring decomposition
• Efficient randomized algorithms for block tensor-tensor multiplication

This page was built for publication: Randomized tensor wheel decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6551213)