Incremental Tensor-Train Compression from Streaming TT-Formatted Data with Applications to Reduced-Order Modeling of Linear Kinetic Equations
Abstract
To mitigate the computational burden due to the high dimensionality of linear kinetic equations, low-rank solvers and data-driven reduced order models (ROMs) have been developed. Low-rank solvers based on matrix or tensor compression exploit phase-space low-rank structures within individual solutions, while data-driven ROMs exploit low-rank structures of the solution manifold across parameters of parametric multi-query applications such as sensitivity analysis and uncertainty quantification. It is attractive to combine them to exploit their complementary strengths. A key challenge is to extract a reduced basis without reconstructing full solution or prescribing the ranks. To address this challenge, we develop a deterministic incremental tensor-train (TT) compression algorithm that operates directly on streaming TT data and adapts the ranks to a prescribed approximation tolerance. Given a new TT tensor, the proposed method updates an accumulated TT representation via 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 core level, the algorithm avoids reconstructing either the incoming tensor or the accumulated full tensor. We establish approximation error bounds for the proposed approach. Moreover, we show that the accumulated TT representation provides a compressed analogue of proper orthogonal decomposition for full-order snapshot data. Using this connection, we construct reduced order models for linear kinetic equations directly from streaming low-rank solution data. 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.
Related
- Gap-Free Streaming PCA Beyond Rank-One Updates: Near-Optimal Rates and Applications to Differential Privacy
- Convolution Quadrature with Adaptive History Compression for Variable-Order Fractional Reaction--Diffusion Equations
- Hierarchical low-rank compression exploiting symmetric boundary integral equations in transmission scattering
- Global Hölder estimates for linearized Monge-Ampère equations in divergence form with applications to dual semigeostrophic equations and periodic homogenization
- Commutative Factorization of Nonlinear Second-Order Differential Equations: Theory and Applications
BibTeX
@misc{shang2026incremental,
title = {{Incremental Tensor-Train Compression from Streaming TT-Formatted Data with Applications to Reduced-Order Modeling of Linear Kinetic Equations}},
author = {Shuyuan Shang and Wei Guo and Zhichao Peng},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2606.26900},
eprint = {2606.26900},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2606.26900},
}
RIS
TY - UNPB
TI - Incremental Tensor-Train Compression from Streaming TT-Formatted Data with Applications to Reduced-Order Modeling of Linear Kinetic Equations
AU - Shuyuan Shang
AU - Wei Guo
AU - Zhichao Peng
PY - 2026
DA - 2026/10/08
PB - arXiv
DO - 10.48550/arxiv.2606.26900
UR - https://arxiv.org/abs/2606.26900
AB - To mitigate the computational burden due to the high dimensionality of linear kinetic equations, low-rank solvers and data-driven reduced order models (ROMs) have been developed. Low-rank solvers based on matrix or tensor compression exploit phase-space low-rank structures within individual solutions, while data-driven ROMs exploit low-rank structures of the solution manifold across parameters of parametric multi-query applications such as sensitivity analysis and uncertainty quantification. It is attractive to combine them to exploit their complementary strengths. A key challenge is to extract a reduced basis without reconstructing full solution or prescribing the ranks. To address this challenge, we develop a deterministic incremental tensor-train (TT) compression algorithm that operates directly on streaming TT data and adapts the ranks to a prescribed approximation tolerance. Given a new TT tensor, the proposed method updates an accumulated TT representation via 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 core level, the algorithm avoids reconstructing either the incoming tensor or the accumulated full tensor. We establish approximation error bounds for the proposed approach. Moreover, we show that the accumulated TT representation provides a compressed analogue of proper orthogonal decomposition for full-order snapshot data. Using this connection, we construct reduced order models for linear kinetic equations directly from streaming low-rank solution data. 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.
ER -