Feasibility and Memory Mechanisms of Chern-Simons Context Reservoir Computation

• URL: http://arxiv.org/abs/2609.13315v1
• Date: Thu, 10 Sep 2026 17:45:30 GMT
• Title: Feasibility and Memory Mechanisms of Chern-Simons Context Reservoir Computation
• Abstract summary: We investigate whether a Chern-Simons context reservoir is a viable computational substrate.<n>To separate generic reservoir behavior from gauge-specific effects, we compare four matched models.<n>We find a task-specific advantage for geometry- and order-sensitive processing, rather than generic reservoir superiority.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We investigate whether a Chern-Simons (CS) context reservoir is a viable computational substrate and whether evolving its gauge connection provides a benefit beyond simpler mechanisms. The reservoir state is a density fluctuation on a two-dimensional context manifold, whose drift is generated by a density-sourced connection. To separate generic reservoir behavior from gauge-specific effects, we compare four matched models: reciprocal transport, instantaneous transverse reconstruction, local nonlinear feedback, and fully coupled conserved-current CS dynamics. Across ten random seeds, the fully coupled CS dynamics propagates Gauss law to numerical precision, converges under spatial and temporal refinement, remains stable under constraint-compatible noise, and satisfies the spatial CS equation more accurately than the instantaneous controls. All four models exhibit fading scalar memory and distinguish matched pulse-order histories in density, with no resolved general advantage for coupled CS. The distinction appears in the flow geometry: coupled evolution supports circulating and longitudinal history channels simultaneously, retains them briefly after input removal, and yields a combined-feature pulse-order accuracy of \(0.879\pm0.035\), compared with \(0.679\pm0.065\) for the instantaneous-transverse control. The evolved connection also cannot be reconstructed from an instantaneous density snapshot or replaced by a fitted local multiplier. We therefore find a task-specific advantage for geometry- and order-sensitive processing, rather than generic reservoir superiority. Here ``topological'' refers to the gauge organization of the state; the reported memory and cyclic-lag measures are not topological invariants.

Related papers

• Generative Nested Sampling of Atomistic Thermodynamic Landscapes [37.547720439639015]
  Flow-based nested sampling has removed the bottleneck for gravitational-wave (GW) inference.<n>We show that LJ disks in PBC reduce energy evaluations by over two orders of magnitude and wall-clock time by roughly one third.<n>For LJ disks in PBC, the algorithm reduces energy evaluations by over two orders of magnitude and wall-clock time by roughly one third.
  arXiv  Detail & Related papers  (2026-09-02T22:21:10Z)
• Incremental Aggregation on the Grassmannian for Asynchronous Eigenspace Computation [37.26483427088676]
  We study asynchronous optimization for finite-sum eigenspace computation in heterogeneous distributed systems.<n>We propose a Grassmannian incremental aggregation method that refreshes only arriving components and reuses cached gradients.<n> Experiments on serial and distributed PCA demonstrate improved sample efficiency and wall-clock convergence over representative baselines.
  arXiv  Detail & Related papers  (2026-08-05T03:21:38Z)
• GrainGS: Gradient-Decoupled Gaussian Splatting for Efficient Dynamic Novel View Synthesis [94.20462261657525]
  GrainGS is a dynamic framework that combines a hierarchical anchor scaffold with per-Gaussian deformation.<n>It achieves high reconstruction quality, real-time novel view synthesis, and compact storage.
  arXiv  Detail & Related papers  (2026-07-23T15:52:35Z)
• Scalable Policy Optimization for Networked Multi-Agent Reinforcement Learning with Continuous State-Action Spaces [16.43184149906767]
  We develop an algorithm for cooperative reinforcement learning in networked decision processes with continuous state and action spaces.<n>Each agent maintains a local actor over a graph neighborhood, and a localized temporal-difference critic evaluates a truncated actionvalue function.
  arXiv  Detail & Related papers  (2026-07-20T22:41:43Z)
• Finite-Lag Operator Geometry of Recurrent Representations [0.0]
  We show that source-centered transport detects deterministic recurrent motion not recorded by infinitesimal carre-du-champ geometry.<n>In performance matched repeat-copy networks, the framework reveals architecture dependent differences in total transport scale and coherent displacement trace.
  arXiv  Detail & Related papers  (2026-07-02T06:00:32Z)
• Towards Fast GNN Surrogates for CO2 Migration in Complex Geological Formations [58.079925240809644]
  We propose an end-to-end graph neural surrogate tailored to CO$$ibility plume migration forecasting in geological storage.<n>The method is evaluated on the SPE11A benchmark, a well-known industry test case designed to assess CO$$ storage scenarios.<n>The proposed model produces competitive forecasts of gas saturation and liquid-phase density, with cumulative errors that remain moderate over extended forecasting horizons.
  arXiv  Detail & Related papers  (2026-06-15T18:19:17Z)
• Data-Specific Hyper-Parameter Design: A Paradigm Shift in Reservoir Computing [3.4002388038666105]
  Reservoir computing typically relies on large, randomly generated reservoirs, enabling simple, often linear readouts.<n>We develop reservoir design principles from a geometric perspective for inputs generated by deterministic dynamical systems.<n> Numerical experiments demonstrate consistent performance gains over arbitrary reservoir constructions.
  arXiv  Detail & Related papers  (2026-05-24T19:13:13Z)
• Why SGD is not Brownian Motion: A New Perspective on Stochastic Dynamics [92.39053980710702]
  Gradient Descent (SGD) is commonly modeled as a Langevin process, assuming that minibatch noise acts as Brownian motion.<n>This approximation relies on a continuous-time limit and a sqrt(eta) noise scaling that does not match the discrete SGD update at finite learning rate.<n>We propose an alternative formulation of SGD as deterministic dynamics in a fluctuating loss landscape induced by minibatch sampling.
  arXiv  Detail & Related papers  (2026-05-21T15:50:40Z)
• SKANet: A Cognitive Dual-Stream Framework with Adaptive Modality Fusion for Robust Compound GNSS Interference Classification [47.20483076887704]
  Global Navigation Satellite Systems (GNSS) face growing threats from sophisticated jamming interference.<n>We propose a cognitive deep learning framework built upon a dual-stream architecture that integrates Time-Frequency Images (TFIs) and Power Spectral Density (PSD)<n>We show that SKANet achieves an overall accuracy of 96.99%, exhibiting superior robustness for compound jamming classification.
  arXiv  Detail & Related papers  (2026-01-19T07:42:45Z)
• Machine learning in and out of equilibrium [58.88325379746631]
  Our study uses a Fokker-Planck approach, adapted from statistical physics, to explore these parallels. We focus in particular on the stationary state of the system in the long-time limit, which in conventional SGD is out of equilibrium. We propose a new variation of Langevin dynamics (SGLD) that harnesses without replacement minibatching.
  arXiv  Detail & Related papers  (2023-06-06T09:12:49Z)
• Noise-resilient Edge Modes on a Chain of Superconducting Qubits [103.93329374521808]
  Inherent symmetry of a quantum system may protect its otherwise fragile states. We implement the one-dimensional kicked Ising model which exhibits non-local Majorana edge modes (MEMs) with $mathbbZ$ parity symmetry. MEMs are found to be resilient against certain symmetry-breaking noise owing to a prethermalization mechanism.
  arXiv  Detail & Related papers  (2022-04-24T22:34:15Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.