The accelerated tensor Kaczmarz algorithm with adaptive parameters for solving tensor systems

Solving tensor systems is a common task in scientific computing and artificial intelligence. In this paper, we propose a tensor randomized average Kaczmarz method with adaptive parameters that exponentially converges to the unique least Frobenius norm solution of a given consistent tensor system und...

Full description

Saved in:
Bibliographic Details
Published in:Applied numerical mathematics Vol. 202; pp. 100 - 119
Main Authors: Liao, Yimou, Li, Wen, Yang, Dan
Format: Journal Article
Language:English
Published: Elsevier B.V 01.08.2024
Subjects:
ISSN:0168-9274, 1873-5460
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Solving tensor systems is a common task in scientific computing and artificial intelligence. In this paper, we propose a tensor randomized average Kaczmarz method with adaptive parameters that exponentially converges to the unique least Frobenius norm solution of a given consistent tensor system under the t-product structure. In order to accelerate convergence, a tensor average Kaczmarz method based on stochastic heavy ball momentum technique (tAKSHBM) is proposed. The tAKSHBM method utilizes iterative information to update parameters instead of relying on prior information, addressing the problem in the adaptive learning of parameters. Additionally, the tAKSHBM method based on Fourier transform is proposed, which can be effectively implemented in a distributed environment. It is proven that the iteration sequences generated by all the proposed methods are convergent for given consistent tensor systems. Finally, we conduct experiments on both synthetic data and practical applications to support our theoretical results and demonstrate the effectiveness of the proposed algorithms.
ISSN:0168-9274
1873-5460
DOI:10.1016/j.apnum.2024.04.016