An efficient two-sided sketching method for large-scale tensor decomposition based on transformed domains
An efficient two-sided sketching method for large-scale tensor decomposition based on transformed domains
Large tensors are frequently encountered in various fields such as computer vision, scientific simulations, sensor networks, and data mining. However, these tensors are often too large for convenient processing, transfer, or storage. Fortunately, they typically exhibit a low-rank structure that can be leveraged through tensor decomposition. However, performing large-scale tensor decomposition can be time-consuming. Sketching is a useful technique to reduce the dimensionality of the data. In this paper, we propose a novel two-sided sketching method based on the $\star_{L}$-product decomposition and transformed domains like the discrete cosine transformation. A rigorous theoretical analysis is also conducted to assess the approximation error of the proposed method. Specifically, we improve our method with power iteration to achieve more precise approximate solutions. Extensive numerical experiments and comparisons on low-rank approximation of synthetic large tensors and real-world data like color images and grayscale videos illustrate the efficiency and effectiveness of the proposed approach in terms of both CPU time and approximation accuracy.
math.OC, 68Q25, 68R10, 68U05
Cheng, Zhiguang
fa1a2ece-60dd-429d-bfba-45ced716aefb
Yu, Gaohang
304aa1da-05ff-48d0-a19d-1e3a74de273b
Cai, Xiaohao
de483445-45e9-4b21-a4e8-b0427fc72cee
Qi, Liqun
69936be7-f1aa-4c1f-b403-5bd5f3ba7d4c
25 April 2024
Cheng, Zhiguang
fa1a2ece-60dd-429d-bfba-45ced716aefb
Yu, Gaohang
304aa1da-05ff-48d0-a19d-1e3a74de273b
Cai, Xiaohao
de483445-45e9-4b21-a4e8-b0427fc72cee
Qi, Liqun
69936be7-f1aa-4c1f-b403-5bd5f3ba7d4c
[Unknown type: UNSPECIFIED]
Abstract
Large tensors are frequently encountered in various fields such as computer vision, scientific simulations, sensor networks, and data mining. However, these tensors are often too large for convenient processing, transfer, or storage. Fortunately, they typically exhibit a low-rank structure that can be leveraged through tensor decomposition. However, performing large-scale tensor decomposition can be time-consuming. Sketching is a useful technique to reduce the dimensionality of the data. In this paper, we propose a novel two-sided sketching method based on the $\star_{L}$-product decomposition and transformed domains like the discrete cosine transformation. A rigorous theoretical analysis is also conducted to assess the approximation error of the proposed method. Specifically, we improve our method with power iteration to achieve more precise approximate solutions. Extensive numerical experiments and comparisons on low-rank approximation of synthetic large tensors and real-world data like color images and grayscale videos illustrate the efficiency and effectiveness of the proposed approach in terms of both CPU time and approximation accuracy.
Text
2404.16580v4
- Author's Original
Available under License Other.
More information
Published date: 25 April 2024
Keywords:
math.OC, 68Q25, 68R10, 68U05
Identifiers
Local EPrints ID: 497987
URI: http://eprints.soton.ac.uk/id/eprint/497987
PURE UUID: c20abb55-2218-48df-8f48-2b8a3db68efb
Catalogue record
Date deposited: 05 Feb 2025 18:07
Last modified: 06 Feb 2025 03:01
Export record
Altmetrics
Contributors
Author:
Zhiguang Cheng
Author:
Gaohang Yu
Author:
Xiaohao Cai
Author:
Liqun Qi
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics