Asymptotically optimal pointwise and minimax change-point detection for general stochastic models with a composite post-change hypothesis
DOI10.1016/j.jmva.2019.104541zbMath1428.62370arXiv1807.09613OpenAlexW2970248573MaRDI QIDQ2008231
Serguei Pergamenchtchikov, Alexander G. Tartakovsky
Publication date: 22 November 2019
Published in: Journal of Multivariate Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.09613
asymptotic optimalitychangepoint detectionquickest detectioncomposite post-change hypothesisweighted Shiryaev-Roberts procedure
Discrete-time Markov processes on general state spaces (60J05) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Stopping times; optimal stopping problems; gambling theory (60G40) Sequential statistical analysis (62L10) Optimal stopping in statistics (62L15)
Related Items (6)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Geometric ergodicity for classes of homogeneous Markov chains
- On optimality of the Shiryaev-Roberts procedure for detecting a change in distribution
- Comparison of EWMA, CUSUM and Shiryayev-Roberts procedures for detecting a shift in the mean
- Optimal stopping times for detecting changes in distributions
- SPRT and CUSUM in hidden Markov models
- Asymptotically optimal pointwise and minimax quickest change-point detection for dependent data
- Uniform concentration inequality for ergodic diffusion processes observed at discrete times
- The tail of the stationary distribution of a random coefficient \(\text{AR}(q)\) model.
- A note on the run length of false alarm of a change-point detection policy
- Almost optimal sequential tests of discrete composite hypotheses
- Is Average Run Length to False Alarm Always an Informative Criterion?
- Asymptotic Exponentiality of the Distribution of First Exit Times for a Class of Markov Processes with Applications to Quickest Change Detection
- Numerical Comparison of CUSUM and Shiryaev–Roberts Procedures for Detecting Changes in Distributions
- RANDOM COEFFICIENT AUTOREGRESSIVE PROCESSES:A MARKOV CHAIN ANALYSIS OF STATIONARITY AND FINITENESS OF MOMENTS
- Asymptotic Optimality of Mixture Rules for Detecting Changes in General Stochastic Models
- Information bounds and quick detection of parameter changes in stochastic systems
- Third-order Asymptotic Optimality of the Generalized Shiryaev--Roberts Changepoint Detection Procedures
- On Asymptotic Optimality in Sequential Changepoint Detection: Non-iid Case
- Asymptotic Optimality of Change-Point Detection Schemes in General Continuous-Time Models
- On Optimum Methods in Quickest Detection Problems
- Procedures for Reacting to a Change in Distribution
- General Asymptotic Bayesian Theory of Quickest Change Detection
- A Bayes Approach to a Quality Control Model
- Discussion on “Is Average Run Length to False Alarm Always an Informative Criterion?” by Yajun Mei
This page was built for publication: Asymptotically optimal pointwise and minimax change-point detection for general stochastic models with a composite post-change hypothesis