{"total":53,"rows":[{"id":"2102.04010","title":"Learning N:M Fine-grained Structured Sparse Neural Networks From Scratch","created":"2021-02-08","cited_by_count":179,"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":"2106.03517","title":"Top-KAST: Top-K Always Sparse Training","created":"2021-06-07","cited_by_count":79,"area":null},{"id":"2206.10369","title":"The State of Sparse Training in Deep Reinforcement Learning","created":"2022-06-17","cited_by_count":61,"area":null},{"id":"2103.09377","title":"Multi-Prize Lottery Ticket Hypothesis: Finding Accurate Binary Neural Networks by Pruning A Randomly Weighted Network","created":"2021-03-17","cited_by_count":55,"area":null},{"id":"2105.01571","title":"Effective Sparsification of Neural Networks with Global Sparsity Constraint","created":"2021-05-03","cited_by_count":45,"area":null},{"id":"2203.16708","title":"Task Adaptive Parameter Sharing for Multi-Task Learning","created":"2022-03-30","cited_by_count":42,"area":null},{"id":"2302.14623","title":"Fast as CHITA: Neural Network Pruning with Combinatorial Optimization","created":"2023-02-28","cited_by_count":40,"area":null},{"id":"2209.07529","title":"On the Soft-Subnetwork for Few-shot Class Incremental Learning","created":"2022-09-15","cited_by_count":37,"area":null},{"id":"2106.09857","title":"Effective Model Sparsification by Scheduled Grow-and-Prune Methods","created":"2021-06-18","cited_by_count":26,"area":null},{"id":"2105.03193","title":"Network Pruning That Matters: A Case Study on Retraining Variants","created":"2021-05-07","cited_by_count":25,"area":null},{"id":"2306.16788","title":"Sparse Model Soups: A Recipe for Improved Pruning via Model Averaging","created":"2023-06-29","cited_by_count":20,"area":null},{"id":"2402.04744","title":"Progressive Gradient Flow for Robust N:M Sparsity Training in Transformers","created":"2024-02-07","cited_by_count":18,"area":null},{"id":"2108.08532","title":"An Information Theory-inspired Strategy for Automatic Network Pruning","created":"2021-08-19","cited_by_count":17,"area":null},{"id":"2210.01212","title":"spred: Solving $L_1$ Penalty with SGD","created":"2022-10-03","cited_by_count":17,"area":null},{"id":"2306.12230","title":"Fantastic Weights and How to Find Them: Where to Prune in Dynamic Sparse Training","created":"2023-06-21","cited_by_count":17,"area":null},{"id":"2105.14713","title":"1xN Pattern for Pruning Convolutional Neural Networks","created":"2021-05-31","cited_by_count":16,"area":null},{"id":"2205.11921","title":"Compression-aware Training of Neural Networks using Frank-Wolfe","created":"2022-05-24","cited_by_count":16,"area":null},{"id":"2203.02026","title":"Provable and Efficient Continual Representation Learning","created":"2022-03-03","cited_by_count":14,"area":null},{"id":"2209.14624","title":"Is Complexity Required for Neural Network Pruning? A Case Study on Global Magnitude Pruning","created":"2022-09-29","cited_by_count":13,"area":null},{"id":"2111.00843","title":"How I Learned to Stop Worrying and Love Retraining","created":"2021-11-01","cited_by_count":12,"area":null},{"id":"2211.02206","title":"Soft Masking for Cost-Constrained Channel Pruning","created":"2022-11-04","cited_by_count":12,"area":null},{"id":"2305.11203","title":"PDP: Parameter-free Differentiable Pruning is All You Need","created":"2023-05-18","cited_by_count":12,"area":null},{"id":"2209.07617","title":"Training Recipe for N:M Structured Sparsity with Decaying Pruning Mask","created":"2022-09-15","cited_by_count":11,"area":null},{"id":"2403.07094","title":"FALCON: FLOP-Aware Combinatorial Optimization for Neural Network Pruning","created":"2024-03-11","cited_by_count":11,"area":null},{"id":"2212.01076","title":"Are Straight-Through gradients and Soft-Thresholding all you need for Sparse Training?","created":"2022-12-02","cited_by_count":9,"area":null},{"id":"2106.01487","title":"LLC: Accurate, Multi-purpose Learnt Low-dimensional Binary Codes","created":"2021-06-02","cited_by_count":7,"area":null},{"id":"2202.01290","title":"Cyclical Pruning for Sparse Neural Networks","created":"2022-02-02","cited_by_count":6,"area":null},{"id":"2105.04885","title":"Graph-based Neural Architecture Search with Operation Embeddings","created":"2021-05-11","cited_by_count":5,"area":null},{"id":"2201.12826","title":"OptG: Optimizing Gradient-driven Criteria in Network Sparsity","created":"2022-01-30","cited_by_count":5,"area":null},{"id":"2303.14962","title":"Forget-free Continual Learning with Soft-Winning SubNetworks","created":"2023-03-27","cited_by_count":5,"area":null},{"id":"2306.05056","title":"Magnitude Attention-based Dynamic Pruning","created":"2023-06-08","cited_by_count":5,"area":null},{"id":"2205.11786","title":"Transition to Linearity of General Neural Networks with Directed Acyclic Graph Architecture","created":"2022-05-24","cited_by_count":4,"area":null},{"id":"2105.12920","title":"Search Spaces for Neural Model Training","created":"2021-05-27","cited_by_count":3,"area":null},{"id":"2106.15021","title":"How to Reach Real-Time AI on Consumer Devices? Solutions for Programmable and Custom Architectures","created":"2021-06-21","cited_by_count":2,"area":null},{"id":"2304.06941","title":"AUTOSPARSE: Towards Automated Sparse Training of Deep Neural Networks","created":"2023-04-14","cited_by_count":2,"area":null},{"id":"2306.06852","title":"Rethink DARTS Search Space and Renovate a New Benchmark","created":"2023-06-12","cited_by_count":2,"area":null},{"id":"2405.06038","title":"From Algorithm to Hardware: A Survey on Efficient and Safe Deployment of Deep Neural Networks","created":"2024-05-09","cited_by_count":2,"area":null},{"id":"2409.07577","title":"Self-Masking Networks for Unsupervised Adaptation","created":"2024-09-11","cited_by_count":2,"area":null},{"id":"2302.05984","title":"Quantum Neuron Selection: Finding High Performing Subnetworks With Quantum Algorithms","created":"2023-02-12","cited_by_count":1,"area":null},{"id":"2302.10798","title":"Learning a Consensus Sub-Network with Polarization Regularization and One Pass Training","created":"2023-02-17","cited_by_count":1,"area":null},{"id":"2306.05612","title":"Spatial Re-parameterization for N:M Sparsity","created":"2023-06-09","cited_by_count":1,"area":null},{"id":"2310.02448","title":"Feather: An Elegant Solution to Effective DNN Sparsification","created":"2023-10-03","cited_by_count":1,"area":null},{"id":"2403.19969","title":"Separate, Dynamic and Differentiable (SMART) Pruner for Block/Output Channel Pruning on Computer Vision Tasks","created":"2024-03-29","cited_by_count":1,"area":null},{"id":"2502.03658","title":"Advancing Weight and Channel Sparsification with Enhanced Saliency","created":"2025-02-05","cited_by_count":1,"area":null},{"id":"2110.05954","title":"Mining the Weights Knowledge for Optimizing Neural Network Structures","created":"2021-10-11","cited_by_count":0,"area":null},{"id":"2209.06932","title":"Optimizing Connectivity through Network Gradients for Restricted Boltzmann Machines","created":"2022-09-14","cited_by_count":0,"area":null},{"id":"2307.07389","title":"Learning Sparse Neural Networks with Identity Layers","created":"2023-07-14","cited_by_count":0,"area":null},{"id":"2312.07061","title":"MaxQ: Multi-Axis Query for N:M Sparsity Network","created":"2023-12-12","cited_by_count":0,"area":null},{"id":"2404.17152","title":"CSCO: Connectivity Search of Convolutional Operators","created":"2024-04-26","cited_by_count":0,"area":null},{"id":"2410.12927","title":"Deep Model Merging: The Sister of Neural Network Interpretability -- A Survey","created":"2024-10-16","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":"2508.08877","title":"Towards Scalable Lottery Ticket Networks using Genetic Algorithms","created":"2025-08-12","cited_by_count":0,"area":null}],"next_cursor":null}