parametric-write-subspace-boundary
OUT derived (depth 5)
Created 2026-08-25T03:08:53+00:00 · Reviewed 2026-08-25T04:02:18+00:00
The operational boundary between parametric recall and contextual retrieval is precisely the geometric boundary of the rank-one addressable subspace: facts whose subject-key projection aligns with the locally-stored key covariance are parametrically editable, while facts outside this subspace must be externally supplied.
Justifications
SL — The geometric divide (head vs tail), the editing addressability bound (rank-one in key space), and the validated routing duality together define a single geometric criterion for the parametric/contextual boundary—no antecedent is sufficient alone.
Antecedents (all must be IN):
- OUT head-tail-geometric-divide — The parametric/contextual knowledge split is geometrically grounded rather than merely frequency-driven: head-of-distribution facts occupy individually addressable directions in the covariance-whitened feature space (enabling rank-one editing), while long-tail facts are distributed across superposed features where no single direction isolates the knowledge, making external retrieval the only faithful access mechanism.
- OUT geometric-editing-addressability-bound — The covariance-geometry framework defines a precise and minimal addressable space for knowledge editing (rank-one updates to a single MLP value projection), but the combination of superposition and distributed corpus acquisition structurally bounds this to single-fact local corrections—edits cannot create novel multi-hop associations because the target knowledge was never locally consolidated in the first place.
- OUT knowledge-routing-faithfulness-validated — The parametric/contextual two-channel knowledge architecture is a genuine computational duality rather than a surface-level re-ranking bias, because retrieval context demonstrably inverts the parametric accuracy trend (accuracy increases with document relevance for rare facts) and BM25 recall remains robust independently of parametric scaling.
Dependents
These beliefs depend on this one:
- OUT context-write-unbounded-complement — The context window functions as the unbounded write channel that complements the rank-one parametric write: where parametric editing is confined to a single MLP's addressable subspace, the context channel injects arbitrary quantities of verified knowledge, making the two write channels capacity-complementary rather than redundant.
- OUT inversion-and-drop-as-dual-boundary — Kandpal's retrieval inversion (parametric accuracy *decreases* with document count while contextual accuracy *increases*) and ROME's multi-hop drop (40.5%→7.4% after editing) are the same geometric boundary observed from the read and write sides respectively: the rank-one addressable subspace fills the head directions parametrically but is silent on the tail, and the context window fills exactly those missing tail directions.
- OUT long-tail-as-coordinate-coverage-gap-not-capacity-gap — The long-tail knowledge failure is fundamentally a coordinate-coverage problem (the rank-one addressable subspace does not span rare fact directions) rather than a raw parameter-capacity problem, making the 10¹⁵-parameter scaling estimate a misleading reframing of a geometric coverage gap.
- OUT multi-hop-drop-as-rank-one-boundary-signature — The dramatic 40.5%→7.4% multi-hop accuracy collapse after ROME editing is the operational fingerprint of the rank-one write boundary: multi-hop reasoning requires *composition* of multiple whitened directions, but the covariance-whitened subspace structurally supports only single-direction writes, making multi-hop parametric recall geometrically unreachable.
- OUT partial-whitening-cost-geometric-necessity — The O(D²) cost of a rank-one ROME edit is the exact geometric price of single-direction partial whitening: modifying one row/column of the inverse covariance while preserving D−1 others is irreducibly O(D²) because C⁻¹ is a full D×D matrix, making the complexity bound a theorem of the geometry rather than an engineering limitation.
- OUT retrieval-inversion-as-geometric-signature — The inversion of accuracy trends—parametric accuracy *decreases* with document count while contextual accuracy *increases*—is the operational signature of the geometric addressability boundary: the inversion occurs precisely at the subspace boundary (where the fact direction exits the rank-one addressable space), not at a frequency threshold, making the boundary a geometric rather than statistical object.
- OUT three-tier-memory-architecture — The LLM implements a three-tier memory architecture: broad superposition-based read, narrow rank-one parametric write confined to the covariance-whitened addressable subspace, and unbounded contextual write via the context window—with the geometric boundary of C⁻¹k* defining the precise demarcation between parametric and contextual regimes.