REVIEW 8 cited by
Picking Winning Tickets Before Training by Preserving Gradient Flow
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Overparameterization has been shown to benefit both the optimization and generalization of neural networks, but large networks are resource hungry at both training and test time. Network pruning can reduce test-time resource requirements, but is typically applied to trained networks and therefore cannot avoid the expensive training process. We aim to prune networks at initialization, thereby saving resources at training time as well. Specifically, we argue that efficient training requires preserving the gradient flow through the network. This leads to a simple but effective pruning criterion we term Gradient Signal Preservation (GraSP). We empirically investigate the effectiveness of the proposed method with extensive experiments on CIFAR-10, CIFAR-100, Tiny-ImageNet and ImageNet, using VGGNet and ResNet architectures. Our method can prune 80% of the weights of a VGG-16 network on ImageNet at initialization, with only a 1.6% drop in top-1 accuracy. Moreover, our method achieves significantly better performance than the baseline at extreme sparsity levels.
Forward citations
Cited by 8 Pith papers
-
Efficient Column-Wise N:M Pruning on RISC-V CPU
Column-wise N:M pruning plus fused im2col and data packing accelerates ResNet inference on RISC-V vector CPUs by up to 4x while keeping ImageNet top-1 accuracy within 2.1% of the dense model.
-
Dynamic Sparse Training of Diagonally Sparse Networks
A dynamic sparse training method that restricts weights to a learnable set of diagonals, preserving sparsity in both forward and backward passes to obtain GPU speedups at accuracy close to unstructured sparsity.
-
Examining the Efficacy of Graph Neural Network Message-Passing in Regression Contexts
Across four NAS/DNN-predictor regression benchmarks, GEN (deep graph convolution) achieves the best average rank over 11 GNN message-passing layers, though attention GATv2 wins on the largest graphs.
-
Double-Scoring: Reliable Extraction of Strong Lottery Tickets
Double-scoring replaces layerwise sparsity selection with fixed half-density masking over an augmented score tensor, yielding higher untrained-subnetwork accuracy but at uncontrolled effective sparsity.
-
Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts
Sparse adapters trained with max connection sensitivity outperform LoRA and full fine-tuning both alone and after merging 20 task experts, but still lag multitask training on unseen tasks.
-
Searching Efficient Deep Architectures for Radar Target Detection using Monte-Carlo Tree Search
Monte-Carlo tree search found a radar detection network with 60% fewer parameters than a baseline U-Net at comparable detection performance.
-
EGGS-PTP: An Expander-Graph Guided Structured Post-training Pruning Method for Large Language Models
EGGS-PTP adds a connectivity-preserving diagonal selection to RIA-style importance pruning, achieving slightly better perplexity under N:M sparsity.
-
SHeRL-FL: When Representation Learning Meets Split Learning in Hierarchical Federated Learning
The submitted body is an unrelated survey, not the SHeRL-FL method claimed in the metadata.
Discussion (0). Sign in to comment.