Skip to content
#edge computing Open access

The mechanics of the inverted-U: an exact linear theory of reproducible dimensionality, and what governs its rise and fall

Aug 2026 · Zenodo (CERN European Organization for Nuclear Research)

Abstract

A companion paper (doi:10.5281/zenodo.22168191, "What must a theory of perturbational complexity explain?") consolidated nine constraints and challenged any theory to pass them — including C3: debiased perturbational complexity (R-dim, the reproducible dimensionality of the evoked response) is an inverted-U in network dynamics, maximal near the edge of chaos. Here we answer part of that challenge with eleven sealed protocols (all preregistered publicly before their blind quantities were computed, each run once; the failed protocols are reported with the same prominence as the successes). (1) An exact linear theory. For linear networks, R-dim is computable in closed form from connectivity alone: component amplitudes from the impulse-response SVD, per-component noise floors from the stationary Lyapunov covariance, and a universal averaging formula. Confirmed on 36 virgin networks: rank correlation +0.966, median absolute error 0.33 dimensions with a single frozen constant, per-network growth-with-trials predicted (ρ = +0.59), and no inverted-U anywhere in the stable linear family — the falling branch is not a linear phenomenon. (2) The formula transports to nonlinear networks. Feeding it the measured coherent spectrum (through an estimator validated on a known-truth bench; all bench iterations documented) and the measured trajectory noise reproduces the full U on 48 virgin networks in order (+0.925) and calibration (median error 0.41 dimensions, constant frozen), while both sealed peak-location criteria failed: the U's top is a flat plateau at this resolution, and a dedicated sealed 128-network estimation returned "indeterminate". (3) Time and richness dissociate. The duration of the coherent response obeys a relaxation law on the stable side (T_c ~ 1/|λ|; +0.943 on virgin networks) and is maximal at the edge (37× deep-stable, 6× deep-chaotic) — yet the *maximum of R-dim does not coincide with the maximum of coherent time* (sealed dissociation, P = 0.99): richness needs more than time. (4) What governs the fall is saturation. In a two-axis design sampling networks by measured λ and spectral radius ρ independently, at matched criticality saturation crushes R-dim (Spearman −0.62 to −0.88 across all λ strata; 7/7 sealed criteria on 156 virgin networks), while at matched saturation criticality's effect is bounded (|ρₛ| < 0.19). The falling branch of the U is largely saturation wearing chaos's clothes. A finer "graded law" across three additional activation families died in its own sealed test (0/3); the burial is reported, with the method lesson it taught — and a properly powered family-level replication then confirmed the coarse tendency in all three families (sealed; median per-stratum Spearman −0.50 / −0.61 / −0.41 for erf, hard-clip, and softsign at 30 networks per stratum): saturation hurts reproducible dimensionality whatever the shape of the ceiling. A final sealed protocol then answered *where* saturation takes over: in a parametric family interpolating softsign to hard clip, the saturation-governed regime advances with the tail speed of the activation (stable-strata effect −0.16 at p = 1 vs −0.70 at p = 8; sealed two-point criterion passed at −0.54 against a −0.30 bar). (5) One formula. A final sealed protocol tested the unification all of the above points to: applying the exact linear theory to the gain-shrunk effective system W_eff = diag(⟨φ′⟩)·W — same frozen constant — predicts R-dim across all seven activation families studied (pooled order +0.653 on 280 virgin networks, p = 2 × 10⁻³⁵), and per-unit gain heterogeneity is sealed as the essential carrier (the scalar-gain comparator loses by 0.435). At the order level, a nonlinear network is, for reproducible dimensionality, its gain-shrunk linear self; absolute calibration remains an open refinement. (6) Scope, attacked. A final sealed protocol re-ran both flagship laws in five worlds never touched: sizes ×2 and ×4, biological E/I wiring, and halved/doubled noise. The saturation law survived all five (stratum-median Spearman −0.48 to −0.63): together with the activation-family campaign, it holds across nonlinearity, size, wiring and noise — a law of systems. The effective-gain theory passed fully in two worlds and drew its boundary in the others, degrading with network size (order +0.29 at N = 256): a small-family approximation with a mapped edge. We close with what remains open: the exact shape of the U's top, the quantitative chaotic decay, the analytic form of the tail-crossover law, the level calibration of the effective theory — and why its order degrades with size.

View source

Similar papers

#computer vision Review Sep 2017

Agile Software Development Methods: Review and Analysis

Agile - denoting "the quality of being agile, readiness for motion, nimbleness, activity, dexterity in motion" - software development methods are attempting to offer an answer to the eager business community asking for lighter weight along with faster and nimbler software development processes. This is especially the case with the rapidly growing and volatile Internet software industry as well as for the emerging mobile application environment. The new agile methods have evoked substantial amount of literature and debates. However, academic research on the subject is still scarce, as most of existing publications are written by practitioners or consultants. The aim of this publication is to begin filling this gap by systematically reviewing the existing literature on agile software development methodologies. This publication has three purposes. First, it proposes a definition and a classification of agile software development approaches. Second, it analyses ten software development methods that can be characterized as being "agile" against the defined criterion. Third, it compares these methods and highlights their similarities and differences. Based on this analysis, future research needs are identified and discussed.

P. Abrahamsson, O. Salo, Jussi Ronkainen et al. · 728 citations · ⚡54
#machine learning Review Open access Oct 2014

Software development in startup companies: A systematic mapping study

Context: Software startups are newly created companies with no operating history and fast in producing cutting-edge technologies. These companies develop software under highly uncertain conditions, tackling fast-growing markets under severe lack of resources. Therefore, software startups present a unique combination of characteristics which pose several challenges to software development activities. Objective: This study aims to structure and analyze the literature on software development in startup companies, determining thereby the potential for technology transfer and identifying software development work practices reported by practitioners and researchers. Method: We conducted a systematic mapping study, developing a classification schema, ranking the selected primary studies according their rigor and relevance, and analyzing reported software development work practices in startups. Results: A total of 43 primary studies were identified and mapped, synthesizing the available evidence on software development in startups. Only 16 studies are entirely dedicated to software development in startups, of which 10 result in a weak contribution (advice and implications (6); lesson learned (3); tool (1)). Nineteen studies focus on managerial and organizational factors. Moreover, only 9 studies exhibit high scientific rigor and relevance. From the reviewed primary studies, 213 software engineering work practices were extracted, categorized and analyzed. Conclusion: This mapping study provides the first systematic exploration of the state-of-art on software startup research. The existing body of knowledge is limited to a few high quality studies. Furthermore, the results indicate that software engineering work practices are chosen opportunistically, adapted and configured to provide value under the constrains imposed by the startup context.

Nicolò Paternoster, Carmine Giardino, M. Unterkalmsteiner et al. · 394 citations · ⚡54

Related blog posts

Microsoft Research Blog Aug 31, 2026

GigaPath-Flash and GigaTIME-Flash: Toward population-scale discovery with efficient pathology foundation models

What if pathology foundation models could do more with less? GigaPath-Flash and GigaTIME-Flash cut computational demands while maintaining strong performance, opening the door to larger studies and broader exploration. The post GigaPath-Flash and GigaTIME-Flash: Toward population-scale discovery with efficient pathology foundation models appeared first on Microsoft Research.

MIT News · Artificial Intelligence Aug 27, 2026

Looking beyond natural sequences

A new machine-learning framework aims to improve the success rate of computational protein design while moving away from results that reproduce sequences found in nature.