Nearly-Optimal Sequential Tests for Finitely Many Parameter Values
有限参数取值下的近似最优序贯检验AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:研究对象是通用序贯检验与决策理论,摘要未指向所列经济或金融应用领域。
反馈分类问题有限参数取值下的近似最优序贯检验AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Combinations of one-sided sequential probability ratio tests (SPRT's) are shown to be "nearly optimal" for problems involving a finite number of possible underlying distributions. Subject to error probability constraints, expected sample sizes (or weighted averages of them) are minimized to within $o(1)$ asymptotically. For sequential decision problems, simple explicit procedures are proposed which "do exactly what a Bayes solution would do" with probability approaching one as the cost per observation, $c$, goes to zero. Exact computations for a binomial testing problem show that efficiencies of about 97${\tt\%}$ are obtained in some "small-sample" cases.