Estimating a random walk first-passage time from noisy or delayed observations

Research output: Contribution to journalArticlepeer-review

Abstract

A Gaussian random walk (or a Wiener process), possibly with drift, is observed in a noisy or delayed fashion. The problem considered in this paper is to estimate the first time τ the random walk reaches a given level. Specifically, the average p-moment (p ≥ 1) optimization problem inf ηE|η - τ| p is investigated where the infimum is taken over the set of stopping times that are defined on the observation process. When there is no drift, optimal stopping rules are characterized for both types of observations. When there is a drift, upper and lower bounds on inf ηE|η - τ| p are established for both types of observations. The bounds are tight in the large-level regime for noisy observations and in the large-level-large-delay regime for delayed observations. Noteworthy, for noisy observations there exists an asymptotically optimal stopping rule that is a function of a single observation. Simulation results are provided that corroborate the validity of the results for non-asymptotic settings.

Original languageEnglish
Article number6175957
Pages (from-to)4230-4243
Number of pages14
JournalIEEE Transactions on Information Theory
Volume58
Issue number7
DOIs
Publication statusPublished - 25 Jun 2012

Keywords

  • Change-point detection problem
  • Wiener process
  • estimation
  • optimal stopping theory
  • random walk
  • stopping time
  • tracking stopping time (TST)

Fingerprint

Dive into the research topics of 'Estimating a random walk first-passage time from noisy or delayed observations'. Together they form a unique fingerprint.

Cite this