Minimax Robust Quickest Change Detection

DOI10.1109/TIT.2011.2104993zbMATH Open1366.94154MaRDI QIDQ5281041FDOQ5281041

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)

• Minimax optimal sequential hypothesis tests for Markov processes
• Title not available (Why is that?)
• Misspecified and Asymptotically Minimax Robust Quickest Change Diagnosis
• Asymptotically optimal robust information-based quick detection for general stochastic models with nonparametric postchange uncertainty
• Modeling and quickest detection of a rapidly approaching object
• Quickest change detection in statistically periodic processes with unknown post-change distribution
• Bayesian quickest change detection for unnormalized and score-based models
• Robust quickest change detection in nonstationary processes
• 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
• Robust change detection for large-scale data streams
• Remote state estimation with privacy against active eavesdroppers
• Quickest Change Detection With Observation Scheduling
• Bayesian quickest detection in sensor arrays

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)