MétaCan
Menu
Back to cohort

Joint Early Exit and Structured Pruning for Automatic Modulation Classification in Vehicular Networks

2025· article· W7118789589 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Language
FieldComputer Science
TopicWireless Signal Modulation Classification
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsPruningJoint (building)Computational complexity theoryArtificial neural networkKey (lock)Deep neural networksWireless

Abstract

fetched live from OpenAlex

Automatic Modulation Classification (AMC) is essential for wireless communication systems, particularly in resource-constrained environments such as vehicular networks. However, deploying Deep Neural Networks (DNNs) on receivers is challenging due to computational and energy constraints. To address this, we propose the first joint integration of early exit and structured pruning for AMC, optimizing computational efficiency without significantly compromising accuracy. Through theoretical analysis, we demonstrate the unique interactions between these techniques and the non-intuitive impact of pruning on early-exit models. Our experiments evaluate the impact of various pruning criteria, pruning percentages, and early-exit thresholds. Our results reveal that the effectiveness of different pruning criteria in early-exit AMC models is highly context-dependent, with no universally optimal strategy, and that increasing pruning levels and early-exit thresholds intensifies the trade-off between computational efficiency and classification accuracy.

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.

Full frame distilled prediction

Teacher imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.675
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.002
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.036
GPT teacher head0.269
Teacher spread0.233 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it