cs.LGNov 9, 2026

K-prop: Deep Online Learning by Backpropagating Temporal Kernels

Authors: Bingkun Liu, Paul Haider, Federico Benitez, Mihai A. Petrovici, Walter Senn

Organizations: Department of Physiology, University of Bern, Bern, Switzerland

Abstract

Self-recurrence represents an important component for temporal processing in neural networks, both artificial and biological, where it appears naturally in the form of leaky integration. However, due to the complex temporal dependencies of the gradient, an efficient and effective method of online training is still lacking. Here we propose K-prop, a novel online learning method for leaky neural networks. It dramatically reduces the computational and memory cost of real time recurrent learning (RTRL) by propagating kernel gains. K-prop also outperforms existing RTRL approximations and achieves performance comparable to backpropagation through time in sequence learning, classification, and reinforcement learning tasks. We further analyze how its sole approximation affects gradient quality and identify conditions under which K-prop remains accurate and effective.

Figures & tables

Appendix figures & tables5 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

Mar 30, 2026

Immediate Derivatives Suffice for Online Recurrent Adaptation

For three decades online recurrent learning has been assumed to require propagating a Jacobian tensor through the network's dynamics at O(n4)O(n^4) per step. We show it doesn't. Dropping the propagation entirely (d=0d=0, O(n2)O(n^2) memory) matches full RTRL within CI on held-out BCI cross-session drift (TOST equivalent within ±3\pm 3 pp at n=20n=20, Adam, float64), and across vanilla-RNN synthetic cells (sine and Lorenz under Adam and SGD) and LSTM/sine under Adam. A decomposition gRTRL=gimm+gpastg_{RTRL} = g_{imm} + g_{past} explains why. On BCI, gpastg_{past} concentrates in a single direction (top-1 singular fraction 0.62-0.74 across four optimizers, vs 0.333 for gimmg_{imm}), and the four-optimizer full-RTRL-vs-d=0d=0 recovery gap tracks each optimizer's per-layer update-magnitude ratio ∥ΔWhh∥/∥ΔWout∥\|ΔW_{hh}\|/\|ΔW_{out}\| monotonically. A stationary (no-drift) control collapses both concentrations to ~0.6: the drift-specific signal is the differential, not gpastg_{past}'s absolute rank-1 structure. The signature and the behavioral gap both collapse on LSTM, consistent with a mechanism specific to additive linear recurrence. On synthetic sine, gimmg_{imm} is redundant with gpastg_{past}, which predicts the synthetic null. Full RTRL's one robust advantage is LARS (+17 to +27 pp), but d=0d=0+LARS also fails to adapt independently; the gap is an optimizer×\timesmethod interaction, not a method-quality claim. We characterize the regime: d=0d=0+Adam+float64 is robust; SGD, Adafactor, and float32 have specific fragilities documented in the paper. On the evaluated cells, the 1000×1000\times memory saving at n=1024n=1024 (O(n2)O(n^2) vs O(n4)O(n^4)) comes with no measured recovery cost.
Mar 16, 2026

Massive Redundancy in Gradient Transport Enables Sparse Online Learning

Real-time recurrent learning (RTRL) computes exact online gradients by propagating a Jacobian tensor forward through recurrent dynamics, but at O(n^4) cost per step. Prior work has sought structured approximations (rank-1 compression, graph-based sparsity, Kronecker factorization). We show that, in the continuous error signal regime, the recurrent Jacobian is massively redundant:propagating through a random 6% of paths (k=4 of n=64) recovers 84 +/- 6% of full RTRL's adaptation ability across five seeds, and the absolute count k=4 remains effective from n=64 to n=256 (6% to 1.6%, recovery 84 to 78%), meaning sparse RTRL becomes relatively cheaper as networks grow. In RNNs, the recovery is selection-invariant (even adversarial path selection works) and exhibits a step-function transition from zero to any nonzero propagation. Spectral analysis reveals the mechanism: the Jacobian is full-rank but near-isotropic (condition numbers 2.6-6.5), so any random subset provides a directionally representative gradient estimate. On chaotic dynamics (Lorenz attractor), sparse propagation is more numerically stable than full RTRL (CV 13% vs. 88%), as subsampling avoids amplifying pathological spectral modes. The redundancy extends to LSTMs (k=4 matches full RTRL) and to transformers via sparse gradient transport (50% head sparsity outperforms the dense reference; 33% is borderline), with higher thresholds reflecting head specialization rather than isotropy. On real primate neural data, sparse RTRL (k=4) adapts online to cross-session electrode drift (80 +/- 11% recovery, 5 seeds), where sparse propagation is again more stable than full RTRL. Without continuous error signal, Jacobian propagation accumulates numerical drift and degrades all RTRL variants, a scope condition for all forward-mode methods. Results hold with SGD (92 +/- 1% recovery), suggesting independence from optimizer choice.
Dec 5, 2025

Learnability Window in Gated Recurrent Neural Networks

We develop a statistical theory of temporal learnability in recurrent neural networks, quantifying the maximal temporal horizon HN\mathcal{H}_N over which gradient-based learning can recover lag-dependent structure at finite sample size NN. The theory is built on the effective learning rate envelope f(ℓ)f(\ell), a function that captures how gating mechanisms and adaptive optimizers jointly shape the coupling between state-space dynamics and parameter updates during Backpropagation Through Time. Under heavy-tailed (αα-stable) fluctuations, where empirical averages concentrate at rate N−1/καN^{-1/κ_α} with κα=α/(α−1)κ_α= α/(α-1), the interplay between envelope decay and statistical concentration yields explicit scaling laws for the growth of HN\mathcal{H}_N: logarithmic, polynomial, and exponential temporal learning regimes emerge according to the decay law of f(ℓ)f(\ell). These results identify envelope decay as the key determinant of temporal learnability. Slower attenuation of f(ℓ)f(\ell) enlarges HN\mathcal{H}_N, while heavy-tailed fluctuations compress it by weakening statistical concentration. Moreover, envelope geometry outweighs dataset size: slowing the envelope's decay enlarges HN\mathcal{H}_N more than adding data, so more complex architectures that realize slower-decaying envelopes can be more data-efficient than simpler ones. Experiments across multiple gated architectures and optimizers corroborate these structural predictions.