EU AI Act model release gate and golden set evaluation for enterprise AI — Reference Architecture

Reference architecture · published 2026-10-16 · regulated enterprise · EU AI Act · layout diagram_first · implementation executed in CI before publish

The control that resolves this is a Frozen Golden Set Release Gate, evaluated before the request reaches a model provider rather than audited afterwards. In regulated enterprise the binding constraint is EU AI Act, and the question it actually asks is what risk class is this system, and where is the technical documentation. The shape below holds p95 ≤ 600ms over REST over HTTPS, and ships with a standard-library implementation that runs as written.

System architecture

Frozen Golden Set Release Gate — the request path, with the decision points that must exist before the first model call:

flowchart LR
    CAND[Candidate model] --> SC[Score per slice]
    BASE[Baseline scores] --> CMP{Compare per slice}
    SC --> CMP
    CMP -->|slice regressed| BLOCK[Refuse release]
    CMP -->|below floor| BLOCK
    CMP -->|all slices hold| REL[Release + decision record]
    BLOCK --> REC[Record which slice and by how much]

Component breakdown

1. Frozen golden set — Versioned and immutable; editing it after freeze raises.
2. Slice taxonomy — Rare-but-critical cases are their own slice, not noise in the mean.
3. Per-slice thresholds — Tolerance for regression plus an absolute floor per slice.
4. Deterministic scorer — Same inputs, same score — a flaky scorer makes the gate decorative.
5. Release gate — Refuses on any slice regression even when the aggregate improves.
6. Decision record — What was compared, which slices moved, who accepted the risk.

Implementation parameter matrix

Every value below is a parameter you can hold a vendor or an internal team to. Adjectives are not acceptance criteria.

Why this blocks production

A model upgrade is approved on a demo and an aggregate score. Nobody can say which cases got worse, because the comparison is a single number against a test set that changes whenever it is inconvenient.

What EU AI Act specifically requires

The EU AI Act regulates the SYSTEM, not the data. The first question is its risk classification, and a high-risk classification pulls in Article 11 technical documentation, Article 12 record-keeping and Article 14 human oversight — obligations that have to be designed in, not attached later.

The artifact that satisfies it is a model card plus Article 12 automatic logs. The way teams most often fail it: a system classified as limited-risk that is actually high-risk because it informs a decision about a person.

The implementation — Per-slice release gate over a frozen golden set

Standard-library Python, no external dependencies, runs as written. Executed by the publish gate: if it raises, this page does not ship. Wire it behind REST over HTTPS; the failure mode it guards against is a retried POST creating a duplicate record. The output you hand the assessor is the Annex III classification record and model card.

"""Release gate on a frozen golden set, with per-slice thresholds.

The failure this prevents: a candidate model improves the aggregate score and
regresses badly on one slice that happens to matter. Aggregates hide that
(Simpson's paradox is not a curiosity here, it is the default outcome), so the
gate evaluates per slice and refuses on any slice regression beyond tolerance
even when the headline number improves.
"""
from dataclasses import dataclass, field


@dataclass(frozen=True)
class Case:
    case_id: str
    slice_name: str
    prompt: str
    expected: str


@dataclass
class GoldenSet:
    """Frozen on purpose. A golden set edited to make a release pass is not a
    golden set, so mutation after freeze raises rather than warns."""
    name: str
    cases: list = field(default_factory=list)
    _frozen: bool = False

    def add(self, case: Case) -> None:
        if self._frozen:
            raise RuntimeError(f"{self.name} is frozen; create a new version")
        self.cases.append(case)

    def freeze(self) -> "GoldenSet":
        self._frozen = True
        return self

    def slices(self) -> set:
        return {c.slice_name for c in self.cases}


def score(model, golden: GoldenSet) -> dict:
    per_slice: dict[str, list] = {}
    for case in golden.cases:
        ok = model(case.prompt) == case.expected
        per_slice.setdefault(case.slice_name, []).append(ok)
    return {s: sum(v) / len(v) for s, v in per_slice.items()}


def aggregate(scores: dict, golden: GoldenSet) -> float:
    weights = {s: sum(1 for c in golden.cases if c.slice_name == s)
               for s in scores}
    total = sum(weights.values())
    return sum(scores[s] * weights[s] for s in scores) / total


class ReleaseGate:
    def __init__(self, tolerance: float = 0.02, floors: dict | None = None):
        self.tolerance = tolerance
        self.floors = floors or {}

    def decide(self, baseline: dict, candidate: dict, golden: GoldenSet) -> dict:
        regressions, floor_breaks = [], []
        for s in sorted(set(baseline) | set(candidate)):
            b, c = baseline.get(s, 0.0), candidate.get(s, 0.0)
            if b - c > self.tolerance:
                regressions.append({"slice": s, "baseline": round(b, 3),
                                    "candidate": round(c, 3),
                                    "delta": round(c - b, 3)})
            floor = self.floors.get(s)
            if floor is not None and c < floor:
                floor_breaks.append({"slice": s, "candidate": round(c, 3),
                                     "floor": floor})
        agg_b, agg_c = aggregate(baseline, golden), aggregate(candidate, golden)
        return {
            "aggregate_baseline": round(agg_b, 3),
            "aggregate_candidate": round(agg_c, 3),
            "aggregate_improved": agg_c > agg_b,
            "slice_regressions": regressions,
            "floor_breaches": floor_breaks,
            "release": not regressions and not floor_breaks,
        }


if __name__ == "__main__":
    g = GoldenSet("claims-triage-v1")
    for i in range(40):
        g.add(Case(f"c{i}", "common", f"p{i}", f"a{i}"))
    for i in range(10):
        g.add(Case(f"r{i}", "rare_high_value", f"rp{i}", f"ra{i}"))
    g.freeze()

    baseline_answers = {c.prompt: c.expected for c in g.cases}
    def baseline_model(p): return baseline_answers[p]

    # Candidate: better on the big slice, broken on the small critical one.
    def candidate_model(p):
        if p.startswith("rp"):
            return "wrong"
        return baseline_answers[p]

    base = score(baseline_model, g)
    cand = score(candidate_model, g)
    gate = ReleaseGate(tolerance=0.02, floors={"rare_high_value": 0.90})
    decision = gate.decide(base, cand, g)

    assert decision["aggregate_candidate"] >= 0.79, decision
    assert not decision["release"], "a slice regression must block the release"
    assert decision["slice_regressions"][0]["slice"] == "rare_high_value"
    assert decision["floor_breaches"], decision

    clean = gate.decide(base, base, g)
    assert clean["release"], clean

    try:
        g.add(Case("x", "common", "p", "a"))
        raise AssertionError("edited a frozen golden set")
    except RuntimeError:
        pass

    print("Evaluation release gate: OK")
    print(f"  aggregate {decision['aggregate_baseline']} -> "
          f"{decision['aggregate_candidate']}, release={decision['release']}, "
          f"slice regressions {len(decision['slice_regressions'])}")

The EU AI Act control, as code

Annex IV documentation completeness and Article 12 logging. This is the artifact an assessor asks for under EU AI Act specifically — it is not the same control as the one above, and a system that implements one does not thereby implement the other. It executes under the same publish gate.

"""Annex IV technical documentation completeness + Article 12 logging.

A high-risk system under the EU AI Act needs technical documentation covering
specified elements, and automatic recording of events over the system lifetime.
The failure is rarely refusal to document — it is documentation that is stale,
partial, or cannot be tied to the exact model version that produced an output.

This checks the documentation set against the Annex IV elements and refuses to
mark a release conformant while any element is missing or stale.
"""
from datetime import date, timedelta

ANNEX_IV_ELEMENTS = {
    "general_description": "intended purpose, provider, version",
    "design_specification": "architecture, algorithmic logic, design choices",
    "training_data": "provenance, scope, characteristics, labelling",
    "human_oversight": "measures enabling natural-person oversight",
    "accuracy_metrics": "accuracy, robustness and cybersecurity metrics",
    "risk_management": "risk management system per Article 9",
    "change_log": "changes made through the lifecycle",
    "post_market_plan": "post-market monitoring plan",
}

STALENESS_DAYS = 180


class TechnicalFile:
    def __init__(self, system: str, model_version: str, today: date):
        self.system, self.model_version, self.today = system, model_version, today
        self.elements: dict[str, date] = {}

    def attach(self, element: str, updated: date) -> None:
        if element not in ANNEX_IV_ELEMENTS:
            raise KeyError(f"{element} is not an Annex IV element")
        self.elements[element] = updated

    def missing(self) -> list[str]:
        return sorted(set(ANNEX_IV_ELEMENTS) - set(self.elements))

    def stale(self) -> list[str]:
        cutoff = self.today - timedelta(days=STALENESS_DAYS)
        return sorted(k for k, v in self.elements.items() if v < cutoff)

    def conformant(self) -> dict:
        missing, stale = self.missing(), self.stale()
        return {"system": self.system, "model_version": self.model_version,
                "missing": missing, "stale": stale,
                "conformant": not missing and not stale}


class EventLog:
    """Article 12: records must tie an output to the version that produced it."""

    def __init__(self):
        self.events: list[dict] = []

    def record(self, model_version: str, event: str, ref: str) -> None:
        self.events.append({"model_version": model_version,
                            "event": event, "ref": ref})

    def trace(self, ref: str) -> dict | None:
        for e in self.events:
            if e["ref"] == ref:
                return e
        return None

    def untraceable(self, known_versions: set[str]) -> list[str]:
        return [e["ref"] for e in self.events
                if e["model_version"] not in known_versions]


if __name__ == "__main__":
    today = date(2026, 10, 16)
    tf = TechnicalFile("claims-triage", "v4.2.0", today)
    for element in ANNEX_IV_ELEMENTS:
        tf.attach(element, today - timedelta(days=30))
    assert tf.conformant()["conformant"], tf.conformant()

    partial = TechnicalFile("claims-triage", "v4.3.0", today)
    for element in list(ANNEX_IV_ELEMENTS)[:5]:
        partial.attach(element, today - timedelta(days=10))
    partial.attach("change_log", today - timedelta(days=400))
    report = partial.conformant()
    assert not report["conformant"], report
    assert "post_market_plan" in report["missing"], report
    assert "change_log" in report["stale"], report

    log = EventLog()
    log.record("v4.2.0", "inference", "out-9001")
    log.record("v4.1.7", "inference", "out-8800")
    assert log.trace("out-9001")["model_version"] == "v4.2.0"
    assert log.untraceable({"v4.2.0"}) == ["out-8800"]

    print("EU AI Act Annex IV + Article 12: OK")
    print(f"  complete file conformant={tf.conformant()['conformant']}, "
          f"partial missing {len(report['missing'])}, stale {len(report['stale'])}")

Risk mitigation matrix

Each row carries an acceptance parameter rather than an adjective, because "low latency" cannot be signed off. Retention here is bound by per the data class retention schedule, enforced automatically.

Questions to answer before approval

• What is this system's risk classification under Annex III, who decided, and what happens to that classification when the use case changes?
  The classification is recorded against its Annex III category with a named owner, and a material change of use triggers re-classification before the change ships.
• Which slices did the candidate model get worse on, and by how much?
  The gate reports a per-slice delta for every slice, and the decision record keeps it. An aggregate alone cannot answer this, which is why it is not the gate.
• What stops someone editing the evaluation set until the release passes?
  The set is frozen on publish — mutation raises rather than warns, and a change requires a new version with its own identifier recorded on every subsequent decision.
• If the aggregate score improves by two points, can the release still be refused?
  Yes, and it must be. A slice regression beyond tolerance, or any breach of a named slice's floor, refuses the release regardless of the aggregate.
• Where is the record of who accepted a known regression, and on what basis?
  In the decision record attached to the release: the slices that moved, the magnitude, and the named person who accepted it. An unaccepted regression cannot ship.
• How do you know the scorer gives the same answer twice?
  The scorer is deterministic and any sampling is seeded, with the seed recorded. The same candidate against the same frozen set produces the same report.

Adjacent problems

• Part of enterprise ai compliance architecture.
• Where this interacts with another regime, see EU AI Act prompt injection defence architecture for enterprise LLM.
• EU AI Act tracing and token accounting architecture for enterprise LLM covers the adjacent case.
• Where this interacts with another regime, see EU AI Act agent permission and delegated access architecture.
• This pattern also governs EU AI Act vendor evaluation criteria for enterprise AI implementation.
• If this is the blocker in front of you: enterprise AI infrastructure review.