快速且低成本的基于 Krylov 的协方差平滑
Fast and Cheap Krylov-Based Covariance Smoothing
AI总结:
本文提出 TReK 算法,通过带范围限制的张量化共轭梯度和矩阵级运算,高效估计大规模协方差张量,在速度与内存上较现有方法提升一个数量级。
摘要:
我们提出了 Tensorized-and-Restricted Krylov(TReK,张量化受限 Krylov)方法,这是一种用于在大观测规模下估计协方差张量的简单高效算法。TReK 扩展了共轭梯度法以纳入范围限制,使其可用于多种协方差平滑应用。通过利用矩阵级运算,它在计算速度和内存成本方面均实现显著改进,相比现有方法提升一个数量级。TReK 在不存在舍入误差时保证有限步收敛,并在实践中快速收敛,因此非常适合大规模问题。该算法还具有高度灵活性,支持广泛的正向张量和投影张量。
英文摘要:
We introduce the Tensorized-and-Restricted Krylov (TReK) method, a simple and efficient algorithm for estimating covariance tensors with large observational sizes. TReK extends the conjugate gradient method to incorporate range restrictions, enabling its use in a variety of covariance smoothing applications. By leveraging matrix-level operations, it achieves significant improvements in both computational speed and memory cost, improving over existing methods by an order of magnitude. TReK ensures finite-step convergence in the absence of rounding errors and converges fast in practice, making it well-suited for large-scale problems. The algorithm is also highly flexible, supporting a wide range of forward and projection tensors.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。