A note on the universal optimality criterion for full rank models

The aim of this note is to suggest a revised formulation of the universal optimality criterion for full rank models as stated in Kiefer (1975). We have presented the relevant results with indications of some possible applications.     

A method of deriving valid approximate expressions for bias in ratio estimation

The expectation of a ratio of two statistics is usually obtained by the method in which the denominator is expanded into a binomial series around its mean. However, this method can less generally be employed because the expansion of the denominator is not always valid. This paper presents a device in which the expectation of a ratio of two statistics can more generally be obtained. The device is to adopt a positive value as ‘catalyzer’. It can be applied not only to the ratio of estimates based on samples but also to ratio of any two statistics, if the denominator is positive and finite.     

A class of tests for testing ‘new is better than used’

A class of tests is proposed for testing H₀ F?(x) = e^?λx, λ > 0, x≥0 vs. H₁ F?(x + y) ≤ F?(x)F?(y), x, y≥0, with strict inequality for some x, y ≥ 0 (F = new is better than used). Efficiency comparisons of some tests within the class are made and a new test is proposed on the basis of these comparisons. Consistency and the asymptotic normality of the class of tests is proved under fairly broad conditions on the underlying entities.     

On regressing regression coefficients

This paper considers a regression model in which coefficients obtained from a previous regression are themselves the object of analysis. It is shown that the parameters of interest can be obtained in two ways: pooling across observations and subsamples, or a two-stage process of first estimating the coefficients within each subsample, and then using these coefficients as dependent variables in a second stage regression. The relative properties of these estimators are analyzed, and the conditions under which the two estimators are equivalent are derived.     

Φp-optimal second order designs for symmetric regions

Designs for quadratic regression on a cube, on a cube with truncated vertices and on a ball are studied in terms of a family of criteria, introduced by Kiefer (1974, 1975), that includes A-, D- and E-optimality. Both theoretical and numerical results on structure and performance are presented. In particular, D- and E-optimal designs are described and a procedure of construction of nearly robust (under variation of criterion) integer designs is suggested. Some examples are given for dimensions 4, 5 and 6.     

A stochastic Newton-Raphson method

A stochastic approximation procedure of the Robbins-Monro type is considered. The original idea behind the Newton-Raphson method is used as follows. Given n approximations X₁,…, X_n with observations Y₁,…, Y_n, a least squares line is fitted to the points (X_m, Y_m),…, (X_n, Y_n) where m<n may depend on n. The (n+1)st approximation is taken to be the intersection of the least squares line with y=0. A variation of the resulting process is studied. It is shown that this process yields a strongly consistent sequence of estimates which is asymptotically normal with minimal asymptotic variance.     

Recursive techniques for the construction of experimental designs

The construction of experimental designs by recursive techniques is studied in this paper. Formulae for the recursive addition or deletion of data from a design are derived for a typical sub-hypothesis situation of a general experimental design. These results are used to consider the recursive construction of experimental designs with respect to different optimality criteria. This approach to the construction of designs is quite different to that of the well-established theory of optimal design.     

Minimax subset selection for the multinomial distribution

Let (X₁,…,X_k) be a multinomial vector with unknown cell probabilities (p₁,?,p_k). A subset of the cells is to be selected in a way so that the cell associated with the smallest cell probability is included in the selected subset with a preassigned probability, P¹. Suppose the loss is measured by the size of the selected subset, S. Using linear programming techniques, selection rules can be constructed which are minimax with respect to S in the class of rules which satisfy the P¹-condition. In some situations, the rule constructed by this method is the rule proposed by Nagel (1970). Similar techniques also work for selection in terms of the largest cell probability.     

Some sufficient conditions for establishing (M,S)-optimality

Two sufficient conditions are given for an incomplete block design to be (M,S- optimal. For binary designs the conditions are (i) that the elements in each row, excluding the diagonal element, of the association matrix differ by at most one, and (ii) that the off-diagonal elements of the block characteristic matrix differ by at most one. It is also shown how the conditions can be utilized for nonbinary designs and that for blocks of size two the sufficient condition in terms of the association matrix can be attained.     

A survey of nested designs

A nest with parameters (r,k,λ)→(r′,k′,λ′) is a BIBD on (b,v,r,k,λ) where each block has a distinguished sublock of cardinality k, the sublocks forming a (b,v,r,k,λ)-design.These designs are ‘nested’ in the sense of W.T. Federer (1972), who recommended the use of these designs for the sequential addition of periods in marketing experiments in order to retain Youden design properties as rows are added. Note that for a Youden design, the b columns and v treatments are in an SBIBD arrangement with parameters v=b, k=r, and λ.