Computational and statistical validation of the Fisher Information Matrix diagonal tier hierarchy as a panel-bounded empirical regularity of deep layered sequential computation.
The FIM three-tier diagonal hierarchy is a mechanism-backed universality
signature of deep layered sequential computation. Across 12 parameterised
substrate classes — trained / untrained neural networks, random boolean
circuits, four shallow parameterised learners, U(1) and SU(2) lattice gauge
fields, three dynamical-system controls, and a random-matrix ensemble — the
tier ratio
Real-data verification. ResNet-18 trained 10 epochs on CIFAR-10 (81.4 %
test accuracy, 11.2 M params) gives
The universality class is deep layered sequential composition — not
neural networks, not learning, not optimisation. See
docs/fim_tier_hierarchy_neurips2026.md
for the full draft and docs/v6_0_mechanism_hanin_nica.md
for the mechanism derivation.
python3 -m venv .venv && source .venv/bin/activate
pip install -r requirements.txt
bash scripts/reproduce_main_results.shWall-clock on a single CPU is ~12 minutes; on a CUDA GPU ~3 minutes. The script runs the four load-bearing experiments and writes JSONs alongside the committed reference outputs for byte-level comparison.
| Experiment | Script | Reference output |
|---|---|---|
| V5.0 dichotomy stats | experiments/v5_0_dichotomy_stats/dichotomy_stats.py |
dichotomy_stats_results.json |
| V5.1 threshold sensitivity | experiments/v5_0_dichotomy_stats/threshold_sensitivity.py |
v5_1_threshold_sensitivity_results.json |
| V5.2 multi-seed bootstrap | experiments/v5_0_dichotomy_stats/mw_bootstrap.py |
v5_2_mw_bootstrap_results.json |
| V6.0 mechanism (depth sweep) | experiments/v6_0_depth_mechanism/depth_sweep.py |
v6_0_depth_sweep.json |
| V4.5 partition-invariant | experiments/v4_3_statistics/partition_invariant_dichotomy.py |
v4_3_partition_invariant_dichotomy.json |
| V6.0c pooling-error bound | experiments/v6_0_mechanism/pooling_error_bound.py |
v6_0c_pooling_error_bound_results.json |
For a faster first pass that skips the V6.0 depth sweep (~7 min savings):
bash scripts/reproduce_main_results.sh --quick| Phase | Description | Status |
|---|---|---|
| V1.0 | 296k-param toy experiment + 6-scale sweep, 3 falsifiable predictions validated | Done |
| V1.1 | NTK continuum limit — rigorous theorem for |
Done (gap closure) |
| V1.2 | Extended scaling: 10 widths, seed-robustness, depth sweep | Done (scripts) |
| V2.0 | Lattice-embedded subclass: Cauchy-refinement theorem + numerical demo | Done (numerics) |
| V2.1 | QEC decoder spectral analysis — universality test across 2 tasks | Done (experiment) |
| V3.0 | Cluster-scale runs + symbolic-regression task + arch baselines | Done (task-3, arch baselines) |
| V4.0 | Uniqueness test — FIM tier hierarchy vs 5 non-NN parameterised systems | Done (experiment) |
| V4.1 | Trained-vs-untrained: hierarchy is init-induced, training dissipates 4–24× | Done (experiment) |
| V4.2 | FIM diagonal vs full spectrum (Lanczos on small MLP) | Done (experiment) |
| V4.3 | Tier-partition sensitivity + bootstrap 95 % CI on all exponents | Done (experiments) |
| V4.4 | 4 non-deep learners (linear/kernel/logistic/GP) — decisive dichotomy | Done (experiment) |
| V5.0 | U(1) pure-gauge lattice FIM (non-deep, spatially-parallel control) | Done (experiment) |
| V5.0-stats | Bootstrap CIs + Mann–Whitney U test on the 12-system dichotomy ( |
Done (stats) |
| V6.0 | Mechanism — Hanin–Nica log-normal theorem + depth-sweep empirical confirmation (H1 |
Done (doc, experiment) |
| V6.1 | Width sweep — confirms Hanin–Nica width-independence | Done (JSON) |
| V6.2 | Trained-NN depth sweep — |
Done (experiment) |
| V6.3 | Layered boolean-circuit depth sweep — substrate-independent |
Done (experiment) |
| V6.4 | Transformer depth sweep — attention + residuals preserve |
Done (experiment) |
| V6.5 | Activation-function depth sweep — ReLU/GELU/tanh/Swish all pass |
Done (experiment) |
| V7.0 | SU(2) non-abelian lattice gauge — |
Done (experiment) |
| V7.1 | U(1) lattice |
Done (experiment) |
| V8.0 | Binary-tree tensor-network depth sweep — MERA-style substrate test passes |
Done (experiment) |
| V9 | Modern-architecture coverage: ResNet, GPT-Tiny, ResNet-50 ImageNet, ViT trajectories | Done (experiments) |
| V10 | Production-scale baselines | Done (experiments) |
-
docs/fim_tier_hierarchy_neurips2026.md— full paper draft synthesising V1.0 through V10 (panel + mechanism + falsifier + scope narrowing). -
docs/v6_0_mechanism_hanin_nica.md— V6.0 derivation of$\log(T_1/T_3) \propto \sqrt{L}$ from Hanin–Nica + log-normal quantile algebra, with V6.1 / V6.2 / V6.4 sub-results. -
docs/v1_1_ntk_gap_closure.md— NTK continuum-limit gap-closure note for the SV-exponent compatibility check. -
docs/preregistration_v2.md— pre-registered hypotheses and falsifiers.
docs/ # Paper drafts and mechanism notes
experiments/ # Per-phase experiment scripts and committed JSON outputs
plots/ # Figures (PNG)
scripts/ # Reproduction infrastructure (one-command rerun)
runtime/ # Optional: tier-hierarchy runtime hooks (research only)
tests/ # pytest suite (markers: unit/integration/slow)
This repository is released for academic reuse with citation under the terms
in LICENSE.
@article{anonymous2026fimtier,
title = {Fisher Information Tier Hierarchy: A Panel-Bounded Empirical
Regularity of Deep Layered Sequential Computation},
author = {Anonymous},
year = {2026},
note = {Submission under double-blind review.}
}