❌

Normal view

  • βœ‡cs.AI, q-bio.NC updates on arXiv.org
  • LoRA-RC: Reservoir Computing with Low-Rank Adaptation Wenbin Wan
    arXiv:2609.12327v1 Announce Type: new Abstract: Reservoir computing (RC) trains only a linear readout over a fixed recurrent layer, making it fast and data-efficient for online prediction. However, a static reservoir degrades under system drift, readout-only adaptation is then insufficient, and unconstrained reservoir adaptation can destroy the echo-state and incremental stability properties that make RC reliable. This paper proposes LoRA-RC, which adapts the recurrent matrix through a low-rank
     

LoRA-RC: Reservoir Computing with Low-Rank Adaptation

14 September 2026 at 12:00
arXiv:2609.12327v1 Announce Type: new Abstract: Reservoir computing (RC) trains only a linear readout over a fixed recurrent layer, making it fast and data-efficient for online prediction. However, a static reservoir degrades under system drift, readout-only adaptation is then insufficient, and unconstrained reservoir adaptation can destroy the echo-state and incremental stability properties that make RC reliable. This paper proposes LoRA-RC, which adapts the recurrent matrix through a low-rank correction driven by streaming prediction errors. The base reservoir and adaptation bases are fixed offline; a small core matrix is adapted online, projected onto a spectral-norm ball, and low-pass filtered at each step. The projection guarantees that every applied recurrent matrix remains within a certified contraction set, and an incremental input-to-state stability bound is established for the reservoir along each online adaptation path, with path-independent rate and gain. On a Lorenz system with an abrupt parameter drift, LoRA-RC cuts post-drift prediction error by 56% versus a fixed RC and 51% versus readout-only adaptation; ablations over 20 seeds show that removing the projection inflates this error by more than a factor of 40.

Stability and Wandering of Bumps in Neural Fields with Interneuron Subtypes

arXiv:2609.13074v1 Announce Type: cross Abstract: The maintenance of continuous variable information in working memory is thought to rely on persistent patterns of cortical activity. In delayed-estimation tasks, neural activity can form localized activity peaks, or ``bumps,'' whose positions track the remembered variable. Such activity is well described by continuous-attractor neural field models, but most existing models collapse cortical inhibition into a single homogeneous population. Here, we introduce a stochastic neural field model with distinct excitatory, parvalbumin-expressing (PV), and somatostatin-expressing (SST) populations to examine how inhibitory subtype structure shapes persistent activity. Using a Heaviside firing-rate approximation, we derive stationary bump solutions and reduce their linear stability to separate shifting and scaling modes. We show that population thresholds and inhibitory timescales determine both bump stability and the mechanism by which stability is lost, while inhibitory connection strengths and spatial scales substantially reshape the stable parameter region. In particular, broader SST connectivity promotes stable bump states. Finally, we derive an effective diffusion coefficient for noise-driven bump wandering and show that increasing the SST spatial footprint reduces the rate of memory diffusion. Together, these results demonstrate how inhibitory subtype structure can shape both the deterministic stability and stochastic precision of continuous-attractor memories.
❌