ArticleEntropy (Basel, Switzerland)2026
Weighted Copula Entropy for Structural Pruning in Long-Tailed Autonomous Driving Object Detection.
Article in Entropy (Basel, Switzerland), 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
3 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
In autonomous driving, deep convolutional neural networks face a core conflict between computational efficiency and safety-critical robustness on resource-constrained onboard computing units. Dominant structural pruning, based on weight magnitude or geometric statistics, fails in long-tailed traffic scenarios by equating parameter magnitude with feature importance and pruning critical filters in the tail classes. To address this, we propose a structural pruning framework that evaluates the semantic utility of features using weighted copula entropy rather than relying solely on their magnitude. Our novel approach integrates Elastic Net regularization for inducing sparsity and weighted copula entropy for unbiased information-theoretic feature selection. By incorporating inverse class frequency weighting into empirical Copula estimation, we decouple feature relevance from sample abundance, ensuring the preservation of rare-class discriminators based on their information content rather than occurrence frequency. Furthermore, this metric is embedded into an enhanced max-relevance and min-redundancy algorithm to eliminate semantic redundancy while maintaining representational diversity. Extensive experiments on the BDD100K dataset with YOLOv5l and YOLOv8l architectures demonstrate that, at a 50% pruning rate, the proposed method reduces FLOPs and parameters by nearly 50%, with only 0.09% mAP@0.5 loss for YOLOv5l and 0.14% mAP@0.5 loss for YOLOv8l, while significantly improving the mAP of the extreme tail class Train from 0% to 3.84% and 2.76% to 5.12%, respectively. It achieves a more favorable trade-off between detection accuracy and computational efficiency than mainstream pruning approaches. This work provides a lightweight scheme for autonomous driving perception models and a new information-theoretic perspective for structured network pruning.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.