Structural Safety of Local Physical Learning: Initial-data certificates, topology-changing convergence, and boundary-response stability in resistor networks
Sep 2026· Zenodo (CERN European Organization for Nuclear Research)
Abstract
Can local physical learning destroy the conducting structure needed to define its own task? We study the Euclidean projected conductance-gradient flow of a finite passive resistor network with two fixed-potential terminals, one output, and one interior scalar target, under an explicit prune-and-continue convention for actually detached terminal-free components. The paper gives three levels of guarantee. First, an a priori safety certificate computable from the initial network: a logit-based path budget compared with the exact minimum-cut distance to output isolation (squared conductance weights). If the budget is smaller, task continuation is global, the limit task stays defined, and convergence is exponential, even when auxiliary components detach at nonzero error. Second, topology-level guarantees with no small-error premise: a directionally protected output–pin edge on an otherwise arbitrary graph, and an output-separable two-terminal class with arbitrary internal cycles. Third, for general networks, a quantitative cut barrier and a necessary structural alternative: essential finite-time task failure requires loss of normalized pin-anchored cut mass or loss of coercivity of the retained anchored boundary response. The proof uses an exact Dirichlet trace that is globally 2-Lipschitz through arbitrary hidden rank changes, together with absorption of an arbitrary truly-floating family. All learning derivatives are retained in the original physical conductance coordinates; no smoothness in hidden conductances and no finite count of ordinary support transitions is assumed. Exact examples separate harmless topology changes, failure of excessive regularity requirements, and weak anchoring. The results do not assert unconditional safety of every network, the sufficiency of either failure indicator, or the existence of an essential-collapse trajectory. This is a self-contained preprint, not a claim of journal peer review.
This publication proposes a definition and a classification of agile software development approaches and analyses ten software development methods that can be characterized as being "agile" against the defined criterion.
P. Abrahamsson, O. Salo, Jussi Ronkainen et al.· arXiv.org· 727 citations· ⚡54
The study shows that agile practices improve both informal and formal communication, but indicates that, in larger development situations involving multiple external stakeholders, a mismatch of adequate communication mechanisms can sometimes even hinder the communication.
M. Pikkarainen, Jukka Haikara, O. Salo et al.· Empirical Software Engineeri...· 401 citations· ⚡48
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.· Information and Software Tec...· 394 citations· ⚡54
The perception of the impact of agile methods is predominantly positive, and several challenge areas were discovered, but based on this study, agile methods are here to stay.
M. Laanti, O. Salo, P. Abrahamsson· Information and Software Tec...· 260 citations· ⚡20
For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appear…
MIT News · Artificial Intelligence· news.mit.eduOct 15, 2026
A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.
Microsoft Research Blog· microsoft.comOct 15, 2026
Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.