Switching On the Inhibitory Loop

Enabling an inhibitory loop after feedforward training reduced excitatory firing but lowered classification accuracy; the experiment does not isolate a benefit of gamma timing.

Abstract

We asked what happens when reciprocal inhibition is enabled after feedforward training. We held the learned input and readout weights fixed and varied bidirectional E↔I coupling in three MNIST classifiers. At full loop strength, mean E rate fell from 86 to 7 Hz, while test accuracy fell by 47 percentage points. This demonstrates post-training rate suppression under these conditions, without isolating a benefit of gamma timing or testing whether retraining could recover accuracy.

Results

Loop-strength rates and accuracy

At full loop strength, E rate fell from approximately 86 to 7 Hz, I rate reached 40 Hz, and accuracy fell by 47 percentage points. Because both coupling directions varied, lower activity alone does not identify a causal benefit of rhythm (Fig. 1).

Rasters with the loop off and enabled after training, followed by population firing rates and test accuracy across bidirectional loop strengths.

Figure 1: Reanalysed inference observations; no retraining. (A) Seed-42 raster with the loop off and (B) with the loop fully enabled, for the same digit-7 test image each shows 200 E neurons (black) and 64 I neurons (red). (C) Population rates and (D) accuracy on 1000 test images per seed; curves show means ± sample SD across seeds 42–44.

Loop-strength PING rasters

Burst grouping increased across the sampled loop strengths. These illustrative panels do not estimate gamma frequency or establish a continuous transition (Fig. 2).

Six E/I spike rasters from the same test image, at loop strengths zero through one, showing increasingly grouped bursts.

Figure 2: Seed 42, the same digit-7 test image, at bidirectional loop strengths (A–F) s=0,0.2,0.4,0.6,0.8,1s = 0 , 0.2 , 0.4 , 0.6 , 0.8 , 1, respectively. Learned input and readout weights were fixed; recurrent E↔I weights were initialized at each strength without training. Rows show the same sampled 200 E and 64 I neurons over 200 ms.

Methods

We reused networks from the exp022 — MNIST and reanalysed recorded inference observations. No new training or simulation was performed for this account.

  1. Reuse trained classifiers. MNIST handwritten digits [1] supplied 6,300 training and 700 validation images from the official training partition. Conductance-based leaky-integrate-and-fire networks had 784 Poisson input channels, 1,024 excitatory (E), 256 inhibitory (I), and 10 output neurons; pixels set rates up to 25 Hz. Input and readout weights trained for 50 epochs; class scores were mean pre-reset output voltages. We selected the minimum mean validation cross-entropy over three fixed encoding draws, breaking ties by accuracy and then earliest epoch, rather than using final-epoch weights.

  2. Enable the loop after training. Three feedforward controls, seeds 42–44, had no activity penalty or recurrent coupling during training. Dimensionless strength ss took eleven values from 0 to 1 in steps of 0.1; it set E→I and I→E initializer means to ss and 2s2 s, respectively, with standard deviations one tenth of those means and normalization by source population size. These lower-clamped normal weights replaced the zero recurrent matrices; learned input and readout weights stayed fixed, and E→E and I→I coupling stayed zero. The same network seed was reused across strengths; no optimization followed the intervention.

  3. Evaluate responses. Each strength used the same 1000 images from the official 10000-image test partition, with 200 ms presentations and 0.1 ms steps. Accuracy counted correct classifications; rates included all neurons and all evaluated presentations:

    rP=1NevalNPTpresent∑b=1Neval∑n∈Pnspike(b,n).(1)r_{P} = \frac{1}{N_{\text{eval}} N_{P} T_{\text{present}}} \sum_{b = 1}^{N_{\text{eval}}} \sum_{n \in P} n_{\text{spike} ( b , n )} . \tag{1}

    Here PP denotes E or I, NPN_{P} its neuron count, NevalN_{\text{eval}} the number of presentations, TpresentT_{\text{present}} their duration in seconds, and nspike(b,n)n_{\text{spike} ( b , n )} neuron nn’s spike count during presentation bb; rPr_{P} is in hertz. Curves show means and sample standard deviations across the three networks; single-image rasters are illustrative.

  4. Probe input drive. Auxiliary probes reused seed-42 classifiers trained with and without the loop. Uniform independent Poisson inputs covered 26 rates between 0 and 100 Hz, with 32 trials per rate; a separate trained-loop probe used one test image at ten maximum pixel rates from 0 to approximately 23.08 Hz. These recorded firing curves complement the exp023 — Turning the PING Loop On they are not additional loop-transfer accuracy evaluations.

Appendix: Training and probe settings

Training and probe settings are listed in Parameters.

The broader activity frontier contains 36 classifiers: two network configurations, three seeds, and six activity conditions (penalty off or ceilings of 25, 10, 5, 2.5 and 1 Hz). Its summaries preserve selected and final-epoch validation accuracy, final-epoch training E rate, and across-seed means and SEM; these are distinct from the inference measurements above. The loop-transfer comparison used only the three unpenalised feedforward classifiers. The exp025 — Inhibition, Accuracy and Firing describes the broader training design.

Feedforward and loop-enabled training used voltage-gradient damping of 1 and 1,000 respectively; this difference affects the auxiliary between-model comparisons, not the within-classifier inference intervention. Dale’s law was enforced, adaptive thresholds were disabled, and membrane time constants were not trained.

Illustrative snapshots use test-image index 0, not selection by digit class. A fixed pseudorandom sample selects 200 E and 64 I neurons for display; reported firing rates use the full populations. Uniform-input E+I overlays add the two population means without weighting by neuron count, and are not a whole-network mean. Neither the transfer rasters nor these firing curves provide a spectral gamma-frequency estimate. The accuracy decline is consistent with changing the trained network’s dynamics, but does not identify the readout as its sole cause or test recovery by retraining.

Network diagrams

COBA classifier; illustrative model schematic.
Figure A1. COBA classifier. Illustrative schematic of the documented model; it is not a recovered historical execution bundle or a measurement. XX denotes input spike channels, EE the excitatory population and RR the class readout. Every weighted pathway is labelled WXYW_{XY}, with target XX first and source YY second. Arrowheads show excitatory or feedforward drive; bars show inhibition. Recording and score reductions are omitted. COBA panels omit the inactive inhibitory loop where shown.
PING classifier; illustrative model schematic.
Figure A2. PING classifier. Illustrative schematic of the documented model; it is not a recovered historical execution bundle or a measurement. XX denotes input spike channels, EE/II excitatory/inhibitory populations and RR the class readout. Every weighted pathway is labelled WXYW_{XY}, with target XX first and source YY second. Arrowheads show excitatory or feedforward drive; bars show inhibition. Recording and score reductions are omitted.

Parameters

Model values are read from original native snapshots through the selected presentation’s compute ancestry. Paired values are E / I. Initializer parent means and SDs describe the original weight distributions, in µS for conductance projections and dimensionless for the current-based readout; they are not measured trained-weight statistics. Missing snapshots or fields are unavailable; current recipes and historical copied tables are not substituted. The recorded configuration identifies the input, numerical and analysis choices of that computation; it does not establish a separate upstream training protocol.

ParameterLoop offLoop on
Network
E / I neuronsUnavailable / UnavailableUnavailable / Unavailable
Output neuronsUnavailableUnavailable
Neurons
Capacitance, E / I (nF)Unavailable / UnavailableUnavailable / Unavailable
Leak conductance, E / I (µS)Unavailable / UnavailableUnavailable / Unavailable
Resting voltage, E / I (mV)Unavailable / UnavailableUnavailable / Unavailable
Threshold, E / I (mV)Unavailable / UnavailableUnavailable / Unavailable
Reset, E / I (mV)Unavailable / UnavailableUnavailable / Unavailable
Refractory period, E / IUnavailable / UnavailableUnavailable / Unavailable
Synapses and weights
Input→E synapseUnavailable / UnavailableUnavailable / Unavailable
E→I synapseUnavailable / UnavailableUnavailable / Unavailable
I→E synapseUnavailable / UnavailableUnavailable / Unavailable
E→Output synapseUnavailable / UnavailableUnavailable / Unavailable
Input→E initializer parent mean / SDUnavailable / UnavailableUnavailable / Unavailable
E→I initializer parent mean / SDUnavailable / UnavailableUnavailable / Unavailable
I→E initializer parent mean / SDUnavailable / UnavailableUnavailable / Unavailable
E→Output initializer parent mean / SDUnavailable / UnavailableUnavailable / Unavailable
Native parameter stageUnavailableUnavailable
Input and simulation
Timestep (ms)UnavailableUnavailable
Duration (ms)UnavailableUnavailable
Evaluation samplesUnavailableUnavailable
SeedsUnavailableUnavailable
Input rate (Hz)UnavailableUnavailable
Post-burn exclusion (ms)UnavailableUnavailable
Readout and training
Output neuron modelUnavailableUnavailable
EpochsUnavailableUnavailable
Checkpoint roleUnavailableUnavailable
Checkpoint purposeUnavailableUnavailable
Analysis
Frequency search (Hz)UnavailableUnavailable
Count-bin width (ms)UnavailableUnavailable
Autocorrelation maximum lag (ms)UnavailableUnavailable

Dataset

Upstream: exp022 — MNIST

Downstream: exp110 — Manuscript

Current runset

RunDateDurationSizeEvidenceStorageRan onVerification
exp038-r011-present21s683.2 KBCurrentR2HPCLocal: absent; R2: catalog-verified
exp038-r010-analyse21s126.2 KBCurrentR2HPCLocal: absent; R2: catalog-verified
exp038-r009-compute40m 35s996.5 KBCurrentR2HPCLocal: absent; R2: catalog-verified
exp022-r015-compute12h 58m 52s3.6 GBCurrentR2HPCLocal: absent; R2: catalog-verified
exp022-r007-compute11h 16m 8s3.6 GBCurrentR2HPCLocal: absent; R2: catalog-verified
exp022-r001-compute2d 7h 4m 16s2 GBCurrentR2HPCLocal: absent; R2: catalog-verified

References

  1. Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner. “Gradient-based learning applied to document recognition.” Proceedings of the IEEE 86(11), 2278–2324 (1998). doi:10.1109/5.726791