173

Predictive Spike Timing Enables Distributed Shortest Path Computation in Spiking Neural Networks

Main:7 Pages
9 Figures
Bibliography:11 Pages
Appendix:4 Pages
Abstract

Efficient planning and sequence selection are central to intelligence, yet current approaches remain largely incompatible with biological computation. Classical graph algorithms like Dijkstra's or A* require global state and biologically implausible operations such as backtracing, while reinforcement learning methods rely on slow gradient-based policy updates that appear inconsistent with rapid behavioral adaptation observed in natural systems.

View on arXiv
Comments on this paper