arXiv:2606.31061math.NAcs.CV2026-06

提出在线正交化张量分解算法,实时处理流数据且精度高。

Online TT-ALS for Streaming Tensor Decomposition with Incremental Orthogonalization

论文配图:Online TT-ALS for Streaming Tensor Decomposition with Incremental Orthogonalization
图 1 · 摘自论文原文
  • 通过顺序正交约束实现核心张量的高效精确更新
  • 计算复杂度降至O(I^{n-1} r),比传统方法快多个数量级
  • 适合低延迟实时场景,优于深度学习模型和现有在线方法

张量列车(TT)分解是分析高维数据的强大工具。现有算法可分为两类:传统的批处理方法与递归式在线方法。在流数据场景下,批处理方法通常重建精度更高但易内存溢出,而在线方法则更高效。本文提出在线TT-ALS(交替最小二乘)算法,通过顺序施加正交性约束,实现核心张量的高效且精确更新。理论上,我们证明该正交规范约束能保证局部目标函数单调下降及时间平滑性。计算上,确定性的单遍更新将秩依赖从二次降低至线性,总体复杂度为$\mathcal{O}(I^{n-1} r)$。实验表明,所提方法不仅在数学近似精度上优于现有在线技术,且在人类感知视频质量指标上表现更优。相比近期基于深度学习的方法,本代数方法实现了数量级加速。因此,该方法兼具高计算效率,适用于低延迟实时处理应用。

原文摘要 · Abstract (English)

Tensor Train (TT) decomposition is a powerful technique for analyzing high-dimensional data. Existing algorithms for computing TT decompositions can be categorized into two main types: conventional batch-based approaches and recursive online methods. In the context of streaming data, batch methods typically achieve higher reconstruction accuracy but often suffer from memory exhaustion, while online methods provide greater computational efficiency. In this work, we introduce Online TT-ALS (Alternating Least Squares), an algorithm that sequentially enforces orthogonality constraints. This approach allows for efficient and exact updates of the core tensor while maintaining high reconstruction accuracy. Theoretically, we prove that enforcing these orthogonal gauge constraints guarantees monotonic decrease of the local objective function and temporal smoothness. Computationally, our deterministic single-sweep update reduces the rank dependence from quadratic to linear, achieving an overall complexity of $\mathcal{O}(I^{n-1} r)$. Experimental results demonstrate that the proposed method outperforms existing online techniques not only in terms of mathematical approximation accuracy but also in human perception-based video quality metrics. Furthermore, compared to recent deep learning-based paradigms, our algebraic approach achieves speedups of several orders of magnitude. Consequently, our method exhibits high computational efficiency and is suitable for low-latency real-time processing applications.

张量分解在线学习低延迟流数据

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。