Skip to Main content Skip to Navigation
Conference papers

Adaptive Algorithms for Tracking Tensor-Train Decomposition of Streaming Tensors

Abstract : Tensor-train (TT) decomposition has been an efficient tool to find low order approximation of large-scale, high-order tensors. Existing TT decomposition algorithms are either of high computational complexity or operating in batch-mode, hence quite inefficient for (near) real-time processing. In this paper, we propose a novel adaptive algorithm for TT decomposition of streaming tensors whose slices are serially acquired over time. By leveraging the alternating minimization framework, our estimator minimizes an exponentially weighted least-squares cost function in an efficient way. The proposed method can yield an estimation accuracy very close to the error bound. Numerical experiments show that the proposed algorithm is capable of adaptive TT decomposition with a competitive performance evaluation on both synthetic and real data.
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download
Contributor : Remy Boyer <>
Submitted on : Thursday, June 11, 2020 - 3:56:23 PM
Last modification on : Friday, August 21, 2020 - 5:37:35 PM


Files produced by the author(s)


  • HAL Id : hal-02865257, version 1


Le Thanh, Karim Abed-Meraim, Nguyen Linh-Trung, Remy Boyer. Adaptive Algorithms for Tracking Tensor-Train Decomposition of Streaming Tensors. European Signal Processing Conference (EUSIPCO'20), Jan 2021, Amsterdam, Netherlands. ⟨hal-02865257⟩



Record views


Files downloads