{"total":40,"rows":[{"id":"2308.06767","title":"A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendations","created":"2023-08-13","cited_by_count":202,"area":null},{"id":"2110.14032","title":"MEST: Accurate and Fast Memory-Economic Sparse Training Framework on the Edge","created":"2021-10-26","cited_by_count":79,"area":null},{"id":"2310.02025","title":"DeepZero: Scaling up Zeroth-Order Optimization for Deep Model Training","created":"2023-10-03","cited_by_count":76,"area":null},{"id":"2210.04092","title":"Advancing Model Pruning via Bi-level Optimization","created":"2022-10-08","cited_by_count":56,"area":null},{"id":"2112.09824","title":"Federated Dynamic Sparse Training: Computing Less, Communicating Less, Yet Learning Better","created":"2021-12-18","cited_by_count":55,"area":null},{"id":"2308.00788","title":"An Introduction to Bi-level Optimization: Foundations and Applications in Signal Processing and Machine Learning","created":"2023-08-01","cited_by_count":41,"area":null},{"id":"2202.00155","title":"Fortuitous Forgetting in Connectionist Networks","created":"2022-02-01","cited_by_count":39,"area":null},{"id":"2203.15794","title":"CHEX: CHannel EXploration for CNN Model Compression","created":"2022-03-29","cited_by_count":36,"area":null},{"id":"2202.12002","title":"Rare Gems: Finding Lottery Tickets at Initialization","created":"2022-02-24","cited_by_count":34,"area":null},{"id":"2202.05239","title":"F8Net: Fixed-Point 8-bit Only Multiplication for Network Quantization","created":"2022-02-10","cited_by_count":28,"area":null},{"id":"2202.04736","title":"Coarsening the Granularity: Towards Structurally Sparse Lottery Tickets","created":"2022-02-09","cited_by_count":27,"area":null},{"id":"2210.02412","title":"Why Random Pruning Is All We Need to Start Sparse","created":"2022-10-05","cited_by_count":26,"area":null},{"id":"2302.02596","title":"Ten Lessons We Have Learned in the New \"Sparseland\": A Short Handbook for Sparse Neural Network Researchers","created":"2023-02-06","cited_by_count":25,"area":null},{"id":"2403.04861","title":"A Survey of Lottery Ticket Hypothesis","created":"2024-03-07","cited_by_count":24,"area":null},{"id":"2305.02190","title":"Rethinking Graph Lottery Tickets: Graph Sparsity Matters","created":"2023-05-03","cited_by_count":23,"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":"2207.08629","title":"Comprehensive Graph Gradual Pruning for Sparse Training in Graph Neural Networks","created":"2022-07-18","cited_by_count":18,"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":"2402.19262","title":"Masks, Signs, And Learning Rate Rewinding","created":"2024-02-29","cited_by_count":15,"area":null},{"id":"2308.10051","title":"The Snowflake Hypothesis: Training Deep GNN with One Node One Receptive field","created":"2023-08-19","cited_by_count":11,"area":null},{"id":"2402.01242","title":"Two Heads Are Better Than One: Boosting Graph Sparse Training via Semantic and Topological Awareness","created":"2024-02-02","cited_by_count":10,"area":null},{"id":"2211.01484","title":"Data Level Lottery Ticket Hypothesis for Vision Transformers","created":"2022-11-02","cited_by_count":7,"area":null},{"id":"2403.02914","title":"DynST: Dynamic Sparse Training for Resource-Constrained Spatio-Temporal Forecasting","created":"2024-03-05","cited_by_count":7,"area":null},{"id":"2504.12801","title":"Sign-In to the Lottery: Reparameterizing Sparse Training From Scratch","created":"2025-04-17","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":"2212.08311","title":"Can We Find Strong Lottery Tickets in Generative Models?","created":"2022-12-16","cited_by_count":4,"area":null},{"id":"2310.19958","title":"PriPrune: Quantifying and Preserving Privacy in Pruned Federated Learning","created":"2023-10-30","cited_by_count":4,"area":null},{"id":"2212.12770","title":"COLT: Cyclic Overlapping Lottery Tickets for Faster Pruning of Convolutional Neural Networks","created":"2022-12-24","cited_by_count":3,"area":null},{"id":"2506.23286","title":"Not All Explanations for Deep Learning Phenomena Are Equally Valuable","created":"2025-06-29","cited_by_count":3,"area":null},{"id":"2305.14852","title":"Sparse Weight Averaging with Multiple Particles for Iterative Magnitude Pruning","created":"2023-05-24","cited_by_count":2,"area":null},{"id":"2303.07474","title":"Can Adversarial Examples Be Parsed to Reveal Victim Model Information?","created":"2023-03-13","cited_by_count":1,"area":null},{"id":"2307.03364","title":"Distilled Pruning: Using Synthetic Data to Win the Lottery","created":"2023-07-07","cited_by_count":1,"area":null},{"id":"2406.02773","title":"Cyclic Sparse Training: Is it Enough?","created":"2024-06-04","cited_by_count":1,"area":null},{"id":"2504.05357","title":"Find A Winning Sign: Sign Is All We Need to Win the Lottery","created":"2025-04-07","cited_by_count":1,"area":null},{"id":"2111.10320","title":"Toward Compact Parameter Representations for Architecture-Agnostic Neural Network Compression","created":"2021-11-19","cited_by_count":0,"area":null},{"id":"2309.08171","title":"Unveiling Invariances via Neural Network Pruning","created":"2023-09-15","cited_by_count":0,"area":null},{"id":"2407.02805","title":"Efficient DNN-Powered Software with Fair Sparse Models","created":"2024-07-03","cited_by_count":0,"area":null},{"id":"2412.07605","title":"Fast Track to Winning Tickets: Repowering One-Shot Pruning for Graph Neural Networks","created":"2024-12-10","cited_by_count":0,"area":null},{"id":"2504.05349","title":"Hyperflux: Pruning Reveals Importance","created":"2025-04-06","cited_by_count":0,"area":null},{"id":"2609.32615","title":"Stabilizing the Dynamic Low-Rank Training","created":"2026-09-26","cited_by_count":0,"area":null}],"next_cursor":null}