Abstract
A Bayesian multichannel change-point detection problem is studied in the following general setting. A multidimensional stochastic process is observed; some or all of its components may experience changes in distribution, simultaneously or not. The loss function penalizes for false alarms and detection delays, and the penalty increases with each missed change-point. For wide classes of stochastic processes, with or without nuisance parameters and practically any joint prior distribution of change-points, asymptotically pointwise optimal (APO) rules are obtained, translating the classical concept of Bickel and Yahav to the sequential change-point detection. These APO rules are attractive because of their simple analytic form and straightforward computation. An application to a multidimensional autoregressive time series is shown.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
