< Back to Article

Temporal resolution of spike coding in feedforward networks with signal convergence and divergence

Fig 3

Bottlenecks have more to gain from temporal codes than expansion layers.

(A) Example reconstructions from the hidden layer spikes binned at Δt = 5 ms (left) and Δt = 50 ms (right) resolution for (top) and (bottom). Thin traces show reconstructions from individual network seeds. Thick colored traces show means across all network seeds. (B) Decoding accuracy from the hidden layer spikes as a function of bin size Δt for the bottleneck (left) and expansion (right) network. Gray points denote which bin sizes were used to compute accuracy gain . Error bars denote standard errors of the mean over network seed distributions. (C) Accuracy gain of the temporal code over count code when reconstructing the stimulus based on spikes from the hidden layer, for bottleneck (red) and expansion (blue) networks. One-sided Wilcoxon rank-sum test . Results are shown for 25 independent network simulations.

doi: https://doi.org/10.1371/journal.pcbi.1012971.g003