Data contracts, ownership, and lineage
Use data contracts, ownership, and lineage to move the data & features production brief toward a defensible release.
Fraud labels arrive late and online features disagree with training data.
This lesson isolates data contracts, ownership, and lineage as one decision inside that system. The people affected are product users and operators; the learning data must carry event time, availability time, ownership, and version; and the operating envelope is a declared latency, cost, and operator-capacity budget.
Choose whether and how to use semantic contracts at a declared prediction cutoff.
Measure decision utility alongside calibration, slice reliability, and system latency—not model score alone.
Fraud labels arrive late and online features disagree with training data. An unsafe release must degrade to a named baseline or the last known-good version.
Build the mental model before the machinery.
The core move is to treat data contracts, ownership, and lineage as a contract between data, a computation, and an action. Version contracts, temporal joins, transform state, snapshots, backfills, and continuous offline/online parity checks. The implementation becomes easier to debug once you can state which inputs exist, which state is learned, what output means, and what must remain invariant after serialization.
semantic contracts
Define it in a hand-checkable form and name the prediction-time inputs.
event time
Connect it to the production metric and identify what it cannot guarantee.
availability time
Stress it with a slice, a temporal boundary, and a failure-safe alternative.
as-of joins
Stress it with a slice, a temporal boundary, and a failure-safe alternative.
Engineering foundations, Evaluation
Name every symbol. Check every shape.
Feature availability invariant is the central invariant for this lesson. The formula is useful only when its inputs match the production cutoff and its output maps to an action.
Feature availability invariant
| Symbol | Meaning / shape / unit |
|---|---|
t_available | time the value became knowable |
t_decision | prediction cutoff |
f_i | feature i |
Open derivation and numerical substitution
Start from the production quantity being optimized, substitute the observed values with their declared units, then isolate the model-controlled term. Preserve shape annotations at each step so broadcasting or aggregation cannot silently change the result.
- Write the named inputs: t_available, t_decision, f_i.
- Substitute one small, hand-checkable batch before vectorizing.
- Calculate an independent reference value and compare within a declared tolerance.
# equation → code contract
inputs = validate_shapes_and_units(batch)
value = compute_c03(inputs)
assert is_finite(value)Calculate it small. Shape it realistically. Break it on purpose.
A result you can reproduce on paper
For a purchase at 10:00, use the account tier effective and available by 10:00—not its 14:00 update.
- Write every input and unit.
- Substitute values into the feature availability invariant equation above.
- Compare the result to one simple baseline and explain the direction of the difference.
The same reasoning under real constraints
Build a 30-day mature merchant chargeback rate for historical training and a matching online lookup.
The production record includes the data snapshot, transformation state, artifact identity, cutoff, score, decision, and the version of the policy that consumed it.
The attractive result you should reject
Joining only on customer ID attaches the present balance to every historical row.
Diagnostic: replay the smallest failing slice from immutable inputs, then compare each boundary rather than retuning the model.
Change one assumption and make the tradeoff visible.
This lab runs predefined TypeScript only. It never executes learner code. Use the slider, numeric input, reset, live text, or table—the computation is the same.
Point-in-time freshness lab
Delay feature arrival and see which historical rows remain eligible.
Assumption: Five events have fixed prediction cutoffs separated by six hours.
Open nonvisual data table
| Item | Computed state | Interpretation |
|---|---|---|
| row 1 | cutoff +0h | not yet knowable |
| row 2 | cutoff +6h | eligible |
| row 3 | cutoff +12h | eligible |
| row 4 | cutoff +18h | eligible |
| row 5 | cutoff +24h | eligible |
Trace the complete operating path.
- 01
Validate and version semantic contracts.
- 02
Compute data contracts, ownership, and lineage from prediction-time-safe inputs.
- 03
Persist model, feature, and configuration identities together.
- 04
Serve or materialize behind explicit a declared latency, cost, and operator-capacity budget.
- 05
Join telemetry to mature outcomes and retain a rollback path.
Observability
Join service health, input quality, prediction distributions, slice behavior, and mature outcomes by exact version.
Cost
Measure storage, preprocessing, compute, queueing, and human review under a representative arrival pattern.
Failure modes
Joining only on customer ID attaches the present balance to every historical row. Add a detector, owner, mitigation, and stop condition for this class of failure.
Alternatives
Compare a rule, a simpler statistical baseline, and a different system boundary before adding model complexity.
Explain the contract, not just the vocabulary.
Point-in-time feature system
Design a versioned training set and online lookup from transaction, account, and outcome events.
- Contracts and lineage
- Temporal join specification
- Late-event/backfill policy
- Offline-online parity report
Read primary material with a purpose.
Return to the opening failure.
Version contracts, temporal joins, transform state, snapshots, backfills, and continuous offline/online parity checks.
For this lesson, the release evidence is a hand-checked formal result, deterministic simulation output, a ≥80% checkpoint, the production rubric, and a named fallback. The course resolves when the system can produce data contracts, point-in-time features, backfills, quality gates, and lineage.