Asymptotic near-minimaxity of the randomized Shiryaev-Roberts-Pollak change-point detection procedure in continuous time

From MaRDI portal
Publication:4580434

DOI10.1137/S0040585X97T988848zbMATH Open1396.62184arXiv1607.03294OpenAlexW2964096523WikidataQ129406365 ScholiaQ129406365MaRDI QIDQ4580434FDOQ4580434


Authors: Aleksey S. Polunchenko Edit this on Wikidata


Publication date: 15 August 2018

Published in: Theory of Probability & Its Applications (Search for Journal in Brave)

Abstract: For the classical continuous-time quickest change-point detection problem it is shown that the randomized Shiryaev-Roberts-Pollak procedure is asymptotically nearly minimax-optimal (in the sense of Pollak 1985) in the class of randomized procedures with vanishingly small false alarm risk. The proof is explicit in that all of the relevant performance characteristics are found analytically and in a closed form. The rate of convergence to the (unknown) optimum is elucidated as well. The obtained optimality result is a one-order improvement of that previously obtained by Burnaev et al. (2009) for the very same problem.


Full work available at URL: https://arxiv.org/abs/1607.03294




Recommendations




Cites Work


Cited In (10)





This page was built for publication: Asymptotic near-minimaxity of the randomized Shiryaev-Roberts-Pollak change-point detection procedure in continuous time

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