A graph-embedding search over discretized pruning rates, guided by contrastive learning, claims high compression on CIFAR-10 but lacks key validation.
Structadmm: Achieving ultrahigh efficiency in structured pruning for dnns.IEEE transactions on neural networks and learning systems, 33(5):2259–2273, 2021
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.AI 1years
2025 1verdicts
REJECT 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding
A graph-embedding search over discretized pruning rates, guided by contrastive learning, claims high compression on CIFAR-10 but lacks key validation.