TY - GEN
T1 - LatentFlow
T2 - 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.1, KDD 2026
AU - Sun, Lijun
AU - Zhang, Shuai
AU - Xue, Xin
AU - Li, Lanhao
AU - Zhou, Haoyi
AU - Li, Jianxin
N1 - Publisher Copyright:
© 2026 Owner/Author.
PY - 2026/8/8
Y1 - 2026/8/8
N2 - Effectively modeling the complex and evolving dependencies among multiple variables is a key challenge in multivariate time series anomaly detection (MTSAD). Existing methods typically model channel dependencies in discrete time steps, either window-wise or point-wise. However, they face a granularity dilemma: window-wise approaches are too coarse to capture transient local changes, whereas fine-grained methods lack constraints on dependency continuity, making them susceptible to high-frequency noise and leading to dependency oscillation. Furthermore, since self-channel correlations typically dominate cross-channel signals, existing methods are biased towards self-dependencies, often overlooking subtle cross-channel deviations that indicate anomalies. In this paper, we propose LatentFlow, a novel framework that treats channel dependency evolution as a latent continuous dynamic process. Specifically, we model the evolution of channel dependencies using an Ornstein-Uhlenbeck (O-U) process. This introduces a mean-reverting property and structural inertia, allowing the model to capture smooth dependency shifts while maintaining robustness against structural noise. Additionally, we introduce a Dependency Decoupling Strategy to explicitly separate and rebalance self- and cross-channel patterns. Extensive experiments on multiple real-world datasets demonstrate that LatentFlow achieves state-of-the-art performance, validating the effectiveness of modeling the continuous dynamics of dependency evolution.
AB - Effectively modeling the complex and evolving dependencies among multiple variables is a key challenge in multivariate time series anomaly detection (MTSAD). Existing methods typically model channel dependencies in discrete time steps, either window-wise or point-wise. However, they face a granularity dilemma: window-wise approaches are too coarse to capture transient local changes, whereas fine-grained methods lack constraints on dependency continuity, making them susceptible to high-frequency noise and leading to dependency oscillation. Furthermore, since self-channel correlations typically dominate cross-channel signals, existing methods are biased towards self-dependencies, often overlooking subtle cross-channel deviations that indicate anomalies. In this paper, we propose LatentFlow, a novel framework that treats channel dependency evolution as a latent continuous dynamic process. Specifically, we model the evolution of channel dependencies using an Ornstein-Uhlenbeck (O-U) process. This introduces a mean-reverting property and structural inertia, allowing the model to capture smooth dependency shifts while maintaining robustness against structural noise. Additionally, we introduce a Dependency Decoupling Strategy to explicitly separate and rebalance self- and cross-channel patterns. Extensive experiments on multiple real-world datasets demonstrate that LatentFlow achieves state-of-the-art performance, validating the effectiveness of modeling the continuous dynamics of dependency evolution.
KW - dynamic dependency modeling
KW - time series anomaly detection
UR - https://www.scopus.com/pages/publications/105051067265
U2 - 10.1145/3770855.3818034
DO - 10.1145/3770855.3818034
M3 - 会议稿件
AN - SCOPUS:105051067265
T3 - Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
SP - 4498
EP - 4509
BT - KDD 2026 - Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2
PB - Association for Computing Machinery
Y2 - 9 August 2026 through 13 August 2026
ER -