Low-Rank Tucker Approximation of a Tensor from Streaming Data
From MaRDI portal
Publication:5037558
DOI10.1137/19M1257718MaRDI QIDQ5037558
Joel A. Tropp, Yang Guo, Madeleine Udell, Yiming Sun, Charlene Luo
Publication date: 1 March 2022
Published in: SIAM Journal on Mathematics of Data Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.10951
dimension reductionrandomized algorithmTucker decompositionstreaming algorithmtensor compressionsketching method
Multilinear algebra, tensor calculus (15A69) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Related Items
Structured Matrix Approximations via Tensor Decompositions, An efficient algorithm for computing the approximate t-URV and its applications, Learning mean-field equations from particle data using WSINDy, Practical Leverage-Based Sampling for Low-Rank Tensor Decomposition, Generative modeling via tensor train sketching, Randomized algorithms for the computation of multilinear rank-\((\mu_1,\mu_2,\mu_3)\) approximations, Robust Recovery of Low-Rank Matrices and Low-Tubal-Rank Tensors from Noisy Sketches, Parallel Algorithms for Computing the Tensor-Train Decomposition, Practical sketching algorithms for low-rank Tucker approximation of large tensors, Incremental algorithms for truncated higher-order singular value decompositions, A randomized algorithm for tensor singular value decomposition using an arbitrary number of passes, Communication Lower Bounds and Optimal Algorithms for Multiple Tensor-Times-Matrix Computation, The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection, Modewise operators, the tensor restricted isometry property, and low-rank tensor recovery, Randomized algorithms for the low multilinear rank approximations of tensors, An efficient randomized algorithm for computing the approximate Tucker decomposition, Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation, Tensor decision trees for continual learning from drifting data streams, Randomized Sketching Algorithms for Low-Memory Dynamic Optimization, Incremental CP Tensor Decomposition by Alternating Minimization Method, Efficient randomized tensor-based algorithms for function approximation and low-rank kernel interactions, Unnamed Item, Tensor Manifold with Tucker Rank Constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Tensor Decompositions and Applications
- A fast randomized algorithm for the approximation of matrices
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Row products of random matrices
- A New Truncation Strategy for the Higher-Order Singular Value Decomposition
- Computational Advertising: Techniques for Targeting Relevant Ads
- Hierarchical Singular Value Decomposition of Tensors
- Tensor Spaces and Numerical Tensor Calculus
- A Multilinear Singular Value Decomposition
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Practical Sketching Algorithms for Low-Rank Matrix Approximation
- A Practical Randomized CP Tensor Decomposition
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
- Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation
- Universality laws for randomized dimension reduction, with applications
- Computational Complexity
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem
