In biological neural circuits as well as in bio-inspired information processing systems, trajectories in high-dimensional state-space encode the solutions to computational tasks performed by complex dynamical systems. Due to the high state-space dimensionality and the number of possible encoding trajectories rapidly growing with input signal dimension, decoding these trajectories constitutes a major challenge on its own, in particular, as exponentially growing (space or time) requirements for decoding would render the original computational paradigm inefficient. Here, we suggest an approach to overcome this problem. We propose an efficient decoding scheme for trajectories emerging in spiking neural circuits that exhibit linear scaling with input signal dimensionality. We focus on the dynamics near a sequence of unstable saddle states that naturally emerge in a range of physical systems and provide a novel paradigm for analog computing, for instance, in the form of heteroclinic computing. Identifying simple measures of coordinated activity (synchrony) that are commonly applicable to all trajectories representing the same percept, we design robust readouts whose sizes and time requirements increase only linearly with the system size. These results move the conceptual boundary so far hindering the implementation of heteroclinic computing in hardware and may also catalyze efficient decoding strategies in spiking neural networks in general.
|Publication status||Published - 1 Dec 2021|