{"total":24,"rows":[{"id":"2202.02643","title":"The Unreasonable Effectiveness of Random Pruning: Return of the Most Naive Baseline for Sparse Training","created":"2022-02-05","cited_by_count":85,"area":null},{"id":"2106.10404","title":"Sparse Training via Boosting Pruning Plasticity with Neuroregeneration","created":"2021-06-19","cited_by_count":84,"area":null},{"id":"2205.02321","title":"Most Activation Functions Can Win the Lottery Without Excessive Depth","created":"2022-05-04","cited_by_count":21,"area":null},{"id":"2206.10451","title":"Winning the Lottery Ahead of Time: Efficient Early Network Pruning","created":"2022-06-21","cited_by_count":21,"area":null},{"id":"2203.07808","title":"Interspace Pruning: Using Adaptive Filter Representations to Improve Training of Sparse CNNs","created":"2022-03-15","cited_by_count":16,"area":null},{"id":"2205.02343","title":"Convolutional and Residual Networks Provably Contain Lottery Tickets","created":"2022-05-04","cited_by_count":16,"area":null},{"id":"2405.15743","title":"Sparse maximal update parameterization: A holistic approach to sparse training dynamics","created":"2024-05-24","cited_by_count":16,"area":null},{"id":"2111.11153","title":"Plant 'n' Seek: Can You Find the Winning Ticket?","created":"2021-11-22","cited_by_count":13,"area":null},{"id":"2205.08099","title":"Dimensionality Reduced Training by Pruning and Freezing Parts of a Deep Neural Network, a Survey","created":"2022-05-17","cited_by_count":12,"area":null},{"id":"2403.18955","title":"Structurally Prune Anything: Any Architecture, Any Framework, Any Time","created":"2024-03-03","cited_by_count":8,"area":null},{"id":"2204.02965","title":"LilNetX: Lightweight Networks with EXtreme Model Compression and Structured Sparsification","created":"2022-04-06","cited_by_count":7,"area":null},{"id":"2107.12673","title":"COPS: Controlled Pruning Before Training Starts","created":"2021-07-27","cited_by_count":6,"area":null},{"id":"2403.07688","title":"Maxwell's Demon at Work: Efficient Pruning by Leveraging Saturation of Neurons","created":"2024-03-12","cited_by_count":6,"area":null},{"id":"2110.11150","title":"Lottery Tickets with Nonzero Biases","created":"2021-10-21","cited_by_count":4,"area":null},{"id":"2206.01627","title":"Pruning for Feature-Preserving Circuits in CNNs","created":"2022-06-03","cited_by_count":4,"area":null},{"id":"2310.13183","title":"Breaking through Deterministic Barriers: Randomized Pruning Mask Generation and Selection","created":"2023-10-19","cited_by_count":3,"area":null},{"id":"2110.15192","title":"RGP: Neural Network Pruning through Its Regular Graph Structure","created":"2021-10-28","cited_by_count":1,"area":null},{"id":"2207.04227","title":"On the Robustness and Anomaly Detection of Sparse Neural Networks","created":"2022-07-09","cited_by_count":1,"area":null},{"id":"2405.01306","title":"Graph is all you need? Lightweight data-agnostic neural architecture search without training","created":"2024-05-02","cited_by_count":1,"area":null},{"id":"2411.13545","title":"Pushing the Limits of Sparsity: A Bag of Tricks for Extreme Pruning","created":"2024-11-20","cited_by_count":1,"area":null},{"id":"2106.11542","title":"Connection Sensitivity Matters for Training-free DARTS: From Architecture-Level Scoring to Operation-Level Sensitivity Analysis","created":"2021-06-22","cited_by_count":0,"area":null},{"id":"2308.14605","title":"A Generalization of Continuous Relaxation in Structured Pruning","created":"2023-08-28","cited_by_count":0,"area":null},{"id":"2408.14757","title":"Learning effective pruning at initialization from iterative pruning","created":"2024-08-27","cited_by_count":0,"area":null},{"id":"2610.02524","title":"BaCP: Backbone Contrastive Pruning for Preserving Representations in Extremely Sparse Neural Networks","created":"2026-10-01","cited_by_count":0,"area":null}],"next_cursor":null}