Grouped Orthogonal Arrays And Their Construction Methods
Bibliographic record
Abstract
In computer experiments, it has become a standard practice to select the inputs that spread out as uniformly as possible over the design space.The resulting designs are called space-filling designs and they are undoubtedly desirable choices when there is no prior knowledge on how the input variables affect the response and the objective of experiments is global fitting.When there is some prior knowledge on the underlying true function of the system or what statistical models are more appropriate, a natural question is, are there more suitable designs than vanilla space-filling designs?In this article, we provide an answer for the cases where there are no interactions between the factors from disjoint groups of variables.In other words, we consider the design issue when the underlying functional form of the system or the statistical model to be used is additive where each component depends on one group of variables from a set of disjoint groups.For such cases, we recommend using grouped orthogonal arrays.Several construction methods are provided and many designs are tabulated for practical use.Compared with existing techniques in the literature, our construc-Statistica Sinica: Newly accepted Paper tion methods can generate many more designs with flexible run sizes and better within-group projection properties for any prime power number of levels.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.011 | 0.027 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.002 | 0.003 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.009 | 0.004 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".