On the Behaviour of D-Optimal Exact Designs Under Changing Regression Polynomials
Bibliographic record
Abstract
The behaviour of D-optimal exact designs for first order polynomial models under changing regression polynomials is considered. The polynomials, some of which are with or without intercept or with or without interactive term, are defined on design regions that are supported by the points of the Circumscribed Central Composite Design. The best N-point D-optimal exact design for the intercept model (model 1), is the same as the best N-point D-optimal design for the no-intercept model (model 3). Similarly, the best N-point D-optimal design for the intercept model (model 2) is the same as the best N-point D-optimal design for the no-intercept model (model 4), as measured by the determinant values, D-efficiencies, G-efficiencies and Condition numbers. Other N-point designs constructed using the no-intercept models had better determinant values than their corresponding intercept models. The condition numbers indicate that for model 1, the 4-point D-optimal design is orthogonal. For model 2, the 2-point D-optimal exact design and the 4-point D-optimal exact designs are orthogonal. For model 3, the 4-point D-optimal exact design is orthogonal and for model 4, the 4-point D-optimal exact design is orthogonal. Other N-sized designs show less orthogonality. The Equivalence of D-optimality and G-optimality criteria is established for the 4-point design under model 1, for the 2-point and 4-point designs under model 2, for the 4-point design under model 3 and for the 4-point design under model 4.
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.025 | 0.077 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.002 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.001 | 0.003 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
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".