RoS-Guard: Robust and Scalable Online Change Detection with Delay-Optimal Guarantees

Authors

  • Zelin Zhu School of Computer Science and Technology, Tongji University, China
  • Yancheng Huang School of Computer Science and Technology, Tongji University, China
  • Kai Yang School of Computer Science and Technology, Tongji University, China. Shenzhen Loop Area Institute, China. MOE Key Laboratory of Embedded Systems and Service Computing of Tongji University, China.

DOI:

https://doi.org/10.1609/aaai.v40i34.40160

Abstract

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 methods 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 worst-case average detection delay. Extensive experiments validate the effectiveness of RoS-Guard and demonstrate significant computational speedup in large-scale system scenarios.

Downloads

Published

2026-03-14

How to Cite

Zhu, Z., Huang, Y., & Yang, K. (2026). RoS-Guard: Robust and Scalable Online Change Detection with Delay-Optimal Guarantees. Proceedings of the AAAI Conference on Artificial Intelligence, 40(34), 29214–29222. https://doi.org/10.1609/aaai.v40i34.40160

Issue

Section

AAAI Technical Track on Machine Learning XI