Skip to content
naulon
Not checkedNot checked for notices yet.

Optimal and Quasi-Optimal Designs

João Paulo Martins, Sandra Mendonça, Dinis Duarte Pestana

Revstat Statistical Journal · 2008

doi:10.57805/revstat.v6i3.68 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Optimal design theory deals with the choice of the allocation of the observations to accomplish the estimation of some linear combination of the coefficients in a regression model in an optimal way. Canonical moments provide an elegant framework to the theory of optimal designs. An optimal design for polynomial regression of a given degree r can be fatally inappropriate in case the polynomial degree should in fact be s, and hence when r is unknown it would be preferable to consider designs that show good performance for different values of the polynomial degree. Anderson’s (1962) pathbreaking solution of this multidecision problem has originated many developments, as optimal discriminant designs and optimal robust designs. But once again a design devised for a specific task can be grossly inefficient for a slightly different purpose. We introduce mixed designs; tables for regression of degrees r= 2,3,4 exhibiting the loss of efficiency when the optimal mixed design is used instead of the optimal discriminant or of the optimal robust design show that the loss of efficiency is at most 1% and 2%, respectively, while the loss of efficiency when using a discriminant design instead of a robust design or vice-versa can be as high as 10%. Using recursive relations we compute pseudo-canonical moments for measures with infinite support, showing that such pseudo-canonical moments do not share the good identifiability properties of canonical moments of measures whose support is a subset of a compact interval of the real line.

Abstract licence: CC BY

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.