Low-rank Tucker approximation of a tensor from streaming data
From MaRDI portal
Publication:5037558
DOI10.1137/19M1257718MaRDI QIDQ5037558FDOQ5037558
Authors: Yiming Sun, Yang Guo, Charlene Luo, Joel A. Tropp, Madeleine Udell 
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
Recommendations
- Streaming Tensor Train Approximation
- Streaming low-rank matrix approximation with an application to scientific simulation
- Fast low rank approximations of matrices and tensors
- Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
- Low-rank nonnegative tensor approximation via alternating projections and sketching
dimension reductionrandomized algorithmstreaming algorithmTucker decompositiontensor compressionsketching method
Multilinear algebra, tensor calculus (15A69) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Cites Work
- Tensor Decompositions and Applications
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Hierarchical Singular Value Decomposition of Tensors
- Title not available (Why is that?)
- A Multilinear Singular Value Decomposition
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Computational Complexity
- Tensor spaces and numerical tensor calculus
- Data streams: algorithms and applications.
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- A Practical Randomized CP Tensor Decomposition
- A fast randomized algorithm for the approximation of matrices
- Streaming low-rank matrix approximation with an application to scientific simulation
- A new truncation strategy for the higher-order singular value decomposition
- Sketching as a tool for numerical linear algebra
- Universality laws for randomized dimension reduction, with applications
- Row products of random matrices
- Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
- Practical sketching algorithms for low-rank matrix approximation
- A Riemannian trust region method for the canonical tensor rank approximation problem
Cited In (41)
- Low-Rank Tucker Approximation of a Tensor From Streaming Data
- An efficient algorithm for computing the approximate t-URV and its applications
- Incremental algorithms for truncated higher-order singular value decompositions
- Riemannian preconditioned coordinate descent for low multilinear rank approximation
- SVD-based algorithms for fully-connected tensor network decomposition
- A randomized algorithm for tensor singular value decomposition using an arbitrary number of passes
- An algorithm for arbitrary-order cumulant tensor calculation in a sliding window of data streams
- ISLET: fast and optimal low-rank tensor regression via importance sketching
- The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection
- Randomized algorithms for the computation of multilinear rank-\((\mu_1,\mu_2,\mu_3)\) approximations
- Communication Lower Bounds and Optimal Algorithms for Multiple Tensor-Times-Matrix Computation
- Sketch-based multiplicative updating algorithms for symmetric nonnegative tensor factorizations with applications to face image clustering
- Two-sided randomized algorithms for approximate \(K\)-term t-SVD
- Generative modeling via tensor train sketching
- Modewise operators, the tensor restricted isometry property, and low-rank tensor recovery
- An Incremental Tensor Train Decomposition Algorithm
- Robust Recovery of Low-Rank Matrices and Low-Tubal-Rank Tensors from Noisy Sketches
- Scalable symmetric Tucker tensor decomposition
- Parallel Algorithms for Computing the Tensor-Train Decomposition
- Practical leverage-based sampling for low-rank tensor decomposition
- A sequential multilinear Nyström algorithm for streaming low-rank approximation of tensors in Tucker format
- A multilinear Nyström algorithm for low-rank approximation of tensors in Tucker format
- SVD-based algorithms for tensor wheel decomposition
- Tensor manifold with Tucker rank constraints
- Title not available (Why is that?)
- Wedderburn rank reduction and Krylov subspace method for tensor approximation. I: Tucker case
- Randomized algorithms for the low multilinear rank approximations of tensors
- Streaming Tensor Train Approximation
- Structured Matrix Approximations via Tensor Decompositions
- An efficient randomized algorithm for computing the approximate Tucker decomposition
- Randomized sketching algorithms for low-memory dynamic optimization
- Low-rank nonnegative tensor approximation via alternating projections and sketching
- Practical sketching algorithms for low-rank Tucker approximation of large tensors
- Incremental CP tensor decomposition by alternating minimization method
- Tensor decision trees for continual learning from drifting data streams
- Tracking tensor ring decompositions of streaming tensors
- Tucker Dimensionality Reduction of Three-Dimensional Arrays in Linear Time
- Streaming low-rank matrix approximation with an application to scientific simulation
- Randomized tensor wheel decomposition
- Learning mean-field equations from particle data using WSINDy
- Efficient randomized tensor-based algorithms for function approximation and low-rank kernel interactions
Uses Software
This page was built for publication: Low-rank Tucker approximation of a tensor from streaming data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5037558)
