The Polytope of Optimal Approximate Designs: Extending the Selection of Efficient Experiments

07/08/2023
∙
by   Radoslav Harman, et al.
∙
0
∙

Consider the problem of constructing an experimental design that is optimal for a given statistical model with respect to a chosen criterion. To address this problem, the literature typically provides a single solution; sometimes, however, there exists a rich set of optimal designs. The knowledge of this set allows the experimenter to select an optimal design based on its secondary properties. In this paper, we show that the set of all optimal approximate designs often corresponds to a polytope. The polytope can be fully represented by the set of its vertices, which we call vertex optimal designs. We prove that these optimal designs possess unique characteristics, such as small supports, and suggest their potential applications. We also demonstrate that for a variety of models, the vertex optimal designs can be computed using rational arithmetic with perfect accuracy. Consequently, we enumerate all vertex optimal designs for several standard multifactor regression models.

READ FULL TEXT

Please sign up or login with your details

Continue with:
Or login with email
Enter Password
Re-enter Password

Forgot password? Click here to reset
Success!
Error Icon An error occurred

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×
Pro

Consider DeepAI Pro

Subscribe to DeepAI Pro
DeepAI Pro
Provides a limited generation allowance each month. When exceeded, you are charged overage rates available at deepai.org/pricing. Also includes an ad-free experience and API access. Renews automatically until canceled. Non-refundable.
Subtotal
Total due today

Payment

Add DeepAI credits
DeepAI credits
One-time purchase. Credits are added to your wallet after payment.
Subtotal
Total due today

Payment