Online Program Home
My Program

Abstract Details

Activity Number: 593 - Computationally Intensive and Machine Learning Methods
Type: Contributed
Date/Time: Wednesday, August 1, 2018 : 2:00 PM to 3:50 PM
Sponsor: Section on Statistical Computing
Abstract #327126
Title: Frequentist Decision-Theoretic Optimal Design with Application to Nonlinear Models
Author(s): Meshayil Alsolmi*
Keywords: alphabetical optimal; Fisher information ; decision-theoretic ; risk function

Alphabetical optimal designs, found by minimising a scalar function of the inverse Fisher information matrix, represent the de-facto standard in optimal design of experiments. For example, the well-known D-optimal design is found by minimising the log determinant of the inverse Fisher information matrix. An alternative decision-theoretic basis for frequentist design is proposed whereby designs are found by minimising the risk function defined as the expectation of an appropriate loss function. The conceptual advantages of the decision-theoretic framework over alphabetical optimal designs will be discussed. However, finding such designs is complicated due to the considerable computational challenges of minimising an analytically intractable risk function, leading to the need for suitable approximation methods. A number of approximation methods are proposed to generate frequentist decision-theoretic optimal designs for different classes of models. Comparison between these approximations will be considered in terms of performance and computing time.

Authors who are presenting talks have a * after their name.

Back to the full JSM 2018 program