🤖 AI Summary
This paper addresses the core challenge in change detection for nonstationary processes—where the post-change distribution evolves over time and is a priori unknown. Method: We propose a robust sequential detection framework based on the least favorable distribution, integrating minimax decision theory, nonstationary statistical modeling, and sequential hypothesis testing to construct an adaptive CUSUM-type algorithm capable of real-time, robust response to dynamic distributional shifts. Contribution/Results: To our knowledge, this is the first work to establish asymptotically minimax-optimal theoretical guarantees for sequential change detection under nonstationarity. Empirical evaluation on real-world public health and military monitoring datasets, as well as extensive simulations, demonstrates that our method reduces average detection delay by 23% compared to conventional approaches, while maintaining stable and controllable false alarm rates—thereby validating both theoretical soundness and practical superiority.
📝 Abstract
Optimal algorithms are developed for robust detection of changes in non-stationary processes. These are processes in which the distribution of the data after change varies with time. The decision-maker does not have access to precise information on the post-change distribution. It is shown that if the post-change non-stationary family has a distribution that is least favorable in a well-defined sense, then the algorithms designed using the least favorable distributions are robust and optimal. Non-stationary processes are encountered in public health monitoring and space and military applications. The robust algorithms are applied to real and simulated data to show their effectiveness.