Successfully Applying the Stabilized Lottery Ticket Hypothesis to the Transformer Architecture
Abstract
Sparse models require less memory for storage and enable a faster inference by reducing the necessary number of FLOPs.This is relevant both for time-critical and on-device computations using neural networks.The stabilized lottery ticket hypothesis states that networks can be pruned after none or few training iterations, using a mask computed based on the unpruned converged model.On the transformer architecture and the WMT 2014 English→German and English→French tasks, we show that stabilized lottery ticket pruning performs similar to magnitude pruning for sparsity levels of up to 85%, and propose a new combination of pruning techniques that outperforms all other techniques for even higher levels of sparsity.Furthermore, we confirm that the parameter's initial sign and not its specific value is the primary factor for successful training, and show that magnitude pruning cannot be used to find winning lottery tickets.
Authors 3
-
Christopher Brix Aachen Human Language Technology and Pattern Recognition Group Computer Science Department
Affiliation as printed
Human Language Technology and Pattern Recognition Group Computer Science Department RWTH Aachen University D-52056 Aachen , Germany
RWTH Aachen University, Aachen, Germany
-
Parnia Bahar Aachen Human Language Technology and Pattern Recognition Group Computer Science Department
Affiliation as printed
Human Language Technology and Pattern Recognition Group Computer Science Department RWTH Aachen University D-52056 Aachen , Germany
RWTH Aachen University, Aachen, Germany
-
Hermann Ney Aachen Human Language Technology and Pattern Recognition Group Computer Science Department
Affiliation as printed
Human Language Technology and Pattern Recognition Group Computer Science Department RWTH Aachen University D-52056 Aachen , Germany
RWTH Aachen University
Cited by 22 stored of 22
No patents citing this paper on Lens.org (checked 2026-10-06).
References 26
-
W1570197553details pending0citations
-
W2144600658details pending0citations
-
W2161591461details pending0citations
-
W2186693119details pending0citations
-
W2608554408details pending0citations
-
W2764043458details pending0citations
-
W2792760996details pending0citations
-
W2915589364details pending0citations
-
W2919347051details pending0citations
-
W2946794439details pending0citations
-
W2948130861details pending0citations
-
W2963403336details pending0citations
-
W2963418779details pending0citations