Spike-based primitives for graph algorithms
In this paper we consider graph algorithms and graphical analysis as a new application for neuromorphic computing platforms. We demonstrate how the nonlinear dynamics of spiking neurons can be used to implement low-level graph operations. Our results are hardware agnostic, and we present multiple versions of routines that can utilize static synapses or require synapse plasticity.
Code (2)
Similar Papers 제목 키워드 기반
Modelling motion primitives and their timing in biologically executed movements
Biological movement is built up of sub-blocks or motion primitives. Such primitives provide a compact representation of movement which is also desirable in robotic control applications. We analyse handwriting data to gai…
SpikE: spike-based embeddings for multi-relational graph data
Despite the recent success of reconciling spike-based coding with the error backpropagation algorithm, spiking neural networks are still mostly applied to tasks stemming from sensory processing, operating on traditional …
Graph EmbeddingKnowledge GraphsSpike-based local synaptic plasticity: A survey of computational models and neuromorphic circuits
Understanding how biological neural networks carry out learning using spike-based local plasticity mechanisms can lead to the development of powerful, energy-efficient, and adaptive neuromorphic processing systems. A lar…
A Unifying Framework for the Identification of Motor Primitives
A long-standing hypothesis in neuroscience is that the central nervous system accomplishes complex motor behaviors through the combination of a small number of motor primitives. Many studies in the last couples of decade…
Linear-Time Primitives for Algorithm Development in Graphical Causal Inference
We introduce CIfly, a framework for efficient algorithmic primitives in graphical causal inference that isolates reachability as a reusable core operation. It builds on the insight that many causal reasoning tasks can be…
Causal Inference