Pith. sign in

REVIEW

Regularized Kaczmarz Algorithms for Tensor Recovery

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2102.06852 v1 pith:5WAXR3WN submitted 2021-02-13 math.OC cs.NAmath.NA

classification math.OCcs.NAmath.NA
keywords recoverytensoralgorithmsmethodsapplicationskaczmarzlow-rankrecently
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Tensor recovery has recently arisen in a lot of application fields, such as transportation, medical imaging and remote sensing. Under the assumption that signals possess sparse and/or low-rank structures, many tensor recovery methods have been developed to apply various regularization techniques together with the operator-splitting type of algorithms. Due to the unprecedented growth of data, it becomes increasingly desirable to use streamlined algorithms to achieve real-time computation, such as stochastic optimization algorithms that have recently emerged as an efficient family of methods in machine learning. In this work, we propose a novel algorithmic framework based on the Kaczmarz algorithm for tensor recovery. We provide thorough convergence analysis and its applications from the vector case to the tensor one. Numerical results on a variety of tensor recovery applications, including sparse signal recovery, low-rank tensor recovery, image inpainting and deconvolution, illustrate the enormous potential of the proposed methods.

Discussion (0). Continue with ORCID to comment.

Pith tools