Double-Scoring: Reliable Extraction of Strong Lottery Tickets
Existing methods struggle to reliably extract strong lottery ticket subnetworks from randomly initialized networks. This work proposes a dual-scoring mechanism that introduces an expanded scoring tensor space to optimize mask selection under fixed sparsity, effectively reformulating sparse structure discovery as an edge-popup optimization problem on a zero-augmented network. The approach preserves the reachability of original masks and substantially reduces sensitivity to sparsity hyperparameters by employing frozen-weight scoring during training alongside fixed-density mask optimization. Experimental results demonstrate that the method significantly outperforms fixed-density Edge-Popup, initialization-based pruning, and retrospective sparse training approaches across multiple benchmarks, while exhibiting strong robustness to variations in sparsity settings.