Pith. sign in

REVIEW 2 cited by

A Digital Machine Learning Algorithm Simulating Spiking Neural Network CoLaNET

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2503.17111 v2 pith:DMPAO24W submitted 2025-03-21 cs.NE

classification cs.NE
keywords colanetnetworkarchitectureclassificationdistinctivelearningshouldspiking
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

During last several years, our research team worked on development of a spiking neural network (SNN) architecture, which could be used in the wide range of supervised learning classification tasks. It should work under the condition, that all participating signals (the classified object description, correct class label and SNN decision) should have spiking nature. As a result, the CoLaNET (columnar layered network) SNN architecture was invented. The distinctive feature of this architecture is a combination of prototypical network structures corresponding to different classes and significantly distinctive instances of one class (=columns) and functionally differing populations of neurons inside columns (=layers). The other distinctive feature is a novel combination of anti-Hebbian and dopamine-modulated plasticity. While CoLaNET is relatively simple, it includes several hyperparameters. Their choice for particular classification tasks is not trivial. Besides that, specific features of the data classified (e.g. classification of separate pictures like in MNIST dataset vs. classifying objects in a continuous video stream) require certain modifications of CoLaNET structure. To solve these problems, the deep mathematical exploration of CoLaNET should be carried out. However, SNNs, being stochastic discrete systems, are usually very hard for exact mathematical analysis. To make it easier, I developed a continuous numeric (non-spiking) machine learning algorithm which approximates CoLaNET behavior with satisfactory accuracy. It is described in the paper. At present, it is being studied by exact analytic methods. We hope that the results of this study could be applied to direct calculation of CoLaNET hyperparameters and optimization of its structure.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Spiffy: Efficient Implementation of CoLaNET for Raspberry Pi

    cs.NE 2025-06 conditional novelty 4.0 of 10

    A single CoLaNET network reimplemented in Rust with a linear synaptic resource function, random weight initialization, and group-based reward reaches 91.08% MNIST accuracy and sub-millisecond per-timestep latency on a...

  2. Continual Learning with Columnar Spiking Neural Networks

    cs.NE 2025-06 conditional novelty 4.0 of 10

    A columnar spiking neural network with local learning rules reaches 92% average accuracy and about 4% forgetting on ten permuted-MNIST tasks, but only when tasks share no features.

Pith tools