University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Penalized optimal design for dose finding

Penalized optimal design for dose finding

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Mustapha Amrani.

Design and Analysis of Experiments

We consider optimal design under a cost constraint, where a scalar coefficient L sets the compromise between information and cost. For suitable cost functions, one can force the support points of an optimal design measure to concentrate around points of minimum cost by increasing the value of L, which can be considered as a tuning parameter that specifies the importance given to the cost constraint.

An example of adaptive design in a dose-finding problem with a bivariate binary model will be presented. As usual in nonlinear situations, the optimal design for any arbitrary choice of L depends on the unknown value of the model parameters. The construction of this optimal design can be made adaptive, by using a steepest-ascent algorithm where the current estimated value of the parameters (by Maximum Likelihood) is substituted for their unknown value. Then, taking benefit of the fact that the design space (the set of available doses) is finite, one can prove the strong consistency and asymptotic normality of the ML estimator when L is kept constant. Since the cost is reduced when L is increased, it is tempting to let L increase with the number of observations (patients enroled in the trial). The strong consistency of the ML estimator is then preserved when L increases slowly enough.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity