English
Related papers

Related papers: On robust stopping times for detecting changes in …

200 papers

Given a heterogeneous time-series sample, the objective is to find points in time (called change points) where the probability distribution generating the data has changed. The data are assumed to have been generated by arbitrary unknown…

Machine Learning · Statistics 2015-05-13 Azadeh Khaleghi , Daniil Ryabko

Statistical dependence between hypotheses poses a significant challenge to the stability of large scale multiple hypotheses testing. Ignoring it often results in an unacceptably large spread in the false positive proportion even though the…

Methodology · Statistics 2018-10-15 Sairam Rayaprolu , Zhiyi Chi

This note considers a variation of the full-information secretary problem where the random variables to be observed are independent and identically distributed. Consider $X_1,\dots,X_n$ to be an independent sequence of random variables, let…

Probability · Mathematics 2017-09-11 José A. Islas

Quickest change point detection is concerned with the detection of statistical change(s) in sequences while minimizing the detection delay subject to false alarm constraints. In this paper, the problem of change point detection is studied…

Information Theory · Computer Science 2015-06-19 George Atia

Stopping times are used in applications to model random arrivals. A standard assumption in many models is that they are conditionally independent, given an underlying filtration. This is a widely useful assumption, but there are…

Probability · Mathematics 2024-11-21 Philip Protter , Alejandra Quintos

We solve for the statistics of the first detection of a quantum system in a particular desired state, when the system is subject to a projective measurement at independent identically distributed random time intervals. We present formulas…

Quantum Physics · Physics 2021-03-05 David A. Kessler , Eli Barkai , Klaus Ziegler

A new class of stochastic processes called independent and periodically identically distributed (i.p.i.d.) processes is defined to capture periodically varying statistical behavior. A novel Bayesian theory is developed for detecting a…

Signal Processing · Electrical Eng. & Systems 2019-04-09 Taposh Banerjee , Prudhvi Gurram , Gene Whipps

Many industrial and security applications employ a suite of sensors for detecting abrupt changes in temporal behavior patterns. These abrupt changes typically manifest locally, rendering only a small subset of sensors informative.…

Machine Learning · Computer Science 2023-06-14 Aditya Gopalan , Venkatesh Saligrama , Braghadeesh Lakshminarayanan

We consider the problem of distributed hypothesis testing (or social learning) where a network of agents seeks to identify the true state of the world from a finite set of hypotheses, based on a series of stochastic signals that each agent…

Multiagent Systems · Computer Science 2020-04-06 Shreyas Sundaram , Aritra Mitra

This paper investigates change point detection in state space models, in which the pre-change distribution $f^{\theta_0}$ is given, while the poster distribution $f^{\theta}$ after change is unknown. The problem is to raise an alarm as soon…

Probability · Mathematics 2019-06-11 Cheng-Der Fuh

Most of the literature on change-point analysis by means of hypothesis testing considers hypotheses of the form H0 : \theta_1 = \theta_2 vs. H1 : \theta_1 != \theta_2, where \theta_1 and \theta_2 denote parameters of the process before and…

Methodology · Statistics 2016-11-26 Holger Dette , Dominik Wied

The forward prediction problem for a binary time series $\{X_n\}_{n=0}^{\infty}$ is to estimate the probability that $X_{n+1}=1$ based on the observations $X_i$, $0\le i\le n$ without prior knowledge of the distribution of the process…

Probability · Mathematics 2008-06-19 Gusztav Morvai

When analysing time series an important issue is to decide whether the time series is stationary or a random walk. Relaxing these notions, we consider the problem to decide in favor of the I(0)- or I(1)-property. Fixed-sample statistical…

Statistics Theory · Mathematics 2018-05-01 Ansgar Steland

This paper has been withdrawn by the authors. Please see arXiv:1302.6058. We consider the sequential joint detection and estimation problem. Minimizing the average stopping time subject to a combination of detection and estimation…

Methodology · Statistics 2013-04-15 Yasin Yilmaz , George V. Moustakides , Xiaodong Wang

Let \xi_0,\xi_1,...,\xi_{\omega-1} be observations from the hidden Markov model with probability distribution P^{\theta_0}, and let \xi_{\omega},\xi_{\omega+1},... be observations from the hidden Markov model with probability distribution…

Statistics Theory · Mathematics 2007-06-13 Cheng-Der Fuh

The problem of quickest detection of a change in the distribution of a sequence of independent observations is considered. It is assumed that the pre-change distribution is known (accurately estimated), while the only information about the…

Statistics Theory · Mathematics 2023-09-29 Liyan Xie , Yuchen Liang , Venugopal V. Veeravalli

In this work we consider time series with a finite number of discrete point changes. We assume that the data in each segment follows a different probability density functions (pdf). We focus on the case where the data in all segments are…

Data Analysis, Statistics and Probability · Physics 2007-05-23 Ali Mohammad-Djafari , Olivier Feron

Let $X_1,X_2,...$ be a discrete-time stochastic process with a distribution $P_\theta$, $\theta\in\Theta$, where $\Theta$ is an open subset of the real line. We consider the problem of testing a simple hypothesis $H_0:$ $\theta=\theta_0$…

Statistics Theory · Mathematics 2009-12-23 Andrey Novikov , Petr Novikov

We provide a novel analysis of Wald's sequential probability ratio test based on information theoretic measures for symmetric thresholds, symmetric noise, and equally likely hypotheses under the assumption that the test exactly terminates…

Information Theory · Computer Science 2017-08-24 Meik Dörpinghaus , Édgar Roldán , Izaak Neri , Heinrich Meyr , Frank Jülicher

We study the problem of covert quickest change detection in a discrete-time setting, where a sequence of observations undergoes a distributional change at an unknown time. Unlike classical formulations, we consider a covert adversary who…

Information Theory · Computer Science 2026-02-18 Amir Reza Ramtin , Philippe Nain , Don Towsley