arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1312.2287cs.ITmath.IT
收藏

混合观测下多序列的最快搜索

Quickest Search over Multiple Sequences with Mixed Observation

Jun Geng, Weiyu Xu, Lifeng Lai

摘要:

本文讨论了序列寻找一个独立同分布(i.i.d.)考虑通过搜索多个序列从概率分布$f_1$中提取的序列,其中一些序列从$f_1$中提取,而其他序列从不同的分布$f_0$中提取。允许观察员每次进行一次观察。最近的研究表明,如果每个观测值来自一个序列,则累积和检验是最优的。在本文中,我们提出了一种新的方法,其中每个观察可以是来自多个序列的样本的线性组合。测试有两个阶段。在第一阶段,即扫描阶段,采用一对序列的线性组合,希望扫描通过不太可能由$f_1$生成的序列,并快速识别一对序列,使得它们中的至少一个极有可能由$f_1$生成。在第二阶段,即细化阶段,人们更仔细地检查从第一阶段识别的对,并挑选一个序列作为最终序列。在这种设置下的问题属于一类多停时问题。特别是,它是一个有序的两个级联马尔可夫停时问题。我们使用多停时理论的工具得到最优解。最优解具有相当复杂的结构。为了便于实现,提出了一种低复杂度的算法,在扫描阶段观测器采用累积和检验,在细化阶段观测器采用序贯概率比检验。当$f_{1}$发生的先验概率较小时,分析了这种低复杂度算法的性能。分析和数值仿真结果表明,当$f_{1}$稀少时,该搜索策略可以显著减少搜索时间。

英文摘要:

The problem of sequentially finding an independent and identically distributed (i.i.d.) sequence that is drawn from a probability distribution $f_1$ by searching over multiple sequences, some of which are drawn from $f_1$ and the others of which are drawn from a different distribution $f_0$, is considered. The observer is allowed to take one observation at a time. It has been shown in a recent work that if each observation comes from one sequence, the cumulative sum test is optimal. In this paper, we propose a new approach in which each observation can be a linear combination of samples from multiple sequences. The test has two stages. In the first stage, namely scanning stage, one takes a linear combination of a pair of sequences with the hope of scanning through sequences that are unlikely to be generated from $f_1$ and quickly identifying a pair of sequences such that at least one of them is highly likely to be generated by $f_1$. In the second stage, namely refinement stage, one examines the pair identified from the first stage more closely and picks one sequence to be the final sequence. The problem under this setup belongs to a class of multiple stopping time problems. In particular, it is an ordered two concatenated Markov stopping time problem. We obtain the optimal solution using the tools from the multiple stopping time theory. The optimal solution has a rather complex structure. For implementation purpose, a low complexity algorithm is proposed, in which the observer adopts the cumulative sum test in the scanning stage and adopts the sequential probability ratio test in the refinement stage. The performance of this low complexity algorithm is analyzed when the prior probability of $f_{1}$ occurring is small. Both analytical and numerical simulation results show that this search strategy can significantly reduce the searching time when $f_{1}$ is rare.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑