Skip to content

Incremental Tensor-Train Compression from Streaming TT-Formatted Data: Applications to Reduced-Order Modeling

Jun 2026 · arXiv.org · Vol abs/2606.26900 · 0 citations · 25 references
Computer Science Mathematics

TL;DR

A deterministic incremental TT compression algorithm that operates directly on streaming TT-formatted data and corresponds to a compressed analogue of standard proper orthogonal decomposition for full-order snapshot data, enabling reduced-order models to be constructed directly from streaming low-rank solution data through operations on TT cores, without first reconstructing full snapshots.

Abstract

High-dimensional tensor data streams arise naturally in scientific and engineering applications, such as simulations of kinetic equations and quantum systems, where samples become available sequentially and are often already represented in compressed low-rank tensor formats. Existing streaming tensor-train (TT) algorithms typically construct or update representations from dense tensor data or randomized sketches. However, when high-dimensional data are generated directly in TT or related low-rank formats, reconstructing dense tensors solely for the purpose of compression is unnecessary and computationally prohibitive. We develop a deterministic incremental TT compression algorithm that operates directly on streaming TT-formatted data. Given a new TT tensor, the proposed method updates an accumulated TT representation through core-wise projection, residual orthogonalization, and adaptive enrichment, retaining only the complementary information that cannot be represented within a prescribed tolerance. By operating entirely at the level of TT cores, the algorithm avoids reconstructing either the incoming tensor or the accumulated full tensor. We establish approximation error bounds for the proposed incremental approach. Moreover, we show that the accumulated TT representation corresponds to a compressed analogue of standard proper orthogonal decomposition for full-order snapshot data, enabling reduced-order models to be constructed directly from streaming low-rank solution data through operations on TT cores, without first reconstructing full snapshots. Numerical experiments on parametric radiative transfer equations demonstrate that the proposed method achieves comparable reconstruction accuracy with substantially reduced wall time and yields efficient and accurate ROMs directly from compressed low-rank data.

View source

Similar papers

Conference Jul 2026

DATT: Dimension-Augmented Tensor-Train Decomposition for Neural Network Compression

Traditional model reduction techniques for neural network compression usually leverage existing matrix/tensor decomposition methods to explore the redundancy among model parameters, which may overlook the local structures of the models. In this work, we propose a novel low-rank approximation algorithm, called Dimension...

Yu-Chuan Tai, Cheng-Yu Sie, Che-Rung Lee · 0 citations
Open access Dec 2024

Randomized Algorithms for Streaming Low‐Rank Approximation in Tree Tensor Network Format

This work presents the tree tensor network Nyström (TTNN), an algorithm that extends recent research on streamable tensor approximation to the more general tree tensor network format, enabling a unified treatment of various existing methods.

Alberto Bucci, Gianfranco Verzella · 3 citations
#artificial intelligence Preprint Aug 2026

Iterative tensor network transformations for element-wise evaluation of elementary and filtering functions

Tensor networks are powerful formats for compressing large-scale data. However, their application to general data processing has been limited by the difficulty of performing nonlinear operations. Here, we introduce iterative tensor network transformations (ITNTs), a general algorithmic framework for the element-wise ev...

Xiao Wang, Tomohiro Hashizume, Pia Siegl et al. · 2 citations
Book Open access Jul 2026

Optimizing Streaming Tensor Decomposition on GPU

ASTRA is a framework that optimizes the holistic streaming CPD process on GPU that integrates the memory pool and asynchronous strategy with compact storage format to reduce idle cycles and execution latency and devises a similarity-aware updating mechanism to reduce the overall workload.

Wenqing Lin, Jianuo Sheng, Shuqin Feng et al. · 0 citations
Preprint Jul 2026

Tensor-Based Reduced-Order Modeling for Optimization-Based Inverse Problems

We develop a tensor reduced-order modeling (TROM) framework for optimization-based inverse problems governed by parameter-dependent dynamical systems. The approach approximates the parameter-to-observation map directly in tensor-train format, using either TT-SVD or TT-Cross compression, and integrates the resulting rep...

S. Islam, Andreas Mang, Maxim A. Olshanskii · 1 citation
Open access Oct 2025

Efficient Tensor Completion Algorithms for Highly Oscillatory Operators

A novel reformulation of the butterfly structure as a compact tensor network is proposed, leading to speedups of orders of magnitude and significant accuracy improvements for large matrices compared to state‐of‐the‐art low‐rank matrix and QTT tensor completion algorithms.

Navjot Singh, Edgar Solomonik, X. Li et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.