arXiv:2608.01548v3 Announce Type: replace
Abstract: Test-time emergence in LLM systems has a deployment boundary: additional computation can realize decisions already supported by the deployed information–execution structure, while evidence, tools, memory, and executable semantics can change the class inherited by later computation. We formalize this boundary through inherited structural capability $\mathcal{D}_{\mathcal{J}}$ and resource-indexed finite realization $\mathcal{F}_s(\mathcal{J},M)$. At a common budget, Theorem 1 gives an exact decision representation: a successor improves every bounded-loss task exactly when its closed convex finite envelope retains the predecessor's. Terminal capability can therefore expand while same-budget capability strictly reverses. The same object yields finite-slice recovery and a workload-tail information radius for open-ended evaluation. Dynamically, Bellman value prices the successor capability class together with the finite policies it preserves. Nested realization makes every fixed extra resource increment vanish at saturation, allowing persistent positive successor value to dominate that increment. The resulting theory turns emergence into a boundary, compatibility, measurement, and control problem.
Abstract: Test-time emergence in LLM systems has a deployment boundary: additional computation can realize decisions already supported by the deployed information–execution structure, while evidence, tools, memory, and executable semantics can change the class inherited by later computation. We formalize this boundary through inherited structural capability $\mathcal{D}_{\mathcal{J}}$ and resource-indexed finite realization $\mathcal{F}_s(\mathcal{J},M)$. At a common budget, Theorem 1 gives an exact decision representation: a successor improves every bounded-loss task exactly when its closed convex finite envelope retains the predecessor's. Terminal capability can therefore expand while same-budget capability strictly reverses. The same object yields finite-slice recovery and a workload-tail information radius for open-ended evaluation. Dynamically, Bellman value prices the successor capability class together with the finite policies it preserves. Nested realization makes every fixed extra resource increment vanish at saturation, allowing persistent positive successor value to dominate that increment. The resulting theory turns emergence into a boundary, compatibility, measurement, and control problem.
This article has been indexed from cs.AI updates on arXiv.org
Read the original article: