Efficient randomized algorithms for fixed precision problem of approximate Tucker decomposition
From MaRDI portal
Cites work
- A fast randomized algorithm for the approximation of matrices
- A new truncation strategy for the higher-order singular value decomposition
- A randomized algorithm for a tensor-based generalization of the singular value decomposition
- A randomized blocked algorithm for efficiently computing rank-revealing factorizations of matrices
- Adaptive hierarchical subtensor partitioning for tensor compression
- Algorithm 862
- An efficient randomized algorithm for computing the approximate Tucker decomposition
- Best low multilinear rank approximation of higher-order tensors, based on the Riemannian trust-region scheme
- Compressed matrix multiplication
- Efficient randomized algorithms for the fixed-precision low-rank matrix approximation
- Fast Nonnegative Matrix/Tensor Factorization Based on Low-Rank Approximation
- Faster Johnson-Lindenstrauss transforms via Kronecker products
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Handwritten digit classification using higher order singular value decomposition
- High-dimensional probability. An introduction with applications in data science
- HOID: higher order interpolatory decomposition for tensors based on Tucker representation
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- Improved matrix algorithms via the subsampled randomized Hadamard transform
- Johnson–Lindenstrauss Embeddings with Kronecker Structure
- Low rank tensor recovery via iterative hard thresholding
- Low-rank approximation and regression in input sparsity time
- Low-rank tensor completion by Riemannian optimization
- Low-rank Tucker approximation of a tensor from streaming data
- Oblivious Sketching of High-Degree Polynomial Kernels
- Parallel Candecomp/Parafac decomposition of sparse tensors using dimension trees
- Parallel Randomized Tucker Decomposition Algorithms
- Practical sketching algorithms for low-rank matrix approximation
- Quasi-Newton methods on Grassmannians and multilinear approximations of tensors
- RA-HOOI: rank-adaptive higher-order orthogonal iteration for the fixed-accuracy low multilinear-rank approximation of tensors
- Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
- Randomized algorithms for the approximations of Tucker and the tensor train decompositions
- Randomized algorithms for the low multilinear rank approximations of tensors
- Randomized alternating least squares for canonical tensor decompositions: application to a PDE with random data
- Randomized LU decomposition
- Recompression of Hadamard Products of Tensors in Tucker Format
- Smallest singular value of a random rectangular matrix
- Smallest singular value of random matrices and geometry of random polytopes
- Software for Sparse Tensor Decomposition on Emerging Computing Architectures
- Structured random sketching for PDE inverse problems
- Tensor Decompositions and Applications
- Tensor networks for dimensionality reduction and large-scale optimization. I: Low-rank tensor decompositions
- Tensor Networks for Dimensionality Reduction and Large-scale Optimization: Part 2 Applications and Future Perspectives
- Tensor-structured sketching for constrained least squares
- The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection
- The fast Johnson-Lindenstrauss transform and approximate nearest neighbors
- The theory of probability. Explorations and applications
- Theory and Computation of Complex Tensors and its Applications
- TuckerMPI: a parallel C++/MPI software package for large-scale data compression via the Tucker tensor decomposition
- Wedderburn rank reduction and Krylov subspace method for tensor approximation. I: Tucker case
Cited in
(6)- Optimization on the extended tensor-train manifold with shared factors
- Efficient randomized algorithms for computing an approximation of the tensor train decomposition
- An ADMM-based interior point method for solving nonnegative tensor least squares problems and its applications
- Efficient algorithms for Tucker decomposition via approximate matrix multiplication
- Intrinsic Low-Tucker-Rank Theory and Unified Tensor CUR Decomposition for High-Dimensional Hyperinterpolation
- Efficient randomized algorithms for block tensor-tensor multiplication
This page was built for publication: Efficient randomized algorithms for fixed precision problem of approximate Tucker decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7016677)
