opendeviationbar-py · feature-column discipline · living reference
Every feature column must be orthogonal · parameterless · agnostic (Terry msg id=428). Each axis is a runnable probe; one gate combines them into a single promote/skip verdict. This area is the living current-state reference — the dated campaign spoke is the frozen record of how it was built.
Does this feature tell us something no existing feature already tells us?
Spearman |ρ| matrix + h_norm per (symbol × threshold × slice) cell, regime-stratified across 7 epochs; ξ→CODEC→O-info cascade behind it.
orthogonality_probe.pyDoes this feature contain secret hand-tuned numbers?
Job 1: AST gate vs the constants registry (tunable knob ⇒ BLOCK). Job 2: shared-knob promotion sweep across all candidates/families.
parameterless_probe.pyIs this ONE well-defined algorithm — would two honest implementations agree?
Algorithm-invariance: no-dispatch scan + two-implementation convergence oracle + doc/code consistency. (NOT asset-agnostic — provenance-corrected.)
agnostic_probe.pyOne promote/skip decision over the three probes. A tunable knob vetoes.
promote = parameterless ∧ agnostic ∧ orthogonal. Cost-ladder short-circuit: free static axes first. A feature-tunable knob vetoes everything.
three_axis_gate.pyWill a feature that is orthogonal today STILL be orthogonal tomorrow?
Leakage-gated walk-forward over 20 named regime slices: persistence 94-95%, flip-ranking AUC 0.88-0.95, ACI-calibrated intervals, FDR≤10% declared sets. Regime-conditional by evidence (ICP 0/92).
e123_v3_walk_forward.pyThe substrate every probe reads from: the locked slice grid (21 slices × 21 symbol-threshold combos × 7 regime epochs), the constants registry, the knob inventory, the cascade + selection gates, and the anti-leakage guards. Read-only ClickHouse on bigblack.
Hardening the candidate registry + turning the manual 'already covered?' novelty check into a fast, automatic, evidence-backed catalogue-uniqueness pre-filter. Per-iteration loop record.
How the three probes + the one gate were built (the frozen origin record of this area).
promote = parameterless.PASS AND agnostic.PASS AND orthogonal.PASS3. Agnostic — algorithm-invariant. Two correct implementations of the same feature should converge to the same answer. A column that silently dispatches between ApEn and PE based on window size is two columns wearing one name.
— Terry, msg id=428 (verbatim). Full sources: PROVENANCE.md