Low-rank Tucker approximation of a tensor from streaming data
From MaRDI portal
(Redirected from Publication:5037558)
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
Cites work
- A fast randomized algorithm for the approximation of matrices
- A Multilinear Singular Value Decomposition
- A new truncation strategy for the higher-order singular value decomposition
- A Practical Randomized CP Tensor Decomposition
- A Riemannian trust region method for the canonical tensor rank approximation problem
- Computational Complexity
- Data streams: algorithms and applications.
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Hierarchical Singular Value Decomposition of Tensors
- scientific article; zbMATH DE number 2045481 (Why is no real title available?)
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Practical sketching algorithms for low-rank matrix approximation
- Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
- Row products of random matrices
- Sketching as a tool for numerical linear algebra
- Streaming low-rank matrix approximation with an application to scientific simulation
- Tensor Decompositions and Applications
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Tensor spaces and numerical tensor calculus
- Universality laws for randomized dimension reduction, with applications
Cited in
(54)- An efficient randomized algorithm for computing the approximate Tucker decomposition
- Tensor decision trees for continual learning from drifting data streams
- Efficient randomized tensor-based algorithms for function approximation and low-rank kernel interactions
- An efficient algorithm for computing the approximate t-URV and its applications
- Learning mean-field equations from particle data using WSINDy
- Randomized algorithms for the low multilinear rank approximations of tensors
- An algorithm for arbitrary-order cumulant tensor calculation in a sliding window of data streams
- Low-rank nonnegative tensor approximation via alternating projections and sketching
- Wedderburn rank reduction and Krylov subspace method for tensor approximation. I: Tucker case
- Randomized sketching algorithms for low-memory dynamic optimization
- Incremental CP tensor decomposition by alternating minimization method
- ISLET: fast and optimal low-rank tensor regression via importance sketching
- Structured Matrix Approximations via Tensor Decompositions
- Practical leverage-based sampling for low-rank tensor decomposition
- The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection
- A sharp blockwise tensor perturbation bound for orthogonal iteration
- Streaming low-rank matrix approximation with an application to scientific simulation
- Tucker Dimensionality Reduction of Three-Dimensional Arrays in Linear Time
- Tensor manifold with Tucker rank constraints
- Generative modeling via tensor train sketching
- Randomized algorithms for the computation of multilinear rank-(_1,_2,_3) approximations
- Robust Recovery of Low-Rank Matrices and Low-Tubal-Rank Tensors from Noisy Sketches
- Streaming Tensor Train Approximation
- 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
- Modewise operators, the tensor restricted isometry property, and low-rank tensor recovery
- Low-Rank Tucker Approximation of a Tensor From Streaming Data
- An Incremental Tensor Train Decomposition Algorithm
- Randomized tensor wheel decomposition
- Riemannian preconditioned coordinate descent for low multilinear rank approximation
- SVD-based algorithms for fully-connected tensor network decomposition
- 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
- A sequential multilinear Nyström algorithm for streaming low-rank approximation of tensors in Tucker format
- Scalable symmetric Tucker tensor decomposition
- A multilinear Nyström algorithm for low-rank approximation of tensors in Tucker format
- SVD-based algorithms for tensor wheel decomposition
- Tracking tensor ring decompositions of streaming tensors
- Subspace method of moments for \textit{ab initio} 3-D single particle cryo-EM reconstruction
- Efficient randomized algorithms for computing an approximation of the tensor train decomposition
- A direct method for computing the complex-valued triple decomposition of third-order tensors
- Near-linear time and fixed-parameter tractable algorithms for tensor decompositions
- Randomized sketched TT-GMRES for linear systems with tensor structure
- RTSMS: randomized Tucker with single-mode sketching
- Efficient algorithms for Tucker decomposition via approximate matrix multiplication
- Low-rank approximation algorithm using sparse projection and its applications
- Efficient randomized algorithms for fixed precision problem of approximate Tucker decomposition
- Fast and low-memory compressive sensing algorithms for low Tucker-rank tensor approximation from streamed measurements
- A randomized sketching trust-region secant method for low-memory dynamic optimization
- Compressed randomized t-CSVD and its applications
- Block-randomized stochastic methods for tensor ring decomposition
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)
