OPTIMAL AND QUASI-OPTIMAL DESIGNS

被引:0
|
作者
Martins, Joao Paulo [2 ]
Mendonca, Sandra [1 ,2 ]
Pestana, Dinis Duarte [2 ,3 ]
机构
[1] Univ Madeira, Dept Matemat & Engn, Funchal, Portugal
[2] Univ Lisbon, Ctr Estatist & Aplicacoes, CEAUL, P-1699 Lisbon, Portugal
[3] Univ Lisbon, Fac Ciencias, DEIO, P-1699 Lisbon, Portugal
关键词
Optimal designs; discriminant designs; robust designs; mixed designs; quasi-optimal designs; canonical and pseudo-canonical moments;
D O I
暂无
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
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) path-breaking 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.
引用
收藏
页码:279 / 307
页数:29
相关论文
共 50 条
  • [21] Algorithm quasi-optimal (AQ) learning
    Cervone, Guido
    Franzese, Pasquale
    Keesee, Allen P. K.
    [J]. WILEY INTERDISCIPLINARY REVIEWS-COMPUTATIONAL STATISTICS, 2010, 2 (02) : 218 - 236
  • [22] Quasi-Optimal Partial Order Reduction
    Nguyen, Huyen T. T.
    Rodriguez, Cesar
    Sousa, Marcelo
    Coti, Camille
    Petrucci, Laure
    [J]. COMPUTER AIDED VERIFICATION, CAV 2018, PT II, 2018, 10982 : 354 - 371
  • [23] Quasi-optimal partial order reduction
    Camille Coti
    Laure Petrucci
    César Rodríguez
    Marcelo Sousa
    [J]. Formal Methods in System Design, 2021, 57 : 3 - 33
  • [24] On constructing quasi-optimal robust systems
    M. G. Zotov
    [J]. Journal of Computer and Systems Sciences International, 2013, 52 : 677 - 685
  • [25] COMPUTING A SPLINE WITH QUASI-OPTIMAL NODES
    DELAYE, A
    [J]. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1989, 30 (3-4) : 249 - 255
  • [26] Quasi-optimal control of dynamic systems
    Aleksandrov, V. M.
    [J]. AUTOMATION AND REMOTE CONTROL, 2016, 77 (07) : 1163 - 1179
  • [27] Adaptive Security with Quasi-Optimal Rate
    Hemenway, Brett
    Ostrovsky, Rafail
    Richelson, Silas
    Rosen, Alon
    [J]. THEORY OF CRYPTOGRAPHY, TCC 2016-A, PT I, 2016, 9562 : 525 - 541
  • [28] Quasi-optimal model of the acoustic source
    Branski, A
    [J]. ENGINEERING ANALYSIS WITH BOUNDARY ELEMENTS, 2000, 24 (09) : 685 - 693
  • [29] QUASI-OPTIMAL CHOICE OF REGULARIZED APPROXIMATION
    TIKHONOV, AN
    GLASKO, VB
    KRIKSIN, IA
    [J]. DOKLADY AKADEMII NAUK SSSR, 1979, 248 (03): : 531 - 535
  • [30] On constructing quasi-optimal robust systems
    Zotov, M. G.
    [J]. JOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONAL, 2013, 52 (05) : 677 - 685