Lune

KDD2026顶会

Fast and Accurate Online Coupled Matrix-Tensor Factorization via Frequency Regularization

Yong-chan Park, Seungjoo Lee, U Kang

2026年份
1被引次数

摘要

How can we efficiently and accurately factorize multi-source data in dynamic and real-time environments? Coupled matrix-tensor factorization (CMTF) is a powerful tool for such tasks, but existing methods often struggle with scalability, particularly when dealing with continuously streaming data. Traditional CMTF approaches, while effective at capturing complex relationships, suffer from computational inefficiencies and the need for retraining as new data arrive. Moreover, many techniques fail to properly incorporate the inherent temporal characteristics of the data, which could significantly enhance both accuracy and convergence speed.

In this paper, we propose FOCAL (Frequency-regularized Online Coupled Approximation for Low-rank factorization), an efficient CP decomposition method designed to enhance online coupled matrixtensor factorization. By effectively distinguishing between old and new data, FOCAL optimizes computational efficiency, reducing redundant computations and eliminating the need for full retraining in streaming settings. Furthermore, FOCAL integrates frequency regularization into an online CMTF framework, which mitigates overfitting and improves accuracy. Through extensive experiments, we demonstrate that FOCAL outperforms existing state-of-the-art methods in terms of both speed and accuracy. We also present results on anomaly detection using real-world data, showcasing FOCAL's effectiveness in identifying irregular patterns.

问问这篇 Paper

智能体会读完全文。

Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。

可以从这些问题问起

智能体调用

Luneget_paper_fulltext

在 Lune 里问

免费开始,无需绑卡

它引用的顶会 Paper9

相关 Paper

黄昏的海面,两侧是细线勾勒的悬崖