arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2002.04809cs.LGstat.ML

Lookahead: A Far-Sighted Alternative of Magnitude-based Pruning

KAIST EE(韩国科学技术院电子工程学院);KAIST AI(韩国科学技术院人工智能学院)

Sejun Park, Jaeho Lee, Sangwoo Mo, Jinwoo Shin

英文摘要:

Magnitude-based pruning is one of the simplest methods for pruning neural networks. Despite its simplicity, magnitude-based pruning and its variants demonstrated remarkable performances for pruning modern architectures. Based on the observation that magnitude-based pruning indeed minimizes the Frobenius distortion of a linear operator corresponding to a single layer, we develop a simple pruning method, coined lookahead pruning, by extending the single layer optimization to a multi-layer optimization. Our experimental results demonstrate that the proposed method consistently outperforms magnitude-based pruning on various networks, including VGG and ResNet, particularly in the high-sparsity regime. See https://github.com/alinlab/lookahead_pruning for codes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑