Circuits for robust designs
Statistische Hefte - 2022
Tóm tắt
This paper continues the application of circuit theory to experimental design started by the first two authors. The theory gives a very special and detailed representation of the kernel of the design model matrix named circuit basis. This representation turns out to be an appropriate way to study the optimality criteria referred to as robustness: the sensitivity of the design to the removal of design points. Exploiting the combinatorial properties of the circuit basis, we show that high values of robustness are obtained by avoiding small circuits. Many examples are given, from classical combinatorial designs to two-level factorial designs including interactions. The complexity of the circuit representations is useful because the large range of options they offer, but conversely requires the use of dedicated software. Suggestions for speed improvement are made.
Từ khóa
Tài liệu tham khảo
4ti2 team (2018) 4ti2—a software package for algebraic, geometric and combinatorial problems on linear spaces. https://4ti2.github.io
Bailey RA (2008) Design of comparative experiments, Cambridge series in statistical and probabilistic mathematics, vol 25. Cambridge University Press, Cambridge. https://doi.org/10.1017/CBO9780511611483
Butler NA, Ramos VM (2007) Optimal additions to and deletions from two-level orthogonal arrays. J R Stat Soc B 69(1):51–61. https://doi.org/10.1111/j.1467-9868.2007.00576.x
Cox DA, Little J, O’Shea D (2007) Ideals, varieties, and algorithms: an introduction to computational algebraic geometry and commutative algebra, 3/e (Undergraduate texts in mathematics). Springer, Berlin
Dey A (1993) Robustness of block designs against missing data. Stat Sin 3(1):219–231
Dey A, Mukerjee R (2009) Fractional factorial plans. Wiley, New York
Eendebak P, Schoen E (2018) Complete series of non-isomorphic orthogonal arrays. urlhttp://pietereendebak.nl/oapage/. Accessed 1 March 2021
Fontana R, Rapallo F (2019) On the aberrations of mixed level orthogonal arrays with removed runs. Stat Pap 60(2):479–493. https://doi.org/10.1007/s00362-018-01069-5
Fontana R, Rapallo F, Rogantin MP (2014) A characterization of saturated designs for factorial experiments. J Stat Plann Inference 147:205–211. https://doi.org/10.1016/j.jspi.2013.10.011
Ghosh S (1979) On robustness of designs against incomplete data. Sankhya 40(3/4):204–208
Ghosh S (1982) Robustness of BIBD against the unavailability of data. J Stat Plann Inference 6(1):29–32. https://doi.org/10.1016/0378-3758(82)90053-2
Grayson DR, Stillman ME (2019) Macaulay2, a software system for research in algebraic geometry. http://www.math.uiuc.edu/Macaulay2/
Harman R, Rosa S (2020) On greedy heuristics for computing D-efficient saturated subsets. Oper Res Lett 48(2):122–129. https://doi.org/10.1016/j.orl.2020.01.003
Harman R, Filová L, Richtárik P (2020) A randomized exchange algorithm for computing optimal approximate designs of experiments. J Am Stat Assoc 115(529):348–361. https://doi.org/10.1080/01621459.2018.1546588
Hedayat AS, Sloane NJA, Stufken J (2012) Orthogonal arrays: theory and applications. Springer, New York
Mitchell TJ (1974) Computer construction of “D-optimal’’ first-order designs. Technometrics 16(2):211–220
Mukerjee R, Wu CFJ (2007) A modern theory of factorial design. Springer, New York
Pistone G, Riccomagno E, Wynn HP (2001) Algebraic statistics. Computational commutative algebra in statistics. Chapman and Hall/CRC, New York
SAS- Institute (2014) SAS/QC 13.2: User’s Guide. SAS Institute Inc., Cary, NC
Schrijver A (1986) Theory of linear and integer programming. Wiley-Interscience series in discrete mathematics. Wiley, a Wiley-Interscience Publication, Chichester
Sloane NJ (2020) A library of Orthogonal Arrays. http://neilsloane.com/oadir/. Accessed 1 March 2021
Street DJ, Bird EM (2018) \(D\)-optimal orthogonal array minus \(t\) run designs. J Stat Theory Pract 12(3):575–594. https://doi.org/10.1080/15598608.2018.1441081
Sturmfels B (1996) Gröbner bases and convex polytopes, University Lecture Series, vol 8. American Mathematical Society, Providence, RI
Tonchev VD (1989) Self-orthogonal designs and extremal doubly even codes. J Comb Theory A 52(2):197–205. https://doi.org/10.1016/0097-3165(89)90030-7
Wynn HP (1970) The sequential generation of \({D}\)-optimum experimental designs. Ann Math Stat 41(5):1655–1664. https://doi.org/10.1214/aoms/1177696809
Xampeny R, Grima P, Tort-Martorell X (2018) Which runs to skip in two-level factorial designs when not all can be performed. Qual Eng 30(4):594–609. https://doi.org/10.1080/08982112.2018.1428751