mlsanityData to 14 Oct 2026

MetaSort: An Accelerated Approach for Non-uniform Compression and Few-shot Classification of Neural Spike Waveforms

arXiv 2603.07602 ↗First posted 8 Mar 2026eess.SP cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Many previous works in spike sorting study spike classification and compression independently. In this paper, a novel algorithm is proposed called MetaSort to address these two problems. To deal with compression, a novel adaptive level crossing algorithm is proposed to approximate spike shapes with high fidelity. Meanwhile, the latent feature representation is used to handle the classification problem. Besides, to guarantee MetaSort is robust and discriminative, the geometric information of data is exploited simultaneously in the proposed framework by meta-transfer learning. Empirical experiments with in-vivo spike data demonstrate that MetaSort delivers promising performance, highlighting its potential and motivating continued development toward an ultra-low-power, on-chip implementation.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 2 of its 12 references that are in the map. First posted on arXiv 8 Mar 2026.

Builds on

2 of 12 references.

References · 2

  1. 2018Deep Compressive Autoencoder for Action Potential Compression in Large-Scale Neural Recordingcited by 4
  2. 2022Efficient Approximation of Action Potentials with High-Order Shape Preservation in Unsupervised Spike Sortingcited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.