cs.LGOct 7, 2026

Self-Organization from Constrained Geometric Radiation

Authors: Ming Lei

Abstract

How does dynamic order emerge spontaneously in closed systems without external driving? Existing paradigms all require external energy flows, temperature quenching, or slow driving. Here we report constraint-induced self-organization via geometric radiation in coupled metric evolution systems. Simulations reveal a universal four-stage cycle: stress accumulation, super-exponential radiation, chaotic collapse, and convergence to a fractal limit cycle, a novel attractor topology we term the wedge-shaped attractor, with five quantized curvature states and fractal micro-fluctuations. We identify four jointly sufficient conditions: an irreversible geometric horizon, persistent stress injection from quantum coherence, endogenous geometric tension between incompatible curvatures, and effective fluctuations. Their synergy triggers a critical avalanche at the horizon boundary. We prove three theorems: the Geometric Horizon Theorem, the Geometric Energy Dissipation Theorem (implying wave-like entropy evolution in closed systems), and the Radiation as Phase Transition Channel Theorem. We further establish the Constraint-Induced Self-Organization Theorem: these conditions guarantee the complete cycle with probability one. Systematic scans reveal a critical noise threshold and power-law scaling of radiation onset. We verify universality across 12 configurations, multiple noise types, and three geometric flows. This work establishes a new paradigm for closed-system self-organization, forging an exact mathematical duality between classical nonlinear constraints and gravitational horizons.

Explore similar work

Sep 15, 2026cs.LG

Information Geometric Self-Organization at the Edge of Stability in High-Capacity Kernel Associative Memories

High-capacity associative memories based on Kernel Logistic Regression (KLR) exhibit exceptional storage capabilities and robustness. Previous empirical studies identified a hyperparameter regime, the "Ridge of Optimization," where attractor stability is maximized. However, the geometric nature of this regime and the optimization dynamics required to reach it have remained unclear. In this paper, we investigate the static geometry of the parameter space and the learning trajectory of Gradient Descent (GD) in KLR-trained Hopfield networks. Using the eigenvalue spectrum of the Hessian, we reveal that the Ridge corresponds to a phase boundary located adjacent to a rank-1 spectral collapse, acting as a geometric singularity where the principal curvature is massively amplified. Furthermore, we demonstrate that the learning dynamics exhibit a transient self-stabilizing behavior driven by the Edge of Stability (EoS) phenomenon. Rather than seeking flat regions, the network parameters are driven toward a state where the local curvature dynamically equilibrates near the stability limit dictated by the learning rate, allowing the optimization to survive the initial instability. We provide analytical derivations for both the rank-1 asymptotic collapse and the dynamic feedback loop governing this equilibration. These findings suggest that optimal, high-capacity memory representations are not formed in flat minima, but are dynamically sculpted at the highly curved boundaries of geometric singularities.
Sep 23, 2026cond-mat.dis-nn

Nonequilibrium Phases of Repulsive Self-Attention: Chaos, Attention Condensation, and Emergent Locality

We study the nonequilibrium dynamics of a minimal recurrent transformer with NN normalized tokens, Q=K=IQ=K=I, and a negative value map V=−IV=-I. Similarity-based attention selects nearby representations, while the negative value map drives tokens away from the selected field. This feedback can continually reorganize both the representation geometry and the attention network. For d=2d=2, the tokens lie on a circle, where the regular polygon is an exact fixed point. As the attention feedback strength γγ is increased, the polygon loses stability through a flip bifurcation, giving rise to period-two motion, chaos, and cluster-exchange or cluster-flip states. Despite this temporal complexity, attention remains diffuse as N→∞N\to\infty at finite fixed softmax sharpness ββ. Attention condensation instead emerges in the scaling regime β∼N2β\sim N^2. In the hard-routing limit, repulsive updates amplify local perturbations and routing-partner switches transmit them ballistically, producing an emergent butterfly cone in representation space. High-dimensional geometry provides a distinct route to localization. For d=N→∞d=N\to\infty, simulations from Gaussian initial conditions provide evidence for a condensation transition at β=O(1)β=O(1), driven by dynamically generated finite overlap gaps. Depending on γγ, the resulting phases include diffuse simplex-like states, consensus flips, condensed active routing with signatures of chaos, and fragmented cluster flips. These results establish temporal activity, attention condensation, and geometric clustering as distinct collective phenomena, and show that sparse attention can sustain persistent dynamics rather than freeze it.
Jun 19, 2026cs.AI

Closure of Self-Determining System Based on Causal and Constitutive Relations

A self-determining system is defined as one in which causes originating within the system influence the system itself. This definition raises the question of how to specify system boundaries. Although the concept of "closure" is commonly used for this purpose, defining boundaries solely in terms of causal relations introduce challenges, such as how to handle external causes and circular causality. To address this issue, we introduce two types of asymmetric relations: causal and constitutive. We propose that system boundaries can be defined as closures of loops formed by these relations, referred to as causal-constitutive loops. By constraining constitutive relations, the resulting system necessarily includes internal causes and thereby satisfies self-determination. Furthermore, to prevent reduction to supervenience, constitutive relations must involve at least two independent variables. This minimal requirement leads to two interdependent loops, which implies a dual-process organization.