Minimax Robust Quickest Change Detection

DOI10.1109/TIT.2011.2104993MaRDI QIDQ5281041zbMATH OpenFDO

Authors Jayakrishnan Unnikrishnan, Venugopal V. Veeravalli, Sean P. Meyn

Publication date 27 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Detection theory in information and communication theory (94A13) Minimax problems in mathematical programming (90C47)

Cited in

(13)

• Bayesian quickest change detection for unnormalized and score-based models
• Robust quickest change detection in nonstationary processes
• Modeling and quickest detection of a rapidly approaching object
• Quickest change detection in statistically periodic processes with unknown post-change distribution
• Misspecified and Asymptotically Minimax Robust Quickest Change Diagnosis
• Remote state estimation with privacy against active eavesdroppers
• scientific article; zbMATH DE number 4043731 (Why is no real title available?)
• Bayesian quickest detection in sensor arrays
• Classifier design given an uncertainty class of feature distributions via regularized maximum likelihood and the incorporation of biological pathway knowledge in steady-state phenotype classification
• Asymptotically optimal robust information-based quick detection for general stochastic models with nonparametric postchange uncertainty
• Minimax optimal sequential hypothesis tests for Markov processes
• Robust change detection for large-scale data streams
• Quickest Change Detection With Observation Scheduling

This page was built for publication: Minimax Robust Quickest Change Detection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281041)