An efficient method for online detection of polychronous patterns in spiking neural networks

Joseph Chrol-Cannon, Yaochu Jin, André Grüning

TL;DR

This paper introduces "polycodes," a streamlined method for detecting precise spike-timing patterns in Spiking Neural Networks (SNNs) in real-time. By replacing computationally expensive, offline brute-force searches with a simple bitwise tagging and hashing scheme, the authors achieved a detection speedup of four orders of magnitude while maintaining the ability to classify complex visual stimuli.

The Challenge of Polychronous Patterns

In the field of computational neuroscience, Polychronous Neural Groups (PNGs) represent a sophisticated mechanism for information processing. Unlike traditional neural networks that rely on firing rates, PNGs emphasize the precise timing of spikes. Due to varying axonal delays, spikes from multiple neurons can converge on a target neuron simultaneously, causing it to fire. These time-locked cascades are considered fundamental to memory and computation in the brain.

Figure 4: Visualization of network properties including (A) axonal delays, (B) synaptic weights, and (C) the resulting spatio-temporal spiking activity.

However, detecting these patterns is notoriously difficult. Traditional methods are "brute-force" algorithms that typically run offline on pre-recorded data. They are computationally intensive, often requiring the testing of every possible neuron triplet to identify a group. Moreover, the definition of a PNG is frequently constrained by arbitrary rules, such as requiring a specific number of "anchor" neurons. This research addresses these bottlenecks by proposing a method efficient enough for "online" detection during active simulation.

The Polycode Method

The authors propose a Minimal Polychronous Model centered on "polycodes." Rather than searching for large, complex neural groups, this approach focuses on the atomic unit of polychrony: a single spike and the specific sequence of pre-synaptic inputs that triggered it.

  1. Tagging: Each neuron is assigned a unique, randomized bit-string (a "tag").
  2. Transmission & Rotation: When a pre-synaptic neuron spikes, it transmits its tag to its neighbors. To preserve the temporal order of arrival, the post-synaptic neuron performs a bitwise XOR between its current state and the incoming tag, followed by a bit-rotation (ROTL).
  3. Hashing: Once the post-synaptic neuron spikes, its accumulated bit-string—the "polycode"—serves as a key in a hash table for rapid identification.
  4. Causal Reset: To ensure the code only reflects activity contributing to a spike, the polycode is reset if the neuron’s membrane potential drops below a specific threshold.
Figure 6: Schematic of the polycode detection process, illustrating how pre-synaptic inputs (a-d) are processed to perform a hashtable lookup of the post-neuron tag.

This mechanism transforms pattern detection into a series of lightweight bitwise operations and hash map lookups, significantly reducing the overhead compared to traditional graph-matching algorithms.

Experimental Evaluation

The researchers tested their method using a standard task in computational neuroscience: Direction Selectivity of Motion. The setup involved:

  • Stimuli: Moving bars traveling in eight directions (0° to 315°).
  • Network Architecture: A 320-neuron SNN (256 excitatory, 64 inhibitory) using Izhikevich’s spiking model.
  • Input: A 16x16 pixel grid where each pixel stimulates specific excitatory neurons.

Key Results and Insights

  • Massive Efficiency Gains: The polycode method introduced only a 39ms overhead per ten seconds of simulation. In contrast, traditional PNG detection took approximately 23 minutes for the same data—a speedup of roughly 10,000x.
  • Representational Stability: Over time, the network settled into a stable state where the number of repeating polycodes surpassed novel ones, indicating consistent pattern formation.
  • High Selectivity: Despite their simplicity, polycodes demonstrated strong directional selectivity. Over 100,000 unique polycodes were found to be active for only one specific motion direction, enabling the construction of an effective classifier.
  • Sequence over Precision: By using bit-rotation, the algorithm captures the relative sequence of spikes rather than absolute timing. This allows the system to distinguish spatio-temporal patterns without requiring high-precision timers for every synapse.

Limitations and Future Directions

While highly efficient, polycodes have some trade-offs. Their simpler activation requirements make them more susceptible to "collisions" (different inputs generating the same code) or noise. The authors suggest that analyzing populations of polycodes, rather than individual ones, can mitigate this. Additionally, polycodes identify that a pattern occurred but do not inherently map the underlying structural anatomy of the connections.

Future work aims to integrate this detection method with Spike-Timing-Dependent Plasticity (STDP) to observe how these codes evolve as a network learns. Furthermore, exploring hierarchical structures could allow polycodes from one layer to serve as inputs for higher-level pattern recognition, potentially enabling the detection of increasingly abstract features.

Summary updated

Abstract

Polychronous neural groups are effective structures for the recognition of precise spike-timing patterns but the detection method is an inefficient multi-stage brute force process that works off-line on pre-recorded simulation data. This work presents a new model of polychronous patterns that can capture precise sequences of spikes directly in the neural simulation. In this scheme, each neuron is assigned a randomized code that is used to tag the post-synaptic neurons whenever a spike is transmitted. This creates a polychronous code that preserves the order of pre-synaptic activity and can be registered in a hash table when the post-synaptic neuron spikes. A polychronous code is a sub-component of a polychronous group that will occur, along with others, when the group is active. We demonstrate the representational and pattern recognition ability of polychronous codes on a direction selective visual task involving moving bars that is typical of a computation performed by simple cells in the cortex. By avoiding the structural and temporal analyses of polychronous group detection methods, the computational efficiency of the proposed algorithm is improved for pattern recognition by almost four orders of magnitude and is well suited for online detection.
BibTeX
@article{chrolcannon2017efficient,
  author = {Joseph Chrol-Cannon and Yaochu Jin and André Grüning},
  title = {{An efficient method for online detection of polychronous patterns in spiking neural networks}},
  journal = {Neurocomputing},
  year = {2017},
  doi = {10.1016/j.neucom.2017.06.025},
}
Figure