Practical sketching-based randomized tensor ring decomposition.

DOI10.1002/NLA.2548MaRDI QIDQ6584477zbMATH OpenFDO

Authors Hanyu Li

Publication date 7 August 2024

Published in Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/NLA.2548

zbMATH Keywords

alternating least squares problemKronecker sub-sampled randomized Fourier transformrandomized algorithmsketchingtensor ring decompositionTensorSketch

Mathematics Subject Classification ID

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

Cited in

(7)

• Randomized tensor wheel decomposition
• A random sampling algorithm for fully-connected tensor network decomposition with applications
• Tracking tensor ring decompositions of streaming tensors
• Accelerated alternating least squares for tensor wheel decomposition with applications
• A tensor network low rank completion method
• Block-randomized stochastic methods for tensor ring decomposition
• Efficient randomized algorithms for block tensor-tensor multiplication

This page was built for publication: Practical sketching-based randomized tensor ring decomposition.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6584477)