Hypothesis Designs for Three-Hypothesis Test Problems

As a helpful guide for applications, the alternative hypotheses of the three-hypothesis test problems are designed under the required error probabilities and average sample number in this paper. The asymptotic formulas and the proposed numerical quadrature formulas are adopted, respectively, to obtain the hypothesis designs and the corresponding sequential test schemes under the Koopman-Darmois distributions. The example of the normal mean test shows that our methods are quite efficient and satisfactory for practical uses.


Introduction
In practice, the multihypothesis test problems are of considerable interest in the areas of engineering, agriculture, clinical medicine, psychology, and so on.For instance, the multihypothesis tests are involved in pattern recognition 1-4 , multiple-resolution radar detection 5-7 , products' comparisons 8, 9 , and information detection 10 .Before the inspections, the hypotheses must be determined according to such practical needs as the balance of risks and costs.As Wetherill and Glazebrook 11 pointed out, combinations of hypotheses, risks, and costs may need to be tried iteratively until an acceptable design is attained.This bothers and burdens the practitioners.
To avoid too many troublesome trials and to produce the hypotheses directly, we discuss the hypothesis designs under the controlled risks and expected costs in this paper.As an initial exploration, only the three-hypothesis test problems are considered here.Indeed, our methods may extend to the multihypothesis cases.
In practice, test costs are mainly determined by sample sizes.Therefore, the sample size becomes an issue relating to the statistical analysis of problems in many aspects; see for example, Chen et al. 12 , Oliveira et al. 13 , Li and Zhao 14 , Li et al. 15 , Bakhoum and Toma 16 , Cattani 17 , as well as Cattani and Kudreyko 18 .Accordingly, we consider the Average Sample Number ASN , which is one of the most important values in evaluating the expected costs of sequential test schemes.
In the three-hypothesis test problem, the null hypothesis is always set as a standard and medium status.For example, Anderson 8 discussed the three-hypothesis test problem to decide whether the difference of two yarns' strength is zero the null hypothesis , positive or negative.Realistically, the standard and medium status denoted as θ 0 is definite, while the two alternatives beside it need to be designed to balance the risks and costs.Thus, in this paper, we try to design the alternatives θ −1 and θ 1 θ −1 < θ 0 < θ 1 under the required error probabilities and ASN for testing the parameter θ of the Koopman-Darmois distribution To simplify the discussion, we only consider the designs of the two alternative hypotheses symmetric with the null hypothesis, that is, θ 1 − θ 0 θ 0 − θ −1 k > 0 .Actually, the asymmetric designs may be obtained by extending our methods slightly.
Then, the test problem here is For the multihypothesis test problems, Armitage 19 provided a classical test scheme by simultaneously applying the method of Sequential Probability Ratio Test SPRT on each pair of the hypotheses.This test scheme pattern is simple and easy to implement.When testing the three hypotheses for the Koopman-Darmois distribution 1.1 , Armitage's scheme may be illustrated as in Figure 1, where AL//CM are boundaries for "θ θ 1 versus θ θ 0 " and CP//DQ are for "θ θ 0 versus θ θ −1 " when the boundaries for "θ θ 1 versus θ θ −1 " are encircled by AL and DQ and thus are neglected.According to Figure 1, the decision rule should be Continue sampling without any decision, otherwise, 1.3 where T n n i 1 X i and X 1 , X 2 , . . .are independent sequential observations from a Koopman-Darmois distribution.
For the given θ −1 , θ 0 , and θ 1 , the test scheme in Figure 1 is decided by 6 parameters n 0 , a, c, d, ψ, ϕ .ψ and ϕ may be determined according to Armitage 19   In the three-hypothesis test problems, the error probabilities α and β should be assigned to the error probabilities γ 1 , γ 2 , γ 3 , γ 4 in correspondence with the requirements
And the request on the ASN should be where N > 0 is a provided integer and θ ASN ∈ Θ is the point at which the ASN needs to be controlled.θ ASN may take values of θ −1 , θ 0 , θ 1 , and so on according to practical needs.Then, under the constraints 1.4 and 1.5 , we may find the proper k, n 0 , a, c, d by virtue of their relationships with the error probabilities and ASN.
Unfortunately, however, to the best knowledge of the authors, the accurate formulas for the performances of the three-hypothesis test scheme are still unavailable possibly because of its sequential feature and anomalistic continuing sampling area.In the following, the hypothesis designs and the test scheme parameters are determined under the required error probabilities and ASN in terms of some approximate expressions, that is, the asymptotic formulas and the proposed numerical quadrature formulas.

Designs under Asymptotic Formulas
In this section, we try to find the hypothesis designs and test schemes under the required error probabilities and ASN by virtue of the asymptotic formulas of the multihypothesis sequential test scheme by Dragalin et al. in 22,23 .Firstly, we discuss how to control the error probabilities.Let C i be the critical value of the logarithmic likelihood ratio function for accepting θ i , and let R i be the probability limit of incorrectly accepting θ i , i −1, 0, 1.According to Dragalin et al. 22 , under the condition of equal prior probabilities for the three hypotheses, the probability of wrongly accepting θ i for the Armitage 19 scheme may be controlled by R i if the critical value C i is set as Thus, the error probabilities γ 1 , γ

2.2
Note that the expressions in 2.2 define the relations between the hypothesis design parameter k and the test scheme parameters n 0 , a, c, d , while k has not been determined so far.
In the following, the hypothesis design parameter k is found with the help of Dragalin et al.'s asymptotic ASN formulas 23 .
Based on the nonlinear renewal theory, Dragalin et al. 23 summarized and developed the asymptotic ASN formulas under max{α, β} → 0. Specifically, when θ 1 − θ 0 θ 0 − θ −1 , the asymptotic ASN formulas under the two alternatives θ −1 and θ 1 are where And for the null hypothesis θ 0 under where .5641895835 here , and v is the value related to the covariance of the logarithmic likelihood ratio functions.
Notice that the approximate ASN formulas 2.3 and 2.4 only depend on the hypothesis design parameter k when θ 0 is given.Therefore, to find the proper hypothesis design under the desired number N, we set up an equation about k to meet the ASN requirement on one of the three hypothesis values, that is, where θ ASN may be θ −1 , θ 0 , or θ 1 .
Then, the hypothesis design parameter k is the solution to 2.5 and the test scheme with n 0 , a, c, d may be obtained correspondingly according to 2.2 .Illustrations are provided in Example 1 for testing the normal mean with the variance known.
Accordingly, we have In this example, the test scheme parameters should be And for the normal distribution N μ, 1 , there are where φ • and Φ • are the probability density function p.d.f. and cumulative distribution function c.d.f. of the standard normal distribution, respectively.
Consider the following 4 cases, respectively:

2.8
Then, solving 2.5 , we obtain the hypothesis designs k as shown in Column 2 of Tables 1, 2, 3, and 4. The corresponding test scheme parameters n 0 , a, tan ψ from 2.6 are listed in Columns 3-5 of Tables 1-4.To evaluate the method's efficiency, we record the Monte Carlo simulation study results with 1,000,000 replicates in Tables 5, 6, 7, and 8, where ASN μ ASN is the simulated value of ASN μ ASN and ε is the relative difference between ASN μ ASN and N. Note that the simulated probabilities under μ −1 are neglected here since they are nearly equivalent to their counterparts under μ 1 in terms of the schemes' symmetry.
Obviously, the accuracy of the solution k to 2.5 is decided by the efficiency of the ASN formulas 2.3 and 2.4 .On one hand, from Dragalin et al. 23 and the ε's in Tables 5-8, we conclude that the formulas in 2.3 for ASN θ −1 and ASN θ 1 are more efficient than the one in 2.4 for ASN θ 0 when testing the normal mean.On the other hand, the asymptotic ASN formulas perform better under smaller error probabilities since the asymptotic limit is taken as max{α, β} → 0. For applications, with such a simple computation, the efficiency of the design is quite satisfactory for small error probabilities conditions.However, this method may only serve to control the ASN on the three hypothesis values since the asymptotic ASN formulas out of these points are absent so far.And the quantities D θ i , O θ i i −1, 0, 1 , and v should be deduced according to specific distributions see 23 .Besides, the discrepancies between the real performances and the required ones show the method's conservativeness.In the next section, an improved method is proposed and more efficient formulas are developed through the numerical quadrature.

Designs under Numerical Quadrature Formulas
This section proposes a method to obtain more efficient hypothesis designs and test schemes through a system of equations based on the numerical quadrature formulas of the error probabilities and ASN.
In studies by Payton and Young in 20, 21 , for the provided hypotheses, the error probabilities γ 1 , γ 2 , γ 3 , γ 4 are approximately attained by solving a system of equations about the 4 scheme parameters n 0 , a, c, d .This method is hoped to fully make use of the required error probabilities and to obtain efficient designs.Enlightened by Payton and Young, we propose to find the hypothesis design and test scheme by solving the following system of equations: ASN θ ASN N.

3.1
Obviously, the key is to find the formulas of the error probabilities and ASN on the left side of the equations in 3.1 .Unfortunately, the available approximate formulas cannot meet applicable needs well.For example, Payton and Young 20, 21 adopted the formulas under the continuous-time process and the required minimum sample size before decisions, and obtained some inefficient results.Also, as mentioned in Section 2, Dragalin et al.'s results are restricted to the conditions of small error probabilities and θ ASN θ i i −1, 0, 1 22, 23 .
To find efficient and applicable designs, we develop the approximate formulas through the numerical quadrature for the three-hypothesis test scheme's performances on the error probabilities and ASN.
To deduce the formulas for the realistic discrete-time situation, we denote n t as the minimum integer that is not less than n 0 .Let L j and U j be the values on the two boundaries DQ and AL in Figure 1 at n j, that is, L j d j tan ϕ, U j a j tan ψ, j 1, . . ., n t .Denote c L c n t − n 0 tan ϕ, c U c n t − n 0 tan ψ, a a n t tan ψ, and d d n t tan ϕ.With the decision rule 1.3 , we rewrite the system of 3.1 as , the point of accepting H 1 or H −1 when n ≤ n t .N 1 θ is the average sample number from a point in c U , a at n n t to the point of making a decision when n > n t .And N −1 θ is the average sample number from a point in d , c L at n n t to the point of making a decision when n > n t .
The following theorem provides the approximate formulas through the numerical quadrature for the quantities in 3.2 .In fact, these formulas are developed by a stepwise dealing for the continuing sampling area before n 0 and the results by Li and Pu in 24 for the parallel lines areas inside AL//CM and inside CP//DQ, respectively.With such an idea, the proof of Theorem 3.1 is trivial and is neglected here.Theorem 3.1.Assume that X 1 , X 2 , . . .are i.i.d.observations.Let f θ x and F θ x be the p.d.f. and c.d.f. of X, respectively.Assume that F − θ x P θ X < x .Denote g 1θ x f θ x , and g j 1θ x , where u j i is the ith numerical quadrature root for L j , U j , i 1, . . ., m, j 1, . . ., n t − 1, and ω u is the corresponding weight for the numerical quadrature root u.Let u n t i and u n t i be the ith numerical quadrature root for c U , a and for d , c L , respectively, i 1, . . ., m.
Then, the approximate values

3.10
where 10 Notice that the values on the left side of the equations in 3.2 must be obtained through a computer program with much iterative work, which reveals the method's complexity in computation and impairs the speed of solving the system of 3.2 .Nevertheless, the time it costs is tolerable when the accuracy of solving the equations is not too demanded.
Example 1 Continued .Consider the same problems as those in Example 1 in Section 2. By applying the formulas 3.3 -3.12 and the 64 Gaussian quadrature roots, we solve the system of 3.2 in a computer program.The hypothesis designs and the corresponding test schemes are listed in Columns 6-9 of Tables 1-4.As a comparison with the method under the asymptotic formulas in Section 2, ε k in Column 10 of Tables 1-4 records the relative difference between the two hypothesis designs of the two methods.The Monte Carlo simulation study with 1,000,000 replicates in Tables 9, 10, 11, and 12 reveal the schemes' real performances.
The real performances in  show that the requirements on controlling the error probabilities and ASN may be fully made use of under this method and the numerical quadrature formulas are almost accurate.Therefore, the hypothesis designs and test schemes are highly efficient in terms of, for instance, more efficient designs with smaller k in Tables 1-4 under this method.
To further explain the methods, an example of the airbag quality inspection is provided in the appendix.

Conclusions and Remarks
For the three-hypothesis test problems, the methods of designing the hypotheses, together with obtaining the corresponding test schemes, are proposed by adopting asymptotic formulas or numerical quadrature formulas in this paper.As a helpful guide for practitioners, they aid to directly find proper hypotheses under controlled risks and costs in preventing from too many iterative trials on combinations of hypotheses to meet practical needs.
The asymptotic formulas and the numerical quadrature formulas are both alternative tools for the hypothesis designs.Several aspects should be considered when choosing between them in applications.1 The method with numerical quadrature formulas outperforms the one under the asymptotic formulas especially when the error probabilities are not very small, as the example shows.In reality, the required error probabilities always range from 0.05 to 0.30 in sequential inspections, which seems to suggest choosing the numerical quadrature formulas to obtain efficient designs.
2 In computation, the asymptotic formulas provide great convenience for applications, while the numerical quadrature formulas demand much iterative computational work especially when the number of numerical quadrature roots is large.But from the computation with the 64 Gaussian quadrature roots in the example, the time it costs in a common computer is tolerable if the start values for the system of equations are proper.We recommend finding the designs under the asymptotic formulas first, and then apply them as starts to obtain more efficient hypotheses from the numerical quadrature formulas when needed.
3 When adopting the asymptotic formulas, the expressions for the quantities D θ i , O θ i i −1, 0, 1 , and v should be developed for a specific distribution see 23 .For the use of numerical quadrature formulas, the quadrature roots may be particularly arranged to fit the support points in the discrete distributions e.g, see Reynolds and Stoumbos 25 .And for the θ ASN out of θ −1 , θ 0 , θ 1 , only the method with numerical quadrature formulas may take effect.
Actually, the two methods may apply to any distribution out of the Koopman-Darmois family.However, the test schemes under these distributions may be different from that in Figure 1, and the numerical quadrature formulas should be changed according to the test scheme patterns.
For the hypothesis designs asymmetric with the null hypothesis or the multihypothesis test problems, the methods proposed in this paper are still applicable by some extensions of adding more constraints on the designs.The hypothesis design problems under other requests, for example, under the desire of stopping sampling before a limit guaranteed by a provided probability, are still open to scholars and practitioners.Taking the simulated observations from N 0, 1 by Li et al. in 26 , we may reach a decision of accepting H 0 when T 3 −0.0642falls in c 3 − n 0 tan ϕ, c 3 − n 0 tan ψ −0.7975, 0.7975 according to the test process in Table 13.
Under the method with Gaussian quadrature formulas, the hypothesis test problem should be H −1 : μ −1.3025 vs. H 0 : μ 0 vs. H 1 : μ 1.3025. A.2 Also taking the simulated observations from N 0, 1 by Li et al. in 26 , we may accept H 0 after inspecting the third airbag according to the test process in Table 14.

1
under the Koopman-Darmois distribution 1.1 , then the remaining 4 parameters n 0 , a, c, d form the scheme.Altogether with the hypothesis design value k in the test problem 1.2 , the 5 underdetermined values are k, n 0 , a, c, d .
Figure 1 2 , γ 3 , γ 4 are in control if we follow the critical values in 2.1 , where R −1 γ 4 , R 0 min{γ 1 , γ 2 }, and R 1 γ 3 .Setting the critical values C −1 , C 0 , C 1 equal to the corresponding logarithmic likelihood ratio functions, we have the following expressions for the test scheme parameters under the Koopman-Darmois distribution 1.1 :

Table 5 :
Simulated performances for the schemes under asymptotic formulas in Table1.

Table 6 :
Simulated performances for the schemes under asymptotic formulas in Table2.

Table 7 :
Simulated performances for the schemes under asymptotic formulas in Table3.

Table 8 :
Simulated performances for the schemes under asymptotic formulas in Table4.

Table 9 :
Simulated performances for the schemes under Gaussian quadrature formulas in Table1.

Table 10 :
Simulated performances for the schemes under Gaussian quadrature formulas in Table2.

Table 11 :
Simulated performances for the schemes under Gaussian quadrature formulas in Table3.

Table 12 :
Simulated performances for the schemes under Gaussian quadrature formulas in Table4.

Table 13 :
Test process under the test scheme from asymptotic formulas.