Topics — What a work is about. Nucleation holds whatever reading the owner files here, whether or not an Anthology of the SOTA topic could also hold it; instruction for ML practice belongs to the anthology (ADR-048). The words are seeded from the clusters the reading-time triage of 2026-09-25 found, and grow by decision.
Anthology candidate — a curation flag, not a subject — somebody judged the Anthology of the SOTA may want this work as well; it stays here unless a transfer is decided, and is never a primary topic (ADR-005, ADR-048; group: flags).
4 of 547 CLAIM documents. Back to the full index.
| # | Title | Summary | Status |
|---|---|---|---|
| CLAIM-384 | For a network linearised at its initial parameters, with an isotropic Gaussian prior of precision α on the parameter displacement and Gaussian noise of precision β, the log-determinant part of the evidence is −½ Σ log(1 + βλ/α) over the non-zero eigenvalues λ of the empirical neural tangent kernel’s Gram matrix on the training inputs, so at most n directions are priced however many parameters the network has | Active | |
| CLAIM-391 | For any classes with weights π_c and per-class factor matrices H_c and Δ_c, the class-wise Kronecker product Σ_c π_c H_c ⊗ Δ_c exceeds the product of the weighted averages H̄ ⊗ Δ̄ by exactly the weighted between-class covariance Σ_c π_c (H_c − H̄) ⊗ (Δ_c − Δ̄), so the two agree when either factor is the same in every class | Active | |
| CLAIM-498 | Averaging weights within a basin averages features: the network whose weights are the average of several networks in one low-loss basin has, in every layer, the average of their features | The averaging clause of THEORY-111’s old title, kept as a Proposed claim by the ADR-047 sweep of 2026-10-30 (kind 2) when the eleventh status review’s narrowing had dropped it. No source measured or asserts it: it is the record’s step from pairs to many-model averages, and its defeater is the averaging half of the old promote_when. | Proposed |
| CLAIM-499 | The linear barrier left after aligning independently trained networks over the architecture’s symmetries rises with depth | The depth clause of THEORY-112’s old title, kept as a Proposed claim by the ADR-047 sweep of 2026-10-30 (kind 2) when the eleventh status review’s narrowing had dropped it. No source measures or states it for barriers after alignment: it is the record’s composition of Entezari et al.’s unaligned depth curves with Ferbach et al.’s compounding width bound. Its defeater is the depth paragraph of the old promote_when. | Proposed |