Block Gauss-Seidel methods for t-product tensor regression
read the original abstract
Randomized iterative algorithms, such as the randomized Kaczmarz method and the randomized Gauss-Seidel method, have gained considerable popularity due to their efficacy in solving matrix-vector and matrix-matrix regression problems. Our present work leverages the insights gained from studying such algorithms to develop regression methods for tensors, which are the natural setting for many application problems, e.g., image deblurring. In particular, we extend two variants of the block-randomized Gauss-Seidel method to solve a t-product tensor regression problem. We additionally develop methods for the special case where the measurement tensor is given in factorized form. We provide theoretical guarantees of the exponential convergence rate of our algorithms, accompanied by illustrative numerical simulations.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Linear convergence of Gearhart-Koshy accelerated Kaczmarz methods for tensor linear systems
The Gearhart-Koshy acceleration yields linear convergence to the least-norm solution for tensor linear systems with improved rates over plain Kaczmarz across incremental, shuffle-once, and random-reshuffling schemes.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.