mlsanityData to 14 Oct 2026

Partially-Observable Sequential Change-Point Detection for Autocorrelated Data via Upper Confidence Region

arXiv 2404.00220 ↗First posted 30 Mar 2024stat.ML cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Sequential change point detection for multivariate autocorrelated data is a very common problem in practice. However, when the sensing resources are limited, only a subset of variables from the multivariate system can be observed at each sensing time point. This raises the problem of partially observable multi-sensor sequential change point detection. For it, we propose a detection scheme called adaptive upper confidence region with state space model (AUCRSS). It models multivariate time series via a state space model (SSM), and uses an adaptive sampling policy for efficient change point detection and localization. A partially-observable Kalman filter algorithm is developed for online inference of SSM, and accordingly, a change point detection scheme based on a generalized likelihood ratio test is developed. How its detection power relates to the adaptive sampling strategy is analyzed. Meanwhile, by treating the detection power as a reward, its connection with the online combinatorial multi-armed bandit (CMAB) problem is formulated and an adaptive upper confidence region algorithm is proposed for adaptive sampling policy design. Theoretical analysis of the asymptotic average detection delay is performed, and thorough numerical studies with synthetic data and real-world data are conducted to demonstrate the effectiveness of our method.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 9 of its 42 references that are in the map. First posted on arXiv 30 Mar 2024.

Builds on

9 of 42 references.

References · 9

  1. 2018Nearly Optimal Adaptive Procedure with Change Detection for Piecewise-Stationary Banditcited by 50
  2. 2017A Change-Detection based Framework for Piecewise-stationary Multi-Armed Bandit Problemcited by 49
  3. 2015Upper-Confidence-Bound Algorithms for Active Learning in Multi-Armed Banditscited by 29
  4. 2019Learning in Restless Multi-Armed Bandits via Adaptive Arm Sequencing Rulescited by 15
  5. 2017Adaptive Exploration-Exploitation Tradeoff for Opportunistic Banditscited by 8
  6. 2019AdaLinUCB: Opportunistic Learning for Contextual Banditscited by 4
  7. 2017Optimal Policies for Observing Time Series and Related Restless Bandit Problemscited by 3
  8. 2014Sequential Changepoint Approach for Online Community Detectioncited by 1
  9. 2015Sketching for Sequential Change-Point Detectioncited by 1

Built on by

Not cited yet.