Research analysis · Biological computing

Plasticity rules you can engineer, not just find

A spiking reservoir of 4096 excitatory and 1024 inhibitory neurons learned to play Atari Pong under 2201 different local plasticity rules. High-scoring rules share three measurable dynamical signatures, those signatures predict performance from rule parameters alone, and simulation-based inference can then design new rules that beat every rule the original screen discovered.

Source: Learning to play with spikes: characterizing, predicting, and engineering unsupervised plasticity rules for spiking reservoir computing, bioRxiv preprint, September 2026. Primary source. Read the full preprint HTML including figures and technical appendix.

What the work claims

This is a primary computational result, not a hypothesis paper. The authors take a library of 2201 plasticity rules that were meta-learned in earlier work1 for producing stable dynamics in recurrent spiking networks, and ask a harder question: can these purely local, unsupervised rules serve as the learning algorithm of a reservoir computer, can we tell why one rule works and another fails, and can we actively engineer better ones?1

The bold claim is that the answer to all three is yes, and that the reasoning chain is interpretable at each step. The rules do learn: plastic reservoirs outperform static reservoirs at Pong. Performance is predictable: it correlates with rule parameters without running a single simulation. And performance is engineerable: a multi-fidelity simulation-based inference pipeline samples rules from the high-score region of parameter space that the original meta-learning search never found.1

How it works

The setup is deliberately conservative. The reservoir is a recurrent network of 4096 excitatory and 1024 inhibitory leaky-integrate-and-fire neurons with random, 10% sparse connectivity. Ball position from the Atari frame is encoded as spatial input; a linear readout decodes ball direction to move the paddle. Synapses update continuously under four activity-dependent plasticity rules, one per connection class (excitatory-to-excitatory, excitatory-to-inhibitory, and the two reverse directions), jointly parameterized by 24 numbers.1 Reservoir computing means only the readout is trained; the recurrent weights organize themselves.

Training is online: after a one-minute burn-in, the network plays 1000 games and is then tested on 250 more. Because good players rally longer, good rules see more ball trajectories during training, a Matthew-effect coupling of rule quality to training exposure. The authors control for this with a fixed-trajectory protocol and show the coupling amplifies but does not create the performance differences (Spearman rank correlation 0.84 between closed-loop and equalized-exposure scores).1

Across all 2201 rules, final-training score predicts held-out test score with r = 0.88. Drilling into the top, middle and bottom 5% (111 rules each), the high performers share three signatures. First, representation contrast: neurons encoding the ball trajectory separate strongly from background neurons in their tuning. Second, stability: synaptic weights stop drifting once the task structure is captured. Third, readout alignment: units that decode ball position at different time points stay consistently aligned, so the linear readout gets a stable code rather than a moving one. These signatures are not Pong-specific: the same rules were transferred to a structurally different delayed-match-to-sample task with 13 stimulus assemblies and a 5 second delay, where the signatures tracked performance again.1

Because the signatures are computable without playing Pong, a gradient-boosting surrogate can score candidate rules from parameters alone. That surrogate powers a multi-fidelity simulation-based inference pipeline: 100,000 cheap mean-field stability models pre-train the density estimator, then it is refined against full spiking simulations. Rules sampled from the inferred high-score posteriors (615 and 489 samples in two runs) outperformed the reweighted prior distribution, and the enrichment survived re-scoring on three held-out random seeds (rank correlation 0.82 across seeds).1

Where a skeptic should push

The single most load-bearing assumption is that mechanistic signatures measured within the Pong task tell you something about rule quality in general, rather than about Pong. The delayed-match transfer test is the right control and it supports the claim, but both tasks are small, low-dimensional, and decoded by a linear readout. A rule that aligns representations for a linear decoder is not thereby a good learning algorithm for a biological network solving naturalistic tasks with nonlinear readouts, i.e., actual muscles or downstream circuits. Demonstrated on simulated spiking networks: structured, predictable, engineerable plasticity. Asserted: that this transfers to real tissue.

Second, the Matthew-effect control deserves weight. Closed-loop training confounds rule quality with exposure, and exposure differences in a living preparation would be far harder to equalize than in simulation. The fixed-trajectory protocol shows the effect amplifies rather than creates differences, which is reassuring, but any closed-loop claim on a biological substrate will inherit exactly this confound, amplified by the slow and variable timescales of organoid maturation.1

Third, calibrate the benchmark honestly. The best plastic rules beat static reservoirs, echo state networks, FORCE-trained static reservoirs, and even fully trained predictive LSTM models at Pong, but the authors themselves describe the advantage over trained classical models as modest, with only a small subset of plastic models clearly ahead. The claim worth trusting is the qualitative one: unsupervised local plasticity is a competitive, interpretable learning algorithm for reservoirs. The claim worth doubting is any extrapolation to superiority on richer tasks.1

Finally, this is all in silico, run in the Auryn and PyTorch simulators. Nothing here has been demonstrated on neuromorphic hardware or on biological tissue; the hardware and biological relevance is argued by plausibility, including the fact that the underlying rule family was originally meta-learned against constraints consistent with cortical activity recordings.2

Plasticity rules as an organoid training grammar

For organoid intelligence, the non-obvious implication is that the learning rule is a designable object with readable fingerprints. Everyone training brain organoids as biological computers faces the same asymmetry: the readout and stimulation interface are under engineering control, while the internal plasticity that actually shapes the tissue is whatever development and activity-dependent biology put there. This paper hands that hidden process three things.

First, a quality-control instrument. If a living reservoir's intrinsic plasticity is doing its job, the organoid should show the same signatures this paper measured in silico: task-relevant units separating from background, weight (or equivalently synaptic efficacy) stabilization, and a readout weight matrix that stops needing to chase a drifting code. All three are measurable on a multi-electrode array without knowing the task solution, which means they are usable as non-invasive proxies for "is this organoid actually learning" during long, expensive closed-loop runs. That directly attacks the biggest practical problem in the field: the impossibility of knowing whether a slow biological preparation is improving or just aging.

Second, a closed-loop training blueprint. The multi-fidelity SBI structure, a cheap surrogate from simple dynamics models refining an estimator against rare full-fidelity evaluations, is precisely the architecture an organoid program needs when each biological experiment takes days and yields one noisy sample. Screen candidate stimulation or neuromodulatory protocols in cheap mean-field or reduced models, then spend real tissue only on the posterior region. The paper demonstrates this loop works for discovering rules; nothing structural prevents the same loop from steering real plasticity, for example by tuning optogenetic or electrical stimulation patterns that bias which of the tissue's own rules dominate.

Third, the threat, stated plainly. A plastic spiking reservoir of five thousand simulated neurons, with a linear readout, reaches competitive performance on a dynamic task with an interpretable account of why. That raises the bar any organoid claim must clear. "Living tissue self-organizes" is no longer a differentiator by itself, because self-organization has now been characterized and reverse-engineered in silico; the differentiator must be something silicon genuinely lacks, such as the rich intrinsic cell-type diversity, glial regulation, and metabolic self-maintenance of tissue. There is also a subtler warning in the Matthew-effect result: closed-loop biological training will tend to reward preparations that merely stay alive and active longer, and confounding rule quality with survival is a failure mode an organoid lab can slide into without ever noticing.

The bottom line

Established, in simulation: unsupervised local plasticity rules can act as the learning algorithm of a spiking reservoir; high performers carry interpretable, task-transferable dynamical signatures; and simulation-based inference conditioned on those signatures designs better rules than exhaustive screening found. Plausible but unproven: that the same signatures and the same engineering loop work on neuromorphic hardware or on living neural tissue. What would confirm it: reproducing the signature-to-performance relationship in a recording-driven biological reservoir, organoid or otherwise, and showing that an SBI-steered intervention on real tissue moves the signatures in the predicted direction. What would break it: evidence that on real substrates the signatures decouple from performance, or that biological plasticity occupies a regime where 24-parameter local rules are no longer the right model class.

Frequently asked questions

What is a plasticity rule in this context?

A mathematical rule that updates synaptic strengths from local signals, here the spike trains and filtered traces of pre- and post-synaptic neurons. Each of the four connection classes in the network has its own rule, together described by 24 parameters, and no global supervisor touches the recurrent weights.

What does reservoir computing mean?

A framework where a fixed recurrent network, the reservoir, expands inputs into rich temporal representations, and only a simple readout, here linear, is trained. The claim of this paper is that letting the reservoir adapt its own weights with unsupervised plasticity removes the classical ceiling imposed by fixed random connectivity.

How many rules were tested and how were they chosen?

All 2201 rules from a previously published library of meta-learned, stability-constrained plasticity rules were screened, not a hand-picked subset. The library itself came from earlier simulation-based inference work that selected for stable network dynamics rather than task performance.

What are the three signatures of a high-performing rule?

Strong separation between neurons encoding the task variable and background neurons, stabilized synaptic weight dynamics after learning, and consistent alignment over time of the units the readout relies on. The signatures held on a second, structurally different task, a delayed-match task with a 5 second delay.

What is simulation-based inference doing here?

It learns a statistical model of which rule parameters produce high scores, so new rules can be sampled from the high-score region directly. A multi-fidelity version uses 100,000 cheap mean-field approximations to pre-train the estimator and refines it with full spiking simulations, cutting the cost of each high-fidelity evaluation.

Why does this matter for organoid intelligence?

It converts the internal learning process of a neural substrate from an invisible black box into an object with measurable fingerprints and an engineering loop. That offers non-invasive quality control for living reservoirs and a template for spending scarce biological experiments only where a surrogate model says the payoff is highest.

References

  1. M. Kania, B. Confavreux, T. P. Vogels. Learning to play with spikes: characterizing, predicting, and engineering unsupervised plasticity rules for spiking reservoir computing. bioRxiv preprint. 2026. doi:10.64898/2026.09.15.751573. Accessed 2026-10-19.
  2. B. Confavreux, P. Ramesh, P. J. Goncalves, J. H. Macke, T. P. Vogels. Meta-learning families of plasticity rules in recurrent spiking networks using simulation-based inference. Advances in Neural Information Processing Systems 36, 13545 to 13558. 2023. Cited within reference 1; full text not independently retrieved for this analysis.