Signal-to-event encoding parameter selection for multiple event classification with spiking neural networks
Bibliographic record
Abstract
Event-driven systems can operate either on discrete-time event streams or on analog signals transformed into the event domain by a predefined encoding scheme. This paper studies the problem of optimal event-based signal encoding if data are to be processed by a machine learning model, such as the spiking neural network (SNN). We introduce a method of encoding parameter selection that evaluates a k-Nearest Neighbor (k-NN) classifier operating on a measure of the event stream distance in multiple trials of a Bayesian optimization process. The efficiency of the proposed method is assessed by relating the classification performance with the number of events produced by a signal-to-event encoding scheme. The proposed method is validated for vehicle monitoring sensor data with three event-based encoding schemes: level-crossing encoding, send-on-delta, and leaky integrate-and-fire encoder. The best-performing sets of encoding parameters give an average accuracy of up to 0.912 for the k-NN classification, while producing 97.8% fewer number of samples than for the classical periodic discrete-time signal representation. Additionally, we train the SNN classifiers on data encoded according to the selected sets of parameters, achieving an average classification accuracy of up to 0.946, improving upon the k-NN baseline. This shows that the proposed model-agnostic signal-to-event encoding parameter selection is promising for training sophisticated machine learning models.
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.001 | 0.006 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| 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".