Skip to content
Preprint

The Forward-Backward Disconnect: State Dynamics, Credit Assignment, and Biological Grounding in Neural Computation

Aug 2026 · 0 citations
Computer Science

TL;DR

Across static, recurrent, attention-based, state-space, continuous-time, implicit, spiking, biologically plausible, and neuromorphic families, forward dynamics have diversified while the highest demonstrated scales remain concentrated in global or closely gradient-derived error-propagation mechanisms.

Abstract

A recurring pattern in neural computation is the reintroduction of dynamical and biological structure into models originally simplified for scalable optimization. Early feedforward networks reduced biological neurons to threshold or rate-like summation units, an abstraction compatible with global-gradient training at scale. Since then, forward computation has diversified: modern architectures carry recurrent state, retrieve from long contexts through attention and associative memory, compress histories through structured state-space dynamics, evolve in continuous time, settle to implicit equilibria, and communicate through sparse spikes. Training has diversified less. Scalable learning remains concentrated around backpropagation, backpropagation through time, adjoint methods, implicit differentiation, and surrogate-gradient variants. We call this asymmetry the forward-backward disconnect and develop a taxonomy spanning neural model families along three coupled axes: state-dynamics structure, credit-assignment mechanism, and biological grounding. Forward and learning grounding are treated separately, and the unit of analysis is the architecture-learning configuration rather than the architecture name alone. Across static, recurrent, attention-based, state-space, continuous-time, implicit, spiking, biologically plausible, and neuromorphic families, forward dynamics have diversified while the highest demonstrated scales remain concentrated in global or closely gradient-derived error-propagation mechanisms. Closing this disconnect requires better alignment among state dynamics, credit assignment, and computational substrate.

View source

Similar papers

#machine learning Preprint Sep 2026

Learning Length-Extrapolatable Recurrent Models

This work intervenes directly on state credit and proposes Credit Stabilization through Time (CST), which locally rescales the state-credit signal to stabilize its norm without rotating the component being corrected, while leaving the forward computation unchanged.

Hanwen Jiang · 0 citations
#machine learning Preprint Sep 2026

When Does Backpropagating Through Policy Memory Matter? Physical Credit, Optimizer Updates, and Observability

M measuring the cost of a memory cut by training with it from initialization, and comparing backward graphs by the updates the optimizer applies rather than by raw gradients suggest the cost of a memory cut should be measured by training with it from initialization.

Xing-Jian Li, Jian-Hua Z. Huang, Jun-Li Duan · 0 citations
Open access Sep 2026

Online synaptic credit assignment in active dendrites

It is shown that the gradient of a detailed neuron’s voltage with respect to a synaptic weight is itself a voltage, and that synaptic credit assignment can be implemented online by the voltage dynamics of detailed neurons.

Gan He, Shen-Jian Zhang, Kai Du et al. · 0 citations
Sep 2026

Gradient-coupled continual backpropagation: dynamic plasticity control for nonstationary data streams

This work proposes Gradient-Coupled Continual Backpropagation (G-CBP), which modulates layer-wise replacement rates from normalized gradient norms and constrains early turnover through an Adaptive Moving Envelope, and identifies an empirical reconstruction–perturbation relationship.

Wei-Bang Zhou, Xiang-Sheng Huang, Xiao Yang et al. · 0 citations
#machine learning Preprint Sep 2026

Diffusion as a Training Curriculum for Timestep-Free Iterative Reasoning

This work adds a persistent hidden state to a diffusion denoiser and removes its timestep conditioning, leaving a single shared update that can be run to arbitrary depth, and develops an anytime solver that keeps improving with inference depth far beyond the rollout lengths and backpropagation window used in training.

M. Drozdova, Aidan Sirbu, Pietro Miotti et al. · 3 citations
Open access Aug 2026

Task-Parametrized dynamics: Representation of time and decisions in recurrent neural networks.

Training RNNs on delayed decision-making tasks with progressively increasing temporal demands shows that temporal and decision-related computations can emerge through multiple dynamical regimes, while maintaining structured low-dimensional representations and comparable behavioural performance, mirroring biological pri...

C. Jarne, Ryeongkyung Yoon, Tahra L. Eissa et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.