Selecting a Good Stochastic System for the Large Number of Alternatives

In this article, we present the problem of selecting a good stochastic system with high probability and minimum total simulation cost when the number of alternatives is very large. We propose a sequential approach that starts with the Ordinal Optimization procedure to select a subset that overlaps with the set of the actual best m% systems with high probability. Then we use Optimal Computing Budget Allocation to allocate the available computing budget in a way that maximizes the Probability of Correct Selection. This is followed by a Subset Selection procedure to get a smaller subset that contains the best system among the subset that is selected before. Finally, the Indifference-Zone procedure is used to select the best system among the survivors in the previous stage. The numerical test involved with all these procedures shows the results for selecting a good stochastic system with high probability and a minimum number of simulation samples, when the number of alternatives is large. The results also show that the proposed approach is able to identify a good system in a very short simulation time.     

On a sequential subset selection procedure for the least probable multinomial cell

This paper studies a sequential procedure R for selecting a random size subset that contains the multinomial cell which has the smallest cell probability. The stopping rule of the proposed procedure R is the composite of the stopping rules of curtailed sampling, inverse sampling, and the Ramey-Alam sampling. A reslut on the worst configuration is shown and it is employed in computing the procedure parameters that guarantee certain probability requirements. Tables of these procedure parameters, the corresponding probability of correct selection, the expected sample size, and the expected subset size are given for comparison purpose.     

A subset selection procedure for multinomial distributions

A subset selection procedure is developed for selecting a subset containing the multinomial population that has the highest value of a certain linear combination of the multinomial cell probabilities; such population is called the ‘best’. The multivariate normal large sample approximation to the multinomial distribution is used to derive expressions for the probability of a correct selection, and for the threshold constant involved in the procedure. The procedure guarantees that the probability of a correct selection is at least at a pre-assigned level. The proposed procedure is an extension of Gupta and Sobel's [14] selection procedure for binomials and of Bakir's [2] restrictive selection procedure for multinomials. One illustration of the procedure concerns population income mobility in four countries: Peru, Russia, South Africa and the USA. Analysis indicates that Russia and Peru fall in the selected subset containing the best population with respect to income mobility from poverty to a higher-income status. The procedure is also applied to data concerning grade distribution for students in a certain freshman class.     

Conditional probability of correct selection under the continuum partition with applications

The problem of selecting the best population from among a finite number of populations in the presence of uncertainty is a problem one faces in many scientific investigations, and has been studied extensively, Many selection procedures have been derived for different selection goals. However, most of these selection procedures, being frequentist in nature, don't tell how to incorporate the information in a particular sample to give a data-dependent measure of correct selection achieved for this particular sample. They often assign the same decision and probability of correct selection for two different sample values, one of which actually seems intuitively much more conclusive than the other. The methodology of conditional inference offers an approach which achieves both frequentist interpret ability and a data-dependent measure of conclusiveness. By partitioning the sample space into a family of subsets, the achieved probability of correct selection is computed by conditioning on which subset the sample falls in. In this paper, the partition considered is the so called continuum partition, while the selection rules are both the fixed-size and random-size subset selection rules. Under the distributional assumption of being monotone likelihood ratio, results on least favourable configuration and alpha-correct selection are established. These re-sults are not only useful in themselves, but also are used to design a new sequential procedure with elimination for selecting the best of k Binomial populations. Comparisons between this new procedure and some other se-quential selection procedures with regard to total expected sample size and some risk functions are carried out by simulations.     

Subset selection of the best treatment via many-one tests

The method of Gupta (1956, 1965) was developed to select a subset from k normal populations that contains the best populations with given probability. This paper shows a duality between the general goal of selecting a subset for the best population and many-one tests. A population should be regarded as ‘candidate’ for the best population and thus retained in the subset if the samples from the other populations are not significantly better. Based on this ‘idea’ a general selection procedure is proposed using many-one tests for the comparison of each population against the remaining ones.     

Mixed Graphical Model Selection Using Holm's Procedure

The problem of selecting a graphical model is considered as a performing simultaneously multiple tests. The control of the overall Type I error on the selected graph is done using the so famous Holm's procedure. We prove that when we use a consistent edge exclusion test the selected graph is asymptotically equal to the true graph with probability at least equal to a fixed level 1 ? α. This method is then used for the selection of mixed concentration graph models by performing the χ²-edge exclusion test. We also apply the method to two classical examples and to simulated data. We compare the overall error of the selected model with the one obtained using the stepwise method. We establish that the control is better when we use the Holm's procedure.     

Nonparametric predictive selection with early experiment termination

Nonparametric predictive inference (NPI) is a statistical approach based on few assumptions about probability distributions, with inferences based on data. NPI assumes exchangeability of random quantities, both related to observed data and future observations, and uncertainty is quantified using lower and upper probabilities. In this paper, units from several groups are placed simultaneously on a lifetime experiment and times-to-failure are observed. The experiment may be ended before all units have failed. Depending on the available data and few assumptions, we present lower and upper probabilities for selecting the best group, the subset of best groups and the subset including the best group. We also compare our approach of selecting the best group with some classical precedence selection methods. Throughout, examples are provided to demonstrate our method.     

Fractional Moments and Maximum Entropy: Geometric Meaning

We consider the problem of recovering a probability density on a bounded or unbounded subset D of [0, ∞), from the knowledge of its sequence of fractional moments within a maximum entropy (MaxEnt) setup. Based upon entropy convergence results previously formulated, the fractional moments are selected so that the entropy of the MaxEnt approximation be minimum. A geometric interpretation of the reconstruction procedure is formulated as follows: the two moment curves generated by the unknown density and its MaxEnt approximation are interpolating in Hermite-Birkoff sense; that is, they are both interpolating and tangent at the selected nodes.     

A Restricted Subset Selection Rule for Selecting at Least One of the t Best Normal Populations in Terms of Their Means When Their Common Variance is Known,Case II

Consider k( ? 2) normal populations with unknown means μ₁, …, μ_k, and a common known variance σ². Let μ_[1] ? ??? ? μ_[k] denote the ordered μ_i.The populations associated with the t(1 ? t ? k ? 1) largest means are called the t best populations. Hsu and Panchapakesan (2004) proposed and investigated a procedure R_HPfor selecting a non empty subset of the k populations whose size is at most m(1 ? m ? k ? t) so that at least one of the t best populations is included in the selected subset with a minimum guaranteed probability P* whenever μ_{[k ? t + 1]} ? μ_{[k ? t]} ? δ*, where P*?and?δ* are specified in advance of the experiment. This probability requirement is known as the indifference-zone probability requirement. In the present article, we investigate the same procedure R_HP for the same goal as before but when k ? t < m ? k ? 1 so that at least one of the t best populations is included in the selected subset with a minimum guaranteed probability P* whatever be the configuration of the unknown μ_i. The probability requirement in this latter case is termed the subset selection probability requirement. Santner (1976) proposed and investigated a different procedure (R_S) based on samples of size n from each of the populations, considering both cases, 1 ? m ? k ? t and k ? t < m ? k. The special case of t = 1 was earlier studied by Gupta and Santner (1973) and Hsu and Panchapakesan (2002) for their respective procedures.     

A combination multiple comparisons and subset selection procedure to identify treatments that are strictly inferior to the best

This paper considers the problem of identifying which treatments are strictly worse than the best treatment or treatments in a one-way layout, which has many important applications in screening trials for new product development. A procedure is proposed that selects a subset of the treatments containing only treatments that are known to be strictly worse than the best treatment or treatments. In addition, simultaneous confidence intervals are obtained which provide upper bounds on how inferior the treatments are compared with these best treatments. In this way, the new procedure shares the characteristics of both subset selection procedures and multiple comparison procedures. Some tables of critical points are provided for implementing the new procedure, and some examples of its use are given.     

Two new goals for selection based on proportions

Procedures are derived for selecting, with controlled probability of error, (1) a subset of populations which contains all populations better than a dual probability/proportion standard and (2) a subset of populations which both contains all populations better than an upper probability/proportion standard and also contains no populations worse than a lower probability/proportion standard. The procedures are motivated by current investigations in the area of computer performance evaluation.     

Truncation of the Bechhofer-Kiefer-Sobel sequential procedure for selecting the multinomial event which has the largest probability

In this article we study the effect of truncation on the performance of an open vector-at-a-time sequential sampling procedure (P^* _B) proposed by Bechhofer, Kiefer and Sobel , for selecting the multinomial event which has the largest probability. The performance of the truncated version (P^{* B} _T) is compared to that of the original basic procedure (P^* _B). The performance characteristics studied include the probability of a correct selection, the expected number of vector-observations (n) to terminate sampling, and the variance of n. Both procedures guarantee the specified probability of a correct selection. Exact results and Monte Carlo sampling results are obtained. It is shown that P^* _{B T}is far superior to P^* _B in terms of E{n} and Var{n}, particularly when the event probabilities are equal.The performance of P^* _{B T} is also compared to that of a closed vector-at-a-time sequential sampling procedure proposed for the same problem by Ramey and Alam; this procedure has here to fore been claimed to be the best one for this problem. It is shown that p^* _{B T} is superior to the Ramey-Alam procedure for most of the specifications of practical interest.     

SELECTING SATISFACTORY SECRETARIES

The probability of selecting the ath best out of n applicants in the secretary problem is evaluated by probabilistic arguments for monotone order k stopping rules. This leads to an explicit optimizing function for selecting (with payoffs) one of the k best applicants. This optimization problem can be solved directly both for a finite and for an unlimited number of applicants, yielding a variety of numerical results. Extensions are given for two choices with success if two applicants are selected from among the k best.     

A Two-stage minimax procedure with screening for selecting the largest normal mean

The problem of selecting the normal population with the largest population mean when the populations have a common known variance is considered. A two-stage procedure is proposed which guarantees the same probability requirement using the indifference-zone approach as does the single-stage procedure of Bechhofer (1954). The two-stage procedure has the highly desirable property that the expected total number of observations required by the procedure is always less than the total number of observations required by the corresponding single-stage procedure, regardless of the configuration of the population means. The saving in expected total number of observations can be substantial, particularly when the configuration of the population means is favorable to the experimenter. The saving is accomplished by screening out “non-contending” populations in the first stage, and concentrating sampling only on “contending” populations in the second stage.

The two-stage procedure can be regarded as a composite one which uses a screening subset-type approach (Gupta (1956), (1965)) in the first stage, and an indifference-zone approach (Bechhofer (1954)) applied to all populations retained in the selected sub-set in the second stage. Constants to implement the procedure for various k and P? are provided, as are calculations giving the saving in expected total sample size if the two-stage procedure is used in place of the corresponding single-stage procedure.     

Subset selection of superior populations when the number of populations is large

The situation where k populations are partitioned into one inferior group and one superior group is considered. The statistical problem is to select a random size subset of superior populations while trying to avoid including any inferior populations. A selection procedure is assumed to satisfy the condition that the probability of selecting at least one superior population is bounded below by P¹<1. The performance of a procedure is measured by the probability of including an inferior population.The asymptotic performance, as k→∞ of Gupta's traditional maximum type procedure ψ^G is considered in the location-model. For normally distributed populations, ψ^G turns out to be asymptotically optimal, provided the size of the inferior group does not become infinitely larger than the size of the superior group.     

Selection of the best with a preliminary test for two-parameter exponential distributions

This paper deals with the problem of selecting the best population from among k(≥ 2) two-parameter exponential populations. New selection procedures are proposed for selecting the unique best. The procedures include preliminary tests which allow the xperimenter to have an option to not select if the statistical evidence is not significant. Two probabilities, the probability to make a selection and the probability of a correct selection, are controlled by these selection procedures. Comparisons between the proposed selection procedures and certain earlier existing procedures are also made. The results show the superiority of the proposed selection procedures in terms of the required sample size.     

A two stage procedure for selecting δ∗-optimal means in the normal model

Suppose π₁,…,π_k are k normal populations with π_i having unknown mean μ_i and unknown variance σ². The population π_i will be called δ^?-optimal (or good) if μ_i is within a specified amountδ? of the largest mean. A two stage procedure is proposed which selects a subset of the k populations and guarantees with probability at least P^? that the selected subset contains only δ?-optimal π_i ’s. In addition to screening out non-good populations the rule guarantees a high proportion of sufficiently good π_i’S will be selected.     

Selecting the normal population with the largest mean when the variances are bounded

A multiple decision approach to the problem of selecting the population with the largest mean was formulated by Bechhofer (1954), where a single-sample solution was presented for the case of normal populations with known variances. In this paper the problem of selecting the normal population with the largest mean is considered when the population variances are unequal and unknown but are constrained only to be less than a specified upper bound. It is demonstrated that a slight modification of Bechhofer' s procedure will suffice to ensure the probability requirements under this simple constraint for cases of practical interest.     

On selecting a subset which contains all populations better than a control

Let π₁…, π_k denote k(≥ 2) populations with unknown means μ₁ , …, μ_k and variances σ₁ ² , …, σ_k ² , respectively and let π_o denote the control population having mean μ_o and variance σ_o ² . It is assumed that these populations are normally distributed with correlation matrix {ρ_ij}. The goal is to select a subset, of populations of π₁ , …, π_k which contains all the populations with means larger than or equal to the mean of the control one. Procedures are given for selecting such a subset so that the probability that all the populations with means larger than or equal to the mean of the control one are included in the selected subset is at least equal to a predetermined value P?(l/k < P? < 1). The goal treated here is a first step screening procedure that allows the experimenter to choose a subset and withhold judgement about which one has the largest mean. Then, if the one with the largest mean is desired it can be chosen from the selected subset on the basis of cost and other considerations. Percentage points are also included.