Minimax Optimal Sequential Tests for Multiple Hypotheses

Michael Fauss, A. Zoubir, H. Poor
{"title":"Minimax Optimal Sequential Tests for Multiple Hypotheses","authors":"Michael Fauss, A. Zoubir, H. Poor","doi":"10.1109/ALLERTON.2018.8635956","DOIUrl":null,"url":null,"abstract":"Statistical hypothesis tests are referred to as robust if they are insensitive to small, random deviations from the underlying model. For two hypotheses and fixed sample sizes, the robust testing is well studied and understood. However, few results exist for the case in which the number of samples is variable (i.e., sequential testing) and the number of hypotheses is larger than two (i.e., multiple hypothesis testing). This paper outlines a theory of minimax optimal sequential tests for multiple hypotheses under general distributional uncertainty. It is shown that, in analogy to the fixed sample size case, the minimax solution is an optimal test for the least favorable distributions, i.e., a test that optimally separates the most similar feasible distributions. The joint similarity of multiple distributions is shown to be determined by a weighted f-dissimilarity, whose corresponding function is given by the unique solution of a nonlinear integral equation and whose weights are given by the likelihood ratios of the past samples. As a consequence, the least favorable distributions depend on the past observations and the underlying random process becomes a Markov-process whose state variable coincides with the test statistic.","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ALLERTON.2018.8635956","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Statistical hypothesis tests are referred to as robust if they are insensitive to small, random deviations from the underlying model. For two hypotheses and fixed sample sizes, the robust testing is well studied and understood. However, few results exist for the case in which the number of samples is variable (i.e., sequential testing) and the number of hypotheses is larger than two (i.e., multiple hypothesis testing). This paper outlines a theory of minimax optimal sequential tests for multiple hypotheses under general distributional uncertainty. It is shown that, in analogy to the fixed sample size case, the minimax solution is an optimal test for the least favorable distributions, i.e., a test that optimally separates the most similar feasible distributions. The joint similarity of multiple distributions is shown to be determined by a weighted f-dissimilarity, whose corresponding function is given by the unique solution of a nonlinear integral equation and whose weights are given by the likelihood ratios of the past samples. As a consequence, the least favorable distributions depend on the past observations and the underlying random process becomes a Markov-process whose state variable coincides with the test statistic.
多假设的极大极小最优序贯检验
如果统计假设检验对基础模型的小的随机偏差不敏感,则称为稳健检验。对于两个假设和固定的样本量,稳健测试得到了很好的研究和理解。然而,对于样本数量可变(即序列检验)和假设数量大于两个(即多假设检验)的情况,几乎没有结果存在。本文提出了一般分布不确定性条件下多假设的极大极小最优序贯检验理论。结果表明,与固定样本量的情况类似,极大极小解是最不利分布的最优检验,即最优分离最相似可行分布的检验。多个分布的联合相似度由加权的f-不相似度决定,其对应的函数由非线性积分方程的唯一解给出,其权重由过去样本的似然比给出。因此,最不利的分布依赖于过去的观测结果,潜在的随机过程成为状态变量与检验统计量一致的马尔可夫过程。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信