![]() |
COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. | ![]() |
University of Cambridge > Talks.cam > Statistics > Conflicts between optimality criteria for block designs with low replication
![]() Conflicts between optimality criteria for block designs with low replicationAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Richard Samworth. In designing experiments, we usually seek to make variances of estimators small. For incomplete-block designs, various ways of measuring multi-dimensional variance give the A-, D-, and E-optimality criteria, which I shall explain. If there exists a balanced incomplete-block design for the given parameters, then it is optimal on all these criteria. It is therefore natural to use the proxy criteria of (almost) equal replication and (almost) equal concurrences when choosing a block design. However, work over the last decade for block size 2 has shown that when the number of blocks is near the lower limit for estimability of all treatment contrasts then the D-criterion favours very different designs from the A- and E-criteria. In fact, the A- and E-optimal designs are far from equi-replicate and are amongst the worst on the D-criterion. I shall report on current work which extends these results to all block sizes. Thus the problem is not blocks of size 2; it is low replication. This talk is part of the Statistics series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsCambridge Institute Genomics Core Fitzwilliam College Foundation Lectures Tagliaferri LectureOther talksFrom ‘Do Not Touch’ signs to barriers: can we successfully provide access without compromising preservation principles? Hunting for cacti in the caribbean Cancer and Metbolism 2018 Social support and breastfeeding in the UK: evolutionary perspectives and implications for public health Active Machine Learning: From Theory to Practice Faster C++ |