Saved in:
Bibliographic Details
Main Authors: Castillo, Alejandra, Haddock, Jamie, Hartsock, Iryna, Hoyos, Paulina, Kassab, Lara, Kryshchenko, Alona, Larripa, Kamila, Needell, Deanna, Suryanarayanan, Shambhavi, Djima, Karamatou Yacoubou
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2503.19155
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866910892227035136
author Castillo, Alejandra
Haddock, Jamie
Hartsock, Iryna
Hoyos, Paulina
Kassab, Lara
Kryshchenko, Alona
Larripa, Kamila
Needell, Deanna
Suryanarayanan, Shambhavi
Djima, Karamatou Yacoubou
author_facet Castillo, Alejandra
Haddock, Jamie
Hartsock, Iryna
Hoyos, Paulina
Kassab, Lara
Kryshchenko, Alona
Larripa, Kamila
Needell, Deanna
Suryanarayanan, Shambhavi
Djima, Karamatou Yacoubou
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2503_19155
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Block Gauss-Seidel methods for t-product tensor regression
Castillo, Alejandra
Haddock, Jamie
Hartsock, Iryna
Hoyos, Paulina
Kassab, Lara
Kryshchenko, Alona
Larripa, Kamila
Needell, Deanna
Suryanarayanan, Shambhavi
Djima, Karamatou Yacoubou
Numerical Analysis
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.
title Block Gauss-Seidel methods for t-product tensor regression
topic Numerical Analysis
url https://arxiv.org/abs/2503.19155