Back-Propagating Phase Matching in Neural Networks

• Back-propagating phase matching is a technique that computes neural error signals via local phase differences between free and nudged phases, eliminating the need for separate error circuits.
• It employs a two-phase recurrent dynamic process where a small output nudge is back-propagated through identical neuronal dynamics to guide local synaptic updates.
• This approach bridges biological plausibility and gradient-based optimization by integrating STDP-compatible local plasticity rules and relaxing symmetric weight constraints.

Searching arXiv for the named papers and closely related work to ground the article in current records. Back-propagating phase-matching arises because the small “nudge” $\beta\,\partial C/\partial s$ on the outputs is carried backwards through the same physical neuronal dynamics $\mu_\theta$ that propagated inputs forwards, and synapses measure only the local phase difference $\Delta s_i$ against presynaptic rates $\rho(s_j)$. In fixed point recurrent networks, this mechanism is implemented by a two-phase learning procedure: a free phase that converges to a prediction fixed point, and a nudged phase that converges to a nearby fixed point corresponding to smaller prediction error. In the energy-based formulation of Equilibrium Propagation, the temporal derivatives of neural activities in the second phase are equal to the error derivatives computed iteratively by Recurrent Backpropagation; in the vector-field generalization, the same scheme relaxes the requirement of an energy function and yields a local update that approximates the true gradient at a precision directly related to the degree of symmetry of the feedforward and feedback weights (Scellier et al., 2017, Scellier et al., 2018).

1. Two-phase recurrent dynamics

In the vector-field formulation, the network state is the vector of neuron voltages $s\in\mathbb{R}^n$, the parameters are the synaptic weights $\theta=(W_{ij})$, and, for fixed input $\mathbf{x}$ and influence parameter $\beta\ge 0$, the state evolves according to the augmented vector field

$$\frac{ds}{dt} = \mu_\theta^\beta(\mathbf{x},\mathbf{y},s) = \mu_\theta(\mathbf{x},s) - \beta\,\frac{\partial C}{\partial s}(\mathbf{y},s),$$

with

$$\mu_{\theta,i}(\mathbf{x},s)=\sum_j W_{ij}\,\rho(s_j)-s_i, \qquad C(\mathbf{y},s)=\tfrac12\|s_0-\mathbf{y}\|^2.$$

The free phase is the case $\mu_\theta$0, for which the dynamics converges to a fixed point $\mu_\theta$1 satisfying

$\mu_\theta$2

The nudged, or weakly clamped, phase uses $\mu_\theta$3 small, starts from the same $\mu_\theta$4, and moves to a nearby fixed point $\mu_\theta$5 satisfying

$\mu_\theta$6

In the energy-based specialization, the same construction is written through an energy $\mu_\theta$7 with leaky gradient dynamics $\mu_\theta$8, free fixed point $\mu_\theta$9 defined by $\Delta s_i$0, and augmented energy $\Delta s_i$1 (Scellier et al., 2017, Scellier et al., 2018).

The significance of this architecture is that prediction and error correction are both expressed as equilibrium computations of one recurrent system. The second phase is not an external reverse-mode pass; it is a nearby relaxation trajectory induced by soft clamping toward the target. This work shows that it is not required to have a side network for the computation of error derivatives, and supports the hypothesis that, in biological neural networks, temporal derivatives of neural activities may code for error signals (Scellier et al., 2017).

2. Local plasticity and the phase-difference update

Plasticity is governed by a Hebbian/STDP-compatible rule,

$\Delta s_i$2

Integrating over the small change of state $\Delta s_i$3, dividing by $\Delta s_i$4, and letting $\Delta s_i$5, one obtains the phase-difference update vector

$\Delta s_i$6

Because $\Delta s_i$7, this recovers the STDP form $\Delta s_i$8 (Scellier et al., 2018).

Operationally, the crucial quantity is the difference between the two phases rather than a separately represented error vector. In the pseudocode formulation, the local weight update is

$\Delta s_i$9

The temporal difference of each neuron’s activity carries the back-propagated error into the afferent synapses, and only local information $\rho(s_j)$0 is used (Scellier et al., 2018).

3. Relation to Recurrent Backpropagation

The energy-based theory formalizes the relation to Recurrent Backpropagation through a phase-matching result. Recurrent Backpropagation defines the error-derivatives process from the projected cost $\rho(s_j)$1. At the free fixed point $\rho(s_j)$2, one introduces

$\rho(s_j)$3

with initial conditions and dynamics

$\rho(s_j)$4

$\rho(s_j)$5

where $\rho(s_j)$6. In the nudged phase, if $\rho(s_j)$7 is the flow under the augmented dynamics and

$\rho(s_j)$8

then

$\rho(s_j)$9

By uniqueness of solutions of the linear ODE,

$s\in\mathbb{R}^n$0

At large $s\in\mathbb{R}^n$1, $s\in\mathbb{R}^n$2, recovering the Equilibrium Propagation learning rule (Scellier et al., 2017).

This equivalence is the precise content of “phase matching” in the energy-based setting. At every moment in the second phase, the temporal derivatives of the neural activities in Equilibrium Propagation are equal to the error derivatives computed iteratively by Recurrent Backpropagation in the side network. In particular, the temporal derivatives $s\in\mathbb{R}^n$3 encode the layerwise back-propagated errors $s\in\mathbb{R}^n$4 (Scellier et al., 2017).

4. Exact gradients, approximate gradients, and symmetry

For the vector-field generalization, the true gradient of the objective $s\in\mathbb{R}^n$5 is

$s\in\mathbb{R}^n$6

whereas the vector-field update is

$s\in\mathbb{R}^n$7

Hence the error in using $s\in\mathbb{R}^n$8 instead of $s\in\mathbb{R}^n$9 is

$\theta=(W_{ij})$0

Its norm can be bounded through

$\theta=(W_{ij})$1

so the approximation error scales with the degree of asymmetry

$\theta=(W_{ij})$2

and vanishes exactly when the Jacobian is symmetric, which is the energy-based case (Scellier et al., 2018).

This yields a sharp comparison among related learning schemes. Classical backpropagation computes exact gradients by forward pass plus reverse-mode differentiation, requires a separate error network or back-pass carrying signed derivatives, and imposes exact weight-symmetry. Standard Equilibrium Propagation requires an energy function $\theta=(W_{ij})$3 so that $\theta=(W_{ij})$4, uses the two phases, and updates exactly follow the gradient of the energy-regularized objective, but still demands symmetric weights. The vector-field generalization allows asymmetric feed-forward and feedback weights, retains the two-phase scheme and STDP-compatible local plasticity, and computes only an approximation $\theta=(W_{ij})$5 to $\theta=(W_{ij})$6; the quality of the approximation improves as the Jacobian of $\theta=(W_{ij})$7 becomes more symmetric (Scellier et al., 2018).

5. Algorithmic realization and biological interpretation

The algorithmic outline is explicitly two-phase. Given learning rates $\theta=(W_{ij})$8 for dynamics and $\theta=(W_{ij})$9 for weights, small clamping $\mathbf{x}$0, cost $\mathbf{x}$1, and activation $\mathbf{x}$2, the procedure repeats for each minibatch $\mathbf{x}$3 as follows: Phase 1 is free relaxation, with $\mathbf{x}$4 initialized randomly or at zero, input units clamped to $\mathbf{x}$5, and $\mathbf{x}$6 until the state converges to $\mathbf{x}$7. Phase 2 is weakly clamped, with the same input clamped, $\mathbf{x}$8, and the state initialized at $\mathbf{x}$9 until it reaches $\beta\ge 0$0. The local weight update is then applied at the end of the second phase, synapse by synapse, using the phase-difference formula $\beta\ge 0$1 (Scellier et al., 2018).

The biological motivation is explicit. Two major reasons the biological plausibility of the backpropagation algorithm has long been doubted are that neurons would need to send two different types of signal in the forward and backward phases, and that pairs of neurons would need to communicate through symmetric bidirectional connections. The vector-field generalization addresses both issues: neurons perform leaky integration, synaptic weights are updated through a local mechanism, and the backward transport of error is realized by the same physical neuronal dynamics rather than by explicit weight transposition (Scellier et al., 2018).

6. Terminological context across disciplines

The phrase “phase matching” has established meanings outside learning theory. In nonlinear optics, energy conservation requires

$\beta\ge 0$2

and momentum conservation requires

$\beta\ge 0$3

The mismatch is the wave-vector mismatch $\beta\ge 0$4, and in a zero-index medium with effective refractive index $\beta\ge 0$5, the momentum per photon $\beta\ge 0$6 nearly vanishes, so substituting into $\beta\ge 0$7 or $\beta\ge 0$8 yields $\beta\ge 0$9 for either forward or backward idler generation (Gagnon et al., 2021).

In quantum search, “phase matching” refers to the choice of oracle and diffusion phase changes in the fully generalized Grover iterate. There, classical Grover’s algorithm and phase matching remains to be optimal till the target probability gets close 1; however, as the probability of observation approaches 1, the optimal phase changes differ from $$\frac{ds}{dt} = \mu_\theta^\beta(\mathbf{x},\mathbf{y},s) = \mu_\theta(\mathbf{x},s) - \beta\,\frac{\partial C}{\partial s}(\mathbf{y},s),$$0 and no longer observe phase matching (Cardullo et al., 13 May 2026).

This suggests that the neural usage of back-propagating phase matching is terminologically adjacent to, but conceptually distinct from, optical phase-matching and quantum-search phase selection. In the neural setting, the matching occurs between temporal derivatives in the nudged phase and the error derivatives computed iteratively by Recurrent Backpropagation, rather than between wave vectors or between oracle–diffusion phase rotations (Scellier et al., 2017, Scellier et al., 2018).