Optimality criterion

An objective measure used to compare candidate statistical models for a hypothesis and designate the model with the best criterion value.

Version

v2 · 2026-09-06 · History

Domain-specific #

2429

Origin domain

statistics

Subdomain

model and phylogenetic-tree selection

Aliases

Model optimality criterion

Core Idea

Optimality criterion is an objective measure used to compare candidate statistical models for a hypothesis and designate the model with the best criterion value. [^burnham-anderson]

An optimality criterion defines a scalar or ordered objective over candidate models so one can search for and compare best-fitting explanations under a declared standard. In phylogenetics, likelihood, parsimony, and distance-based criteria can rank the same tree space differently because they encode different models, penalties, and summaries of the data. The criterion is distinct from the search algorithm used to optimize it.

Scope of Application

The abstraction recurs literally within statistical and phylogenetic model spaces whose candidates can be scored under a declared inferential objective.[^burnham-anderson] The following habitats preserve the same recognition machinery; they are not invitations to extend the name metaphorically.

• Maximum likelihood. models are ranked by the probability assigned to observed data.
• Maximum parsimony. trees are ranked by the minimum changes required.
• Residual criteria. models minimize squared, absolute, or weighted discrepancies.[^burnham-anderson]
• Information criteria. fit is adjusted by a complexity penalty.[^burnham-anderson]
• Tree inference. topologies and nuisance parameters are jointly or separately optimized.
• Sensitivity analysis. rankings are compared across plausible criteria and assumptions.

Clarity

A report should name the score, its sign convention, its assumptions, and the candidate space. Saying that software found the 'optimal model' is incomplete when the criterion and search completeness are unknown. A global optimum under one score need not be adequate or preferred under another.

Manages Complexity

The criterion converts a heterogeneous comparison into an explicit ordering that algorithms can optimize and researchers can contest. Separating criterion, model, data, and search exposes whether disagreement comes from evidence, assumptions, or incomplete exploration.

The compression remains accountable because each simplification has a named failure condition. Disagreement can be localized to a missing role, an invalid assumption, an ambiguous measurement, or a neighboring abstraction instead of being hidden inside an unanalyzed label.

Abstract Reasoning

R1. Define the candidate space before interpreting an optimum. R2. Write the objective and optimization direction explicitly. R3. Identify assumptions and penalties embedded in the score. R4. Separate score evaluation from the algorithm that searches candidates. R5. Assess ties, uncertainty, sensitivity, and scientific adequacy after optimization.

Knowledge Transfer

Optimality criteria transfer literally among model-selection problems with explicit candidates and objectives. Optimization and selection are broader primes; calling a personal preference, vague ideal, or unmeasured goal an optimality criterion removes the score and model-comparison machinery.

The transfer boundary is explicit: DOMAIN-SPECIFIC PASS / PRIME FAIL: Optimality criteria recur across datasets, competing models, hypotheses, phylogenetic trees, and objective functions. Literal recognition retains the specialist vocabulary and validity conditions of statistical model selection; outside that setting only broader parent operations transfer.

Relationships to Other Abstractions

Current abstraction Optimality criterion Domain-specific

Parents (2) — more general patterns this builds on

• Optimality criterion is a kind of Evaluation Prime

  The accepted reference-grade review places Optimality criterion under Evaluation because the child instantiates or depends on the parent's broader structure while retaining its own constitutive identity.

• Optimality criterion presupposes Selection Prime

  Selection (prime:selection).

Children (1) — more specific cases that build on this

• Deviance Information Criterion Domain-specific is a kind of Optimality criterion

  Optimality Criterion is the proposed immediate parent.

Hierarchy paths (2) — routes to 2 parentless roots

• Optimality criterion → Evaluation → Comparison → Self Checking

Show alternative path (1)

Neighborhood in Abstraction Space

Optimality criterion sits in a sparse region of the domain-specific corpus (72^nd percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Inference Bias & Multiple Testing (10 abstractions)

Nearest neighbors

• Benjamini–Hochberg Procedure — 0.85
• Learnable Function Class — 0.84
• Extended Boolean model — 0.83
• Machine-Learning Learning Curve — 0.83
• Congruence Bias — 0.83

Computed from structural-signature embeddings · 2026-09-08

References

[^burnham-anderson]: Kenneth P. Burnham and David R. Anderson, Model Selection and Multimodel Inference: A Practical Information-Theoretic Approach, 2^nd ed., Springer, 2002. General reference for statistical candidate-model comparison, residual fit, information criteria, complexity penalties, and adequacy-aware model selection.