No article text was recorded for this version.
iterative pruning overhead
Version 1 of 1773 papers888 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Lottery Tickets on a Data Diet: Finding Initializations with Sparse Trainable Networks
- Blog: Efficient Lottery Ticket Finding: Less Data is More
- Blog: When Layers Play the Lottery, all Tickets Win at Initialization
- Blog: Lottery Tickets on a Data Diet: Finding Initializations with Sparse Trainable Networks
- Blog: Instant Soup: Cheap Pruning Ensembles in A Single Pass Can Draw Lottery Tickets from Large Models
- Blog: Instant Soup: Cheap Pruning Ensembles in A Single Pass Can Draw Lottery Tickets from Large Models
- Blog: Sparsifying Networks via Subdifferential Inclusion
- Blog: PLEX: Adaptive Parameter-Efficient Fine-Tuning for Code LLMs using Lottery-Tickets
- Blog: The Elastic Lottery Ticket Hypothesis
- Blog: The Lottery Ticket Hypothesis at Scale
- Blog: Back to Basics: Efficient Network Compression via IMP.
- Blog: Dense for the Price of Sparse: Improved Performance of Sparsely Initialized Networks via a Subspace Offset
- Blog: Know What You Don't Need: Single-Shot Meta-Pruning for Attention Heads
- Blog: The Elastic Lottery Ticket Hypothesis
- Blog: Provably Efficient Lottery Ticket Discovery
- Blog: Pruning Adatperfusion with Lottery Ticket Hypothesis
- Blog: Drawing early-bird tickets: Towards more efficient training of deep networks
- Blog: Winning the Lottery Ahead of Time: Efficient Early Network Pruning
- Blog: Losing Heads in the Lottery: Pruning Transformer Attention in Neural Machine Translation
- Blog: Picking Winning Tickets Before Training by Preserving Gradient Flow
- Blog: Lottery Jackpots Exist in Pre-trained Models
- Blog: M2SGD: Learning to Learn Important Weights
- Blog: A Unified Lottery Ticket Hypothesis for Graph Neural Networks
- Blog: Network Approximation using Tensor Sketching
- Blog: Winning the Lottery Ahead of Time: Efficient Early Network Pruning
- Blog: The Lottery Ticket Hypothesis at Scale
- Blog: You are caught stealing my winning lottery ticket! Making a lottery ticket claim its ownership
- Blog: Fast Track to Winning Tickets: Repowering One-Shot Pruning for Graph Neural Networks
- Blog: EAGLES: Towards Effective, Efficient, and Economical Federated Graph Learning via Unified Sparsification
- Blog: Why Random Pruning Is All We Need to Start Sparse
- Blog: What's Hidden in a Randomly Weighted Neural Network?
- Blog: Towards Dynamic Sparsification by Iterative Prune-Grow LookAheads
- Blog: Localised Adaptive Spatial-Temporal Graph Neural Network
- Blog: A Survey of Lottery Ticket Hypothesis
- Blog: Voting from Nearest Tasks: Meta-Vote Pruning of Pre-trained Models for Downstream Tasks
- Blog: PHEW : Constructing Sparse Networks that Learn Fast and Generalize Well without Training Data
- Blog: The Unreasonable Effectiveness of Random Pruning: Return of the Most Naive Baseline for Sparse Training
- Blog: LOFT: Finding Lottery Tickets through Filter-wise Training
- Blog: A Generalized Lottery Ticket Hypothesis
- Blog: TASO: Task-Aligned Sparse Optimization for Parameter-Efficient Model Adaptation
- Blog: Peeling the Onion: Hierarchical Reduction of Data Redundancy for Efficient Vision Transformer Training
- Blog: Gradient Flow in Sparse Neural Networks and How Lottery Tickets Win
- Blog: The Lottery Ticket Hypothesis: Training Pruned Neural Networks
- Blog: The Lottery Ticket Hypothesis for Object Recognition
- Blog: Characterizing Sparse Connectivity Patterns in Neural Networks
- Blog: Winning the Lottery with Continuous Sparsification
- Blog: Comparing Rewinding and Fine-tuning in Neural Network Pruning
- Blog: Shannon Strikes Again! Entropy-based Pruning in Deep Neural Networks for Transfer Learning under Extreme Memory and Computation Budgets
- Blog: Rare Gems: Finding Lottery Tickets at Initialization
- Blog: Data-Efficient GAN Training Beyond (Just) Augmentations: A Lottery Ticket Perspective
- Blog: HyperSparse Neural Networks: Shifting Exploration to Exploitation through Adaptive Regularization
- Blog: Peek-a-Boo: What (More) is Disguised in a Randomly Weighted Neural Network, and How to Find It Efficiently
- Blog: Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networks
- Blog: Effective Model Sparsification by Scheduled Grow-and-Prune Methods
- Blog: Multicoated and Folded Graph Neural Networks with Strong Lottery Tickets
- Blog: On the Transferability of Winning Tickets in Non-Natural Image Datasets
- Blog: The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networks
- Blog: Cost-effective Artificial Neural Networks
- Blog: Quantifying lottery tickets under label noise: accuracy, calibration, and complexity
- Blog: Finding Lottery Tickets in Vision Models via Data-driven Spectral Foresight Pruning
Showing 60 of 773 papers.
History & citation
Current · Permanent link
- Training Sparse Neural Networks from Scratch merged into this direction (77% overlap)
- Sparse Subnetworks and the Lottery Ticket Hypothesis merged into this direction (80% overlap)
- Iterative Optimization for Structured and Unstructured Model Sparsity merged into this direction (50% overlap)
- Preserving Gradient Flow for Pruning at Initialization merged into this direction (74% overlap)
- Sparse Winning Tickets in Neural Network Initializations merged into this direction (58% overlap)
- Linear Mode Connectivity in Sparse Neural Networks merged into this direction (58% overlap)
- Finding High Performing Subnetworks Without Weight Training merged into this direction (73% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_iterative_pruning_overhead_7ffe5c25,
title = {iterative pruning overhead},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/iterative-pruning-overhead/rdr_7ffe5c25df6547eba4ff05e15716ec6f},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_iterative_pruning_overhead_7ffe5c25_v1,
title = {iterative pruning overhead},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/iterative-pruning-overhead/rdr_7ffe5c25df6547eba4ff05e15716ec6f/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}