Resource-efficient Neural Network Architectures for Classifying Nerve Cuff Recordings on Implantable Devices
Bibliographic record
Abstract
Abstract Background Closed-loop control of functional electrical stimulation involves using recorded nerve signals to make decisions regarding nerve stimulation in real-time. Surgically implanted devices that can implement this strategy have significant potential to restore natural movement after paralysis. Previous work demonstrated the use of convolutional neural networks (CNNs) to discriminate between activity from different neural pathways recorded by a high-density multi-contact nerve cuff electrode. Despite state-of-the-art performance, that approach required too much data storage, power and computation time for a practical implementation on surgically implanted hardware. Objective To reduce resource utilization for an implantable implementation, with a minimal performance loss for CNNs that can discriminate between neural pathways in multi-contact nerve cuff electrode recordings. Methods Neural network (NN) architectures were evaluated on a dataset of rat sciatic nerve recordings previously collected using 56-channel (7 x 8) spiral nerve cuff electrodes to capture spatiotemporal neural activity patterns. The NNs were trained to classify individual, natural compound action potentials (nCAPs) elicited by sensory stimuli. Three architecture types were explored: the previously reported ESCAPE-NET, a fully convolutional network, and a recurrent neural network. Variations of each architecture yielded NNs with a range in the number of weights and required floating-point operations (FLOPs). Each NN was evaluated based on F1-score and resource requirements. Results NNs were identified that, when compared to ESCAPE-NET, required 1,132-1,787x fewer weights, 389-995x less memory, and 6-11,073x fewer FLOPs, while maintaining macro F1-scores of 0.70-0.71 compared to a baseline of 0.75. Memory requirements range from 22.69 KB to 58.11 KB, falling within the range of on-chip memory sizes from several published deep learning accelerators fabricated in 65nm ASIC technology. Conclusion Reduced versions of ESCAPE-NET require significantly fewer resources without significant accuracy loss, thus can be more easily incorporated into a surgically implantable device that performs closed-loop real-time responsive neural stimulation.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.000 | 0.002 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".