Randomized algorithms for Kroncecker tensor decomposition and applications
Numerical Analysis
2025-05-22 v2 Numerical Analysis
Abstract
This paper proposes fast randomized algorithms for computing the Kronecker Tensor Decomposition (KTD). The proposed algorithms can decompose a given tensor into the KTD format much faster than the existing state-of-the-art algorithms. Our principal idea is to use the randomization framework to reduce computational complexity significantly. We provide extensive simulations to verify the effectiveness and performance of the proposed randomized algorithms with several orders of magnitude acceleration compared to the deterministic one. Our simulations use synthetics and real-world datasets with applications to tensor completion, video/image compression, image denoising, and image super-resolution
Cite
@article{arxiv.2412.02597,
title = {Randomized algorithms for Kroncecker tensor decomposition and applications},
author = {Salman Ahmadi-Asl and Naeim Rezaeian and Andre L. F. de Almeida and Yipeng Liu},
journal= {arXiv preprint arXiv:2412.02597},
year = {2025}
}