Tracking tensor ring decompositions of streaming tensors
From MaRDI portal
Recommendations
- TR-STF: a fast and accurate tensor ring decomposition algorithm via defined scaled tri-factorization
- Online subspace learning and imputation by tensor-ring decomposition
- Low-rank Tucker approximation of a tensor from streaming data
- Streaming Tensor Train Approximation
- A sequential multilinear Nyström algorithm for streaming low-rank approximation of tensors in Tucker format
Cites work
- A note on tensor chain approximation
- A Practical Randomized CP Tensor Decomposition
- Fast approximation of matrix coherence and statistical leverage
- Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
- Faster Johnson-Lindenstrauss transforms via Kronecker products
- Faster least squares approximation
- Incremental algorithms for truncated higher-order singular value decompositions
- Incremental CP tensor decomposition by alternating minimization method
- Low-rank Tucker approximation of a tensor from streaming data
- On algorithms for and computing with the tensor ring decomposition
- Online subspace learning and imputation by tensor-ring decomposition
- Practical alternating least squares for tensor ring decomposition.
- Practical sketching-based randomized tensor ring decomposition.
- Streaming Tensor Train Approximation
- Tensor Decompositions and Applications
- Tensor-train decomposition
Cited in
(4)- TR-STF: a fast and accurate tensor ring decomposition algorithm via defined scaled tri-factorization
- Online subspace learning and imputation by tensor-ring decomposition
- An incremental randomized algorithm for singular value decomposition of streaming data matrices
- Randomized algorithms for computing tensor ring rounding
This page was built for publication: Tracking tensor ring decompositions of streaming tensors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6659771)
