Tracking tensor ring decompositions of streaming tensors

DOI10.1007/s40314-024-03019-4MaRDI QIDQ6659771

Hanyu Li, Unnamed Author

Publication date: 9 January 2025

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

importance samplingrandomized algorithmalternating least squaresuniform samplingtensor ring decompositionleverage scoreKronecker sub-sampled randomized Fourier transformstreaming tensor

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• Tensor Decompositions and Applications
• Tensor-Train Decomposition
• A note on tensor chain approximation
• Faster least squares approximation
• On algorithms for and computing with the tensor ring decomposition
• A Practical Randomized CP Tensor Decomposition
• Incremental CP Tensor Decomposition by Alternating Minimization Method
• Faster Johnson–Lindenstrauss transforms via Kronecker products
• Low-Rank Tucker Approximation of a Tensor from Streaming Data
• Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
• Streaming Tensor Train Approximation
• Incremental algorithms for truncated higher-order singular value decompositions
• Online subspace learning and imputation by tensor-ring decomposition
• Practical alternating least squares for tensor ring decomposition.
• Practical sketching-based randomized tensor ring decomposition.

This page was built for publication: Tracking tensor ring decompositions of streaming tensors