Journal
MACHINE LEARNING-SCIENCE AND TECHNOLOGY
Volume 2, Issue 1, Pages -Publisher
IOP Publishing Ltd
DOI: 10.1088/2632-2153/abad87
Keywords
Tensor Ring-Tensor Train (TR-TT) decompositions; randomized algorithm; random projection
Categories
Funding
- Ministry of Education and Science of the Russian Federation [14.756.31.0001]
Ask authors/readers for more resources
Randomized algorithms are efficient techniques for analyzing big data tensors, particularly in Tensor Ring format. The focus is on using random projection technique for decomposing large-scale data tensors in TR format. Simulations and performance comparisons are provided to support the presentation and efficiency of the algorithms.
Randomized algorithms are efficient techniques for big data tensor analysis. In this tutorial paper, we review and extend a variety of randomized algorithms for decomposing large-scale data tensors in Tensor Ring (TR) format. We discuss both adaptive and nonadaptive randomized algorithms for this task. Our main focus is on the random projection technique as an efficient randomized framework and how it can be used to decompose large-scale data tensors in the TR format. Simulations are provided to support the presentation and efficiency, and performance of the presented algorithms are compared.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available