Lottery Ticket Preserves Weight Correlation: Is It Desirable or Not?
원문 초록
In deep model compression, the recent finding "Lottery Ticket Hypothesis" (LTH) (Frankle & Carbin, 2018) pointed out that there could exist a winning ticket (i.e., a properly pruned sub-network together with original weight initialization) that can achieve competitive performance than the original dense network. However, it is not easy to observe such winning property in many scenarios, where for example, a relatively large learning rate is used even if it benefits training the original dense model. In this work, we investigate the underlying condition and rationale behind the winning property, and find that the underlying reason is largely attributed to the correlation between initialized weights and final-trained weights when the learning rate is not sufficiently large. Thus, the existence of winning property is correlated with an insufficient DNN pretraining, and is unlikely to occur for a well-trained DNN. To overcome this limitation, we propose the "pruning & fine-tuning" method that consistently outperforms lottery ticket sparse training under the same pruning algorithm and the same total training epochs. Extensive experiments over multiple deep models (VGG, ResNet, MobileNet-v2) on different datasets have been conducted to justify our proposals.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
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
Structured Pruning and Quantization for Learned Image Compression
FLAT-LLM: Fine-grained Low-rank Activation Space Transformation for Large Language Model Compression
토론
이 논문과 연결된 포럼 글이 아직 없습니다.