A lightweight online clustering algorithm, the neuromorphic dendrite, matches or outperforms offline k-means on synthetic spike sorting while adapting in a single pass.
Implementing Online Reinforcement Learning with Temporal Neural Networks
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
A Temporal Neural Network (TNN) architecture for implementing efficient online reinforcement learning is proposed and studied via simulation. The proposed T-learning system is composed of a frontend TNN that implements online unsupervised clustering and a backend TNN that implements online reinforcement learning. The reinforcement learning paradigm employs biologically plausible neo-Hebbian three-factor learning rules. As a working example, a prototype implementation of the cart-pole problem (balancing an inverted pendulum) is studied via simulation.
citation-role summary
citation-polarity summary
fields
cs.NE 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Neuromorphic Online Clustering and Its Application to Spike Sorting
A lightweight online clustering algorithm, the neuromorphic dendrite, matches or outperforms offline k-means on synthetic spike sorting while adapting in a single pass.