In this paper we deal with the problem of sequential testing of multiple hypotheses. The main goal is minimizing the expected sample size (ESS) under restrictions on the error probabilities. We take, as a criterion of minimization, a weighted sum of the ESS's evaluated at some points of interest in the parameter space aiming at its minimization under restrictions on the error probabilities. We use a variant of the method of Lagrange multipliers which is based on the minimization of an auxiliary objective function (called Lagrangian) combining the objective function with the restrictions, taken with some constants called multipliers. Subsequently, the multipliers are used to make the solution comply with the restrictions. We develop a computer-oriented method of minimization of the Lagrangian function, that provides, depending on the specific choice of the parameter points, optimal tests in different concrete settings, like in Bayesian, Kiefer-Weiss and other settings. To exemplify the proposed methods for the particular case of sampling from a Bernoulli population we develop a set of computer algorithms for designing sequential tests that minimize the Lagrangian function and for the numerical evaluation of test characteristics like the error probabilities and the ESS, and other related. We implement the algorithms in the R programming language. The program code is available in a public GitHub repository. For the Bernoulli model, we made a series of computer evaluations related to the optimality of sequential multi-hypothesis tests, in a particular case of three hypotheses. A numerical comparison with the matrix sequential probability ratio test is carried out. A method of solution of the multi-hypothesis Kiefer-Weiss is proposed, and is applied for a particular case of three hypotheses in the Bernoulli model.
翻译:本文研究多假设序贯检验问题,主要旨在在错误概率受到限制的情况下最小化期望样本大小(ESS)。我们采用一种加权求和的方法对特定参数空间内ESS进行评估,以达到在错误概率受到限制的情况下(即满足约束条件)最小化ESS的目标。我们使用拉格朗日乘数法的一种变体作为最小化标准,该方法基于最小化自带约束条件的目标函数(称为拉格朗日函数),并使用多个调整系数来确保解决方案符合所设的约束条件。我们提出了一种针对计算机的拉格朗日函数最小化解决方案,具体地,它提供了在具体设置下的不同最佳测试方法,如贝叶斯,Kiefer-Weiss等设置。为了说明所提出的方法,我们在伯努利样本抽样的特定情况下开发了一系列用于设计序贯测试的计算机算法,以最小化拉格朗日函数并对测试特性(如错误概率和ESS等)进行数字评估。这些算法是使用R编程语言编写的。程序代码托管在公共的GitHub代码库中。对于伯努利模型,我们对具体情况(即三个假设情况)下的序贯多假设测试的优化进行了一系列计算机评估,并与矩阵序贯概率比测试进行了数字比较。针对Kiefer-Weiss的多假设解决方案方法被提出,并在伯努利模型的特定情况下应用于三个假设情况。