Tracking online low-rank approximations of higher-order incomplete streaming tensors.

Patterns (N Y)

PRISME Laboratory, University of Orléans, INSA CVL, 12 Rue de Blois, 45100 Orléans, France.

Published: June 2023

In this paper, we propose two new provable algorithms for tracking online low-rank approximations of high-order streaming tensors with missing data. The first algorithm, dubbed adaptive Tucker decomposition (ATD), minimizes a weighted recursive least-squares cost function to obtain the tensor factors and the core tensor in an efficient way, thanks to an alternating minimization framework and a randomized sketching technique. Under the canonical polyadic (CP) model, the second algorithm, called ACP, is developed as a variant of ATD when the core tensor is imposed to be identity. Both algorithms are low-complexity tensor trackers that have fast convergence and low memory storage requirements. A unified convergence analysis is presented for ATD and ACP to justify their performance. Experiments indicate that the two proposed algorithms are capable of streaming tensor decomposition with competitive performance with respect to estimation accuracy and runtime on both synthetic and real data.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC10318370PMC
http://dx.doi.org/10.1016/j.patter.2023.100759DOI Listing

Publication Analysis

Top Keywords

tracking online
8
online low-rank
8
low-rank approximations
8
streaming tensors
8
core tensor
8
tensor
5
approximations higher-order
4
higher-order incomplete
4
incomplete streaming
4
tensors paper
4

Similar Publications

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!