Evidence map›Paper›PMID 41107265›Full record

ArticleNature communications2025

A frugal Spiking Neural Network for unsupervised multivariate temporal pattern classification and multichannel spike sorting.

Sai Deepesh Pokala, Marie Bernert, Takuya Nanami, Takashi Kohno, Timothée Lévi, Blaise Yvert

Abstract read
In one paragraph

Article in Nature communications, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 2 papers.

0numbers the graph read from it
0cells of the map it votes in
2citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

2 citing papers in PubMed.

  1. Review
  2. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

6 authors.

Sai Deepesh PokalaUniv. Grenoble Alpes, INSERM, U1216, Grenoble Institut Neurosciences, Grenoble, France.
Marie BernertUniv. Grenoble Alpes, INSERM, U1216, Grenoble Institut Neurosciences, Grenoble, France.
Takuya NanamiInstitute of Industrial Science, The University of Tokyo, Meguro, Tokyo, Japan.
Takashi KohnoInstitute of Industrial Science, The University of Tokyo, Meguro, Tokyo, Japan.
Timothée LéviIMS, UMR5218, CNRS, University of Bordeaux, Talence, France.ORCID http://orcid.org/0000-0003-0378-8529
Blaise YvertUniv. Grenoble Alpes, INSERM, U1216, Grenoble Institut Neurosciences, Grenoble, France. blaise.yvert@inserm.fr.ORCID http://orcid.org/0000-0002-8850-7935

Funding

Agence Nationale de la Recherche (French National Research Agency) ANR-20-CE45-0005
6 · The paper itself

Abstract

Advanced large-scale neural interfaces call for efficient algorithms to automatically process and optimally exploit the richness of their heavy continuous flow of data. In this context, we introduce here a very frugal generic single-layer Spiking Neural Network (SNN) for fully unsupervised identification and classification of multivariate temporal patterns in continuous data streams. This approach is first validated on simulated multivariate data, Mel Cepstral representations of speech sounds, and multichannel multiunit neural recordings. Then, this very simple SNN was found to be effective at classifying action potentials in a fully unsupervised and online-compatible mode on simulated and real spike sorting datasets. These results pave the way for highly frugal SNN architectures for automatic unsupervised real-time pattern recognition in high-dimensional neural data recordings, which could be suitable for future embedding into ultra-low power hardware platforms, such as active neural implants.

Indexed as

Action PotentialsNeural Networks, ComputerPattern Recognition, AutomatedAlgorithmsHumansMultivariate AnalysisNeuronsUnsupervised Machine Learning

Identifiers

PMID41107265
PMCPMC12534432

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC-ND
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.