← Home

PING tolerates 80% dropped spikes but collapses on added noise

exp037 · 30 May 2026 · pdf

The trained networks this entry uses are produced once in the shared training hub, exp022 (Training), and reused here rather than retrained.

Abstract

Perturbs the hidden spike stream of trained PING and COBA networks at inference (drop spikes, add spikes) to ask whether the PING rate floor is dynamical or informational. PING tolerates dropping ≈ 80% of its emitted spikes (accuracy 85% at that level, from 91% unperturbed) yet collapses once added Poisson noise passes ≈ 81% of its own baseline rate. COBA is roughly flat to both, holding 89% across the whole add sweep (which reaches only ≈ 22% of its far higher baseline). The asymmetry, drops forgiven while adds break the gating, is the gamma cycle made visible: a structural feature of the architecture, not a readout-side trade-off.

Method

ParameterValue
Integration timestep Δ𝑡0.1 ms
Trial duration 𝑇200 ms
Held-out MNIST test samples500
Baseline training epochs (in exp022)30

The PING and COBA baseline definitions and training recipe are in exp025, where the rate-floor mechanism is also worked out. This entry tests whether the floor is dynamical (locked by the cycle period) or informational (locked by the readout’s spike-count requirement) by perturbing the hidden spike stream of the trained networks at inference.

The perturbation. A per-step callback on the COBANet’s _hidden_perturb_fn slot fires every timestep of every trial, with no warm-up, schedule, or exclusion. Trials are 𝑇=200 ms at Δ𝑡=0.1 ms → 2000 fires per trial, applied across the held-out test set against the same trained network. At each timestep 𝑡:

  1. update conductances from the previous step’s spikes: 𝑔𝑒(𝑡)𝑔𝑒(𝑡1)𝑑AMPA+𝒔̃𝐸,(𝑡1)𝑊𝑒𝑒+input(𝑡)𝑊in, with the analogous update for 𝑔𝑖(𝑡) from 𝒔̃𝐼,(𝑡1)𝑊𝑖𝑒 and the E→I conductance from 𝒔̃𝐸,(𝑡1)𝑊𝑒𝑖;
  2. LIF step integrates 𝑉(𝑡) and emits raw spike vectors 𝒔𝐸,(𝑡){0,1}𝐵×𝑁𝐸, 𝒔𝐼,(𝑡){0,1}𝐵×𝑁𝐼;
  3. perturbation callback rewrites the raw vectors → 𝒔̃𝐸,(𝑡),𝒔̃𝐼,(𝑡);
  4. record the perturbed vectors into the spike buffer;
  5. readout accumulator adds 𝒔̃𝐸,(𝑡)𝑊out to the mem-mean integrator.

Step 1 of timestep 𝑡+1 consumes the perturbed spikes through 𝑊𝑒𝑒,𝑊𝑒𝑖,𝑊𝑖𝑒: a dropped E spike fails to drive I next step and contributes nothing to the readout; an injected I spike adds inhibition next step and counts in the rate metric. E and I get the same mode and level with independent draws.

Drop mode. For each (batch, neuron, timestep) slot 𝑖, draw 𝑢𝑖Uniform(0,1) i.i.d. and keep each emitted spike with probability 1𝑝drop:

𝑠̃𝑖=𝑠𝑖𝟙[𝑢𝑖𝑝drop].

Drop thins the count fed to both the readout and the next-step conductance update while leaving the E→I→E loop intact. Sweep 𝑝drop{0.0,0.1,,1.0}, 11 levels.

Add mode. For each slot draw 𝑢𝑖Uniform(0,1) i.i.d. and flip silent slots on at Poisson statistics, phase-independent:

𝑠̃𝑖=min(𝑠𝑖+𝟙[𝑢𝑖<𝑟addΔ𝑡/1000],1).

Sweep 𝑟add{0,2,,40} Hz per neuron, 21 levels, applied equally to E and I. Because the two architectures sit at very different baselines (COBA ≈ 181 Hz per E cell versus PING ≈ 12 Hz, a factor of ≈ 15), a fixed added rate is a much larger relative insult to PING than to COBA, so the right panel of Figure 1 expresses the added rate as a percentage of each model’s own baseline E rate (the architecture-fair view). The per-step RNG is seeded separately from the input encoder, so the Poisson input stream matches the unperturbed baseline. Total: 2 models × (11 drop + 21 add) = 64 forward passes.

Results

Two panels of test accuracy versus perturbation level for COBA (red) and PING (black), both x-axes in percent. Left: accuracy versus percent of emitted spikes dropped. Right: accuracy versus added Poisson noise as a percent of each model's own baseline rate. PING falls steeply on the right and reaches chance; COBA's sweep spans only a small percent of its high baseline and stays flat.
Figure 1: Left (drop): Bernoulli mask, percent of emitted spikes dropped. Right (add): Poisson injection as a percent of each model’s own baseline E rate, so the two architectures are insult-matched. The asymmetry is direct: PING (black) holds accuracy to ≈ 85% at 80% drop but collapses once added noise passes ≈ 81% of its baseline, while COBA (red) stays at 89% across its whole sweep, which reaches only ≈ 22% of its far higher baseline. The dashed line marks chance.
Three stacked single-trial rasters of trained PING at drop levels 0, 50, and 100 percent; E spikes in black above I spikes in red. The gamma banding is preserved at 0 and 50 percent and silent at 100 percent.
Figure 2: Trained PING replayed on the same MNIST digit 0 trial across three drop levels (0, 50, 100%); E (black) above I (red). The gamma cadence persists as spikes are thinned and only vanishes at total drop: dropping spikes thins the train without injecting phase-incoherent activity.
Three stacked single-trial rasters of trained PING at added Poisson rates of 0, 20, and 40 Hz; E spikes in black above I spikes in red. The gamma banding dissolves into asynchronous firing as the added rate rises.
Figure 3: Trained PING replayed across three added-noise levels (0, 20, 40 Hz per neuron). The gamma banding dissolves into asynchronous firing as the added rate rises, matching the accuracy cliff in the previous figure.
Three stacked single-trial rasters of trained COBA at drop levels 0, 50, and 100 percent; dense asynchronous E firing that thins uniformly with drop and is silent at 100 percent.
Figure 4: Trained COBA replayed across the same drop sweep. With no cycle to preserve, dropping spikes just thins a uniform asynchronous mean.
Three stacked single-trial rasters of trained COBA at added Poisson rates of 0, 20, and 40 Hz; dense asynchronous firing whose mean rate rises but whose structure is unchanged.
Figure 5: Trained COBA replayed across the same add sweep. Added spikes blend into COBA’s asynchronous mean: no temporal structure to corrupt, just a higher mean rate.