The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Optimum Designs in Regression Problems
Open accessAbstract
Although regression problems have been considered by workers in all sciences for many years, until recently relatively little attention has been paid to the optimum design of experiments in such problems. At what values of the independent variable should one take observations, and in what proportions? The purpose of this paper is to develop useful computational procedures for finding optimum designs in regression problems of estimation, testing hypotheses, etc. In Section 2 we shall develop the theory for the case where the desired inference concerns just one of the regression coefficients, and illustrative examples will be given in Section 3. In Section 4 the theory for the case of inference on several coefficients is developed; here there is a choice of several possible optimality criteria, as discussed in [1]. In Section 5 we treat the problem of global estimation of the regression function, rather than of the individual coefficients. We shall now indicate briefly some of the computational aspects of the search for optimum designs by considering the problem of Section 2 wherein the inference concerns one of $k$ regression coefficients. For the sake of concreteness, we shall occasionally refer here to the example of polynomial regression on the real interval $\lbrack -1, 1\rbrack$, where all observations are independent and have the same variance. The quadratic case is rather trivial to treat by our methods, so we shall sometimes refer here to the case of cubic regression. In the latter case we suppose all four regression coefficients to be unknown, and we want to estimate or test a hypothesis about the coefficient $a_3$ of $x^3$. If a fixed number $N$ of observations is to be taken, we can think of representing the proportion of observations taken at any point $x$ by $\xi(x)$, where $\xi$ is a probability measure on $\lbrack -1, 1\rbrack$. To a first approximation (which is discussed in Section 2), we can ignore the fact that in what follows $N\xi$ can take only integer values. We consider three methods of attacking the problem of finding an optimum $\xi$: A. The direct approach is to compute the variance of the best linear estimator of $a_3$ as a function of the values of the independent variable at which observations are taken or, equivalently, as a function of the moments of $\xi$. Denoting by $\mu_i$ the $i$th moment of $\xi$, and assuming $\xi$ to be concentrated entirely on more than three points (so that $a_3$ is estimable), we find easily that the reciprocal of this variance is proportional to $$\frac{\mu^2_5(\mu^2_1 - \mu_2) + 2\mu_5(\mu^2_2 \mu_3 + \mu_3 \mu_4 - \mu_1 \mu^2_3 - \mu_1 \mu_2 \mu_4)\\- \mu^3_4 + \mu^2_4(\mu^2_2 + 2\mu_1 \mu_3) - 3\mu_4 \mu_2 \mu^2_3 + \mu^4_3}{\mu_4(\mu_2 - \mu^2_1) - \mu^2_3 - \mu^3_2 + 2\mu_1 \mu_2 \mu_3} + \mu_6$$ in the case of cubic regression. The problem is to find a $\xi$ on $\lbrack -1, 1\rbrack$ which maximizes this expression. Thus, this direct approach leads to a calculation which appears quite formidable. This is true even if one uses the remark on symmetry of the next paragraph and restricts attention to symmetrical $\xi$, so that $\mu_i = 0$ for $i$ odd. For polynomials of higher degree or for regression functions which are not polynomials, the difficulties are greater. B. The results of Section 2 yield the following approach to the problem: Let $c_0 + c_1x + c_2x^2$ be a best Chebyshev approximation to $x^3$ on $\lbrack -1, 1\rbrack$, i.e., such that the maximum over $\lbrack -1, 1\rbrack$ of $|x^3 - (c_0 + c_1x + c_2x^2)|$ is a minimum over all choices of the $c_i$, and suppose $B$ is the subset of $\lbrack -1, 1\rbrack$ where the maximum of this absolute value is taken on. Then $\xi$ must give measure one to $B$, and the weights assigned by $\xi$ to the various points of $B$ (there are four in this case) can be found either by solving the linear equations (2.10) or by computing these weights so as to make $\xi$ a maximum strategy for the game discussed in Section 2. Two points should be mentioned: (1) In the general polynomial case, where there are $k$ parameters ($k = 4$ here), the results described in [10], p. 42, or in Section 2 below imply that there is an optimum $\xi$ concentrated on at most $k$ points. Thus, even if we use this result with the approach of the previous paragraph, we obtain the following comparison in a $k$-parameter problem in Section 2: Method A: minimize a nonlinear function of $2k - 1$ real variables. Method B: solve the Chebyshev problem and then solve $k - 1$ simultaneous linear equations. The fact that the solution of the Chebyshev problem can often be found in the literature (e.g., [2]) makes the comparison of the second method with the first all the more favorable. (2) Although the computational difficulty cannot in general be reduced further, in the case of polynomial regression on $\lbrack -1, 1\rbrack$ there is present a kind of symmetry (discussed in Section 2) which implies that there is an optimum $\xi$ which
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Multi-Factor Experimental Designs for Exploring Response Surfaces
Box, G. E. P., & Hunter, J. S. (1957) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177707047 · Cited by 1,430
Scheffé, H. (1958) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1958.tb00299.x · Cited by 1,188
The Equivalence of Two Extremum Problems
Kiefer, J., & Wolfowitz, J. (1960) · Canadian Journal of Mathematics · doi:10.4153/cjm-1960-030-4 · Cited by 879
Self-citationLocally Optimal Designs for Estimating Parameters
Chernoff, H. (1953) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177728915 · Cited by 645
Optimum Allocation in Linear Regression Theory
Elfving, G. (1952) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729442 · Cited by 430
On the Efficiency of Experimental Designs
Ehrenfeld, S. (1955) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177728541 · Cited by 118
Application of a Measure of Information to the Design and Comparison of Regression Experiments
Stone, M. (1959) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177706359 · Cited by 81
Cited by
Minimax and maximin distance designs
Johnson, M. E., Moore, L. M., & Ylvisaker, D. (1990) · Journal of Statistical Planning and Inference · doi:10.1016/0378-3758(90)90122-b · Cited by 1,451
The Equivalence of Two Extremum Problems
Kiefer, J., & Wolfowitz, J. (1960) · Canadian Journal of Mathematics · doi:10.4153/cjm-1960-030-4 · Cited by 879
Self-citationGeneral Equivalence Theory for Optimum Designs (Approximate Theory)
Kiefer, J. (1974) · The Annals of Statistics · doi:10.1214/aos/1176342810 · Cited by 761
Self-citationKiefer, J. C. (1992) · Springer Series in Statistics · doi:10.1007/978-1-4612-0919-5_28 · Cited by 654
Self-citationResponse Surface Methodology: 1966-1988
Myers, R. H., Khuri, A. I., Carter, W. H., & Khuri, A. I. (1989) · Technometrics · doi:10.2307/1268813 · Cited by 594
Metadata
- Authors
- Kiefer, J., & Wolfowitz, J.
- Venue
- The Annals of Mathematical Statistics
- Publisher
- Institute of Mathematical Statistics
- Published
- 1959-06
- Volume
- 30
- Issue
- 2
- Pages
- 271-294
- ISSN
- 0003-4851 (ISSN-L)
- OpenAlex
- W2085499762
- Cited by
- 791
- References
- 7
- FWCI
- 6.32
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Optimum Designs in Regression Problems. https://app.cochat.ai/papers/10.1214/aoms/1177706252
- The paper
- Kiefer, J., & Wolfowitz, J. (1959). Optimum Designs in Regression Problems. The Annals of Mathematical Statistics. https://doi.org/10.1214/aoms/1177706252
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.