RoS-Guard: Robust and Scalable Online Change Detection with Delay-Optimal Guarantees
Zelin Zhu, Yancheng Huang, Kai Yang
摘要
Online change detection (OCD) aims to rapidly identify change points in streaming data and is critical in applications such as power system monitoring, wireless network sensing, and financial anomaly detection. Existing OCD methods typically assume precise system knowledge, which is unrealistic due to estimation errors and environmental variations. Moreover, existing OCD problem optimization often struggle with efficiency in large-scale systems. To overcome these challenges, we propose RoS-Guard, a robust and optimal OCD algorithm tailored for linear systems with uncertainty. Through a tight relaxation and reformulation of the OCD optimization problem, RoS-Guard employs neural unrolling to enable efficient parallel computation via GPU acceleration. The algorithm provides theoretical guarantees on performance, including expected false alarm rate and worstcase average detection delay. Extensive experiments validate the effectiveness of RoS-Guard and demonstrate significant computational speedup in large-scale system scenarios.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper2
相关 Paper
- Triadic-OCD: Asynchronous Online Change Detection with Provable Robustness, Optimality, and ConvergenceYancheng Huang, Kai Yang, Zelin Zhu, Leian ChenICML 2024 · 被引用 2 次
- Non-parametric Online Change Point Detection on Riemannian ManifoldsXiuheng Wang, Ricardo Augusto Borsoi, Cédric RichardICML 2024 · 被引用 6 次
- Adaptive Model Pooling for Online Deep Anomaly Detection from a Complex Evolving Data StreamSusik Yoon, Youngjun Lee, Jae-Gil Lee, Byung Suk LeeKDD 2022 · 被引用 39 次
- Locally private online change point detectionThomas Berrett, Yi YuNeurIPS 2021 · 被引用 20 次
- Optimal Online Change Detection via Random Fourier FeaturesFlorian Kalinke, Shakeel Gavioli-AkilagunNeurIPS 2025 · 被引用 2 次
