Differentiable Sparsification for Deep Neural Networks
원문 초록
Deep neural networks have significantly alleviated the burden of feature engineering, but comparable efforts are now required to determine effective architectures for these networks. Furthermore, as network sizes have become excessively large, a substantial amount of resources is invested in reducing their sizes. These challenges can be effectively addressed through the sparsification of over-complete models. In this study, we propose a fully differentiable sparsification method for deep neural networks, which can zero out unimportant parameters by directly optimizing a regularized objective function with stochastic gradient descent. Consequently, the proposed method can learn both the sparsified structure and weights of a network in an end-to-end manner. It can be directly applied to various modern deep neural networks and requires minimal modification to the training process. To the best of our knowledge, this is the first fully differentiable sparsification method.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Simple is what you need for efficient and accurate medical image segmentation
Attribution-guided Pruning for Compression, Circuit Discovery, and Targeted Correction in LLMs
FIMA-Q: Post-Training Quantization for Vision Transformers by Fisher Information Matrix Approximation
Advances in Small-Footprint Keyword Spotting: A Comprehensive Review of Efficient Models and Algorithms
The Catechol Benchmark: Time-series Solvent Selection Data for Few-shot Machine Learning
FailureSensorIQ: A Multi-Choice QA Dataset for Understanding Sensor Relationships and Failure Modes
토론
이 논문과 연결된 포럼 글이 아직 없습니다.