Randomized algorithms for the computation of multilinear rank-\((\mu_1,\mu_2,\mu_3)\) approximations
From MaRDI portal
Publication:6064026
DOI10.1007/s10898-022-01182-8MaRDI QIDQ6064026
Yanwei Xu, Yi-Min Wei, Mao-Lin Che
Publication date: 8 November 2023
Published in: Journal of Global Optimization (Search for Journal in Brave)
singular value decompositionsingular valuesrandomized algorithmsrandom projectionmultilinear ranksparse subspace embedding
Eigenvalues, singular values, and eigenvectors (15A18) Multilinear algebra, tensor calculus (15A69) Randomized algorithms (68W20) Numerical linear algebra (65Fxx) Numerical methods for mathematical programming, optimization and variational techniques (65Kxx)
Related Items (1)
Cites Work
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Tensor Decompositions and Applications
- Handwritten digit classification using higher order singular value decomposition
- A randomized algorithm for a tensor-based generalization of the singular value decomposition
- A fast randomized algorithm for the approximation of matrices
- Finding frequent items in data streams
- Krylov-type methods for tensor computations.I
- Randomized LU decomposition using sparse projections
- Fast randomized matrix and tensor interpolative decomposition using countsketch
- An efficient randomized algorithm for computing the approximate Tucker decomposition
- Randomized algorithms for the low multilinear rank approximations of tensors
- Eigenvalues of a real supersymmetric tensor
- Randomized algorithms for the approximations of Tucker and the tensor train decompositions
- HOID: Higher Order Interpolatory Decomposition for Tensors Based on Tucker Representation
- A literature survey of low-rank tensor approximation techniques
- Wedderburn Rank Reduction and Krylov Subspace Method for Tensor Approximation. Part 1: Tucker Case
- A New Truncation Strategy for the Higher-Order Singular Value Decomposition
- Computational Advertising: Techniques for Targeting Relevant Ads
- Best Low Multilinear Rank Approximation of Higher-Order Tensors, Based on the Riemannian Trust-Region Scheme
- Randomized Algorithms for Matrices and Data
- Low-Rank Approximation and Regression in Input Sparsity Time
- On variants of the Johnson–Lindenstrauss lemma
- Algorithm 862
- A Newton–Grassmann Method for Computing the Best Multilinear Rank-$(r_1,$ $r_2,$ $r_3)$ Approximation of a Tensor
- A Multilinear Singular Value Decomposition
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Efficient Randomized Algorithms for the Fixed-Precision Low-Rank Matrix Approximation
- Practical Sketching Algorithms for Low-Rank Matrix Approximation
- Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
- Low-Rank Tucker Approximation of a Tensor from Streaming Data
- The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection
- The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors
- Quasi-Newton Methods on Grassmannians and Multilinear Approximations of Tensors
- Theory and Computation of Complex Tensors and its Applications
- Relative Error Tensor Low Rank Approximation
- Recompression of Hadamard Products of Tensors in Tucker Format
This page was built for publication: Randomized algorithms for the computation of multilinear rank-\((\mu_1,\mu_2,\mu_3)\) approximations