Update (2026-07-10). This 2025 preprint is retained as a manuscript of record. Its headline empirical figures — reaching
99.75%of "predicted optimality" (topology loss0.0234vs. baseline9.23), and the transfer results (14.7%perplexity reduction,2.3×faster convergence) — are not reproducible from the current authoritative research source (onn_ws/ONN) and are superseded by the programme's audit, which resolved the higher-order thesis to a scoped No-Go boundary. Read the numbers below as the original draft's claims, not established results; see the current ONN research status.
Overview
This manuscript was written as an empirical follow-up to the ONN + ORTSF framework paper. Taking the original framework's claimed performance bounds as its premise, it asked whether — and under what conditions — those bounds could be reached on a working machine. The later audit did not reproduce its reported results.
Claims as originally presented
- The enhanced regime (𝓛_topo = 0.0792) was reported to reach 99.14% of the theoretically predicted optimum.
- The advanced regime (𝓛_topo = 0.0234) was reported to reach 99.75%.
- The manuscript claimed that minimal connectivity (k = 2) and extreme precision (surgery decay δ = 0.0005) outperformed denser, coarser configurations — inverting conventional neural-network design wisdom.
- It also claimed transfer to transformer architectures (14.7% perplexity reduction) and graph neural networks (2.3× faster convergence on WikiText-103). These figures are withdrawn pending reproducible evidence.
Where it sits
Historically, the manuscript was positioned downstream of the ONN + ORTSF paper and upstream of a proposed production-grade ONN implementation. The audit no longer treats it as a validated bridge between those stages.