Efficiency metrics for auditory neuromorphic spike encoding techniques using information theory
Bibliographic record
Abstract
Abstract Spike encoding of sound consists in converting a sound waveform into spikes. It is of interest in many domains, including the development of audio-based spiking neural network applications, where it is the first and a crucial stage of processing. Many spike encoding techniques exist, but there is no systematic approach to quantitatively evaluate their performance. This work proposes the use of three efficiency metrics based on information theory to solve this problem. The first, coding efficiency, measures the fraction of information that the spikes encode on the amplitude of the input signal. The second, computational efficiency, measures the information encoded subject to abstract computational costs imposed on the algorithmic operations of the spike encoding technique. The third, energy efficiency, measures the actual energy expended in the implementation of a spike encoding task. These three efficiency metrics are used to evaluate the performance of four spike encoding techniques for sound on the encoding of a cochleagram representation of speech data. The spike encoding techniques are: Independent Spike Coding, Send-on-Delta coding, Ben’s Spiker Algorithm, and Leaky Integrate-and-Fire (LIF) coding. The results show that LIF coding has the overall best performance in terms of coding, computational, and energy efficiency.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.003 | 0.015 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".