具有假阴性结果的最快检测问题
A quickest detection problem with false negatives
AI总结:
本文研究了具有假阴性结果的最快检测问题,提出了一个最优多停止问题,并通过自由边界方法得到了期望成本和最优策略的显式公式。
摘要:
我们提出了一个具有假阴性的最快检测问题变种。标准布朗运动在独立的指数随机时间获得漂移,该时间不直接可观测。基于对过程样本路径的连续时间观测,优化者必须在漂移出现后尽可能快地检测到它。优化者可以多次检查系统,每次检查需支付固定费用。如果在漂移出现前进行测试,则自然会得到阴性结果。然而,如果在漂移出现后进行测试,则可能无法检测到它并以概率ε∈(0,1)返回假阴性结果。优化结束当漂移最终被检测到时。该问题被数学上 formulated 为一个最优多停止问题,并显示其等价于一个递归最优停止问题。利用这种联系和自由边界方法,我们找到了期望成本和最优策略的显式公式。我们还表明,当ε=0时,我们的期望成本是Shiryaev经典最优检测问题中具有重新缩放模型参数的期望成本的仿射变换。
英文摘要:
We formulate and solve a variant of the quickest detection problem which features false negatives. A standard Brownian motion acquires a drift at an independent exponential random time which is not directly observable. Based on the observation in continuous time of the sample path of the process, an optimizer must detect the drift as quickly as possible after it has appeared. The optimizer can inspect the system multiple times upon payment of a fixed cost per inspection. If a test is performed on the system before the drift has appeared then, naturally, the test will return a negative outcome. However, if a test is performed after the drift has appeared, then the test may fail to detect it and return a false negative with probability $ε\in(0,1)$. The optimisation ends when the drift is eventually detected. The problem is formulated mathematically as an optimal multiple stopping problem, and it is shown to be equivalent to a recursive optimal stopping problem. Exploiting such connection and free boundary methods we find explicit formulae for the expected cost and the optimal strategy. We also show that when $ε= 0$ our expected cost is an affine transformation of the one in Shiryaev's classical optimal detection problem with a rescaled model parameter.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。