{"total":200,"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":"2204.00408","title":"Structured Pruning Learns Compact and Accurate Models","created":"2022-04-01","cited_by_count":170,"area":null},{"id":"2110.07560","title":"Composable Sparse Fine-Tuning for Cross-Lingual Transfer","created":"2021-10-14","cited_by_count":144,"area":null},{"id":"2302.11529","title":"Modular Deep Learning","created":"2023-02-22","cited_by_count":83,"area":null},{"id":"2106.03517","title":"Top-KAST: Top-K Always Sparse Training","created":"2021-06-07","cited_by_count":79,"area":null},{"id":"2106.02890","title":"Can Subnetwork Structure be the Key to Out-of-Distribution Generalization?","created":"2021-06-05","cited_by_count":75,"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":"2310.08915","title":"Dynamic Sparse No Training: Training-Free Fine-tuning for Sparse LLMs","created":"2023-10-13","cited_by_count":61,"area":null},{"id":"2105.12002","title":"Super Tickets in Pre-Trained Language Models: From Model Compression to Improving Generalization","created":"2021-05-25","cited_by_count":56,"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":"2107.00166","title":"Sanity Checks for Lottery Tickets: Does Your Winning Ticket Really Win the Jackpot?","created":"2021-07-01","cited_by_count":52,"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":"2106.03225","title":"Efficient Lottery Ticket Finding: Less Data is More","created":"2021-06-06","cited_by_count":44,"area":null},{"id":"2106.03795","title":"Heavy Tails in SGD and Compressibility of Overparametrized Neural Networks","created":"2021-06-07","cited_by_count":44,"area":null},{"id":"2301.10884","title":"Break It Down: Evidence for Structural Compositionality in Neural Networks","created":"2023-01-26","cited_by_count":44,"area":null},{"id":"2103.06460","title":"Recent Advances on Neural Network Pruning at Initialization","created":"2021-03-11","cited_by_count":41,"area":null},{"id":"2203.04466","title":"The Combinatorial Brain Surgeon: Pruning Weights That Cancel One Another in Neural Networks","created":"2022-03-09","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":"2210.03044","title":"Unmasking the Lottery Ticket Hypothesis: What's Encoded in a Winning Ticket's Mask?","created":"2022-10-06","cited_by_count":38,"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":"2209.15328","title":"Sparse Random Networks for Communication-Efficient Federated Learning","created":"2022-09-30","cited_by_count":32,"area":null},{"id":"2102.11289","title":"Ps and Qs: Quantization-aware pruning for efficient low latency neural network inference","created":"2021-02-22","cited_by_count":31,"area":null},{"id":"2101.09048","title":"Selfish Sparse RNN Training","created":"2021-01-22","cited_by_count":26,"area":null},{"id":"2207.01382","title":"Exploring Lottery Ticket Hypothesis in Spiking Neural Networks","created":"2022-07-04","cited_by_count":26,"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":"2403.04861","title":"A Survey of Lottery Ticket Hypothesis","created":"2024-03-07","cited_by_count":24,"area":null},{"id":"2103.16547","title":"The Elastic Lottery Ticket Hypothesis","created":"2021-03-30","cited_by_count":23,"area":null},{"id":"2305.02190","title":"Rethinking Graph Lottery Tickets: Graph Sparsity Matters","created":"2023-05-03","cited_by_count":23,"area":null},{"id":"2212.11110","title":"Lifelong Reinforcement Learning with Modulating Masks","created":"2022-12-21","cited_by_count":22,"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":"2106.09269","title":"Pruning Randomly Initialized Neural Networks with Iterative Randomization","created":"2021-06-17","cited_by_count":20,"area":null},{"id":"2103.16701","title":"Charged particle tracking via edge-classifying interaction networks","created":"2021-03-30","cited_by_count":19,"area":null},{"id":"2103.05152","title":"Knowledge Evolution in Neural Networks","created":"2021-03-09","cited_by_count":18,"area":null},{"id":"2205.15171","title":"Modular and On-demand Bias Mitigation with Attribute-Removal Subnetworks","created":"2022-05-30","cited_by_count":18,"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":"2305.17682","title":"One Network, Many Masks: Towards More Parameter-Efficient Transfer Learning","created":"2023-05-28","cited_by_count":18,"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":"2410.04368","title":"Algorithmic Capabilities of Random Transformers","created":"2024-10-06","cited_by_count":17,"area":null},{"id":"2102.01732","title":"Truly Sparse Neural Networks at Scale","created":"2021-02-02","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":"2105.10065","title":"A Probabilistic Approach to Neural Network Pruning","created":"2021-05-20","cited_by_count":15,"area":null},{"id":"2402.19262","title":"Masks, Signs, And Learning Rate Rewinding","created":"2024-02-29","cited_by_count":15,"area":null},{"id":"2110.05667","title":"Why Lottery Ticket Wins? A Theoretical Perspective of Sample Complexity on Pruned Neural Networks","created":"2021-10-12","cited_by_count":14,"area":null},{"id":"2203.02026","title":"Provable and Efficient Continual Representation Learning","created":"2022-03-03","cited_by_count":14,"area":null},{"id":"2206.04662","title":"DiSparse: Disentangled Sparsification for Multitask Model Compression","created":"2022-06-09","cited_by_count":14,"area":null},{"id":"2211.15335","title":"You Can Have Better Graph Neural Networks by Not Training Weights at All: Finding Untrained GNNs Tickets","created":"2022-11-28","cited_by_count":14,"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":"2202.02877","title":"HARFE: Hard-Ridge Random Feature Expansion","created":"2022-02-06","cited_by_count":12,"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":"2305.11203","title":"PDP: Parameter-free Differentiable Pruning is All You Need","created":"2023-05-18","cited_by_count":12,"area":null},{"id":"2402.01876","title":"Ultrafast jet classification on FPGAs for the HL-LHC","created":"2024-02-02","cited_by_count":12,"area":null},{"id":"2105.03343","title":"Adapting by Pruning: A Case Study on BERT","created":"2021-05-07","cited_by_count":11,"area":null},{"id":"2106.06955","title":"Towards Understanding Iterative Magnitude Pruning: Why Lottery Tickets Win","created":"2021-06-13","cited_by_count":11,"area":null},{"id":"2208.10842","title":"Lottery Pools: Winning More by Interpolating Tickets without Increasing Training or Inference Cost","created":"2022-08-23","cited_by_count":11,"area":null},{"id":"2104.08700","title":"Lottery Jackpots Exist in Pre-trained Models","created":"2021-04-18","cited_by_count":10,"area":null},{"id":"2104.12501","title":"Communication-Efficient and Personalized Federated Lottery Ticket Learning","created":"2021-04-26","cited_by_count":10,"area":null},{"id":"2112.13208","title":"Neural Network Module Decomposition and Recomposition","created":"2021-12-25","cited_by_count":10,"area":null},{"id":"2305.10997","title":"Sharing Lifelong Reinforcement Learning Knowledge via Modulating Masks","created":"2023-05-18","cited_by_count":10,"area":null},{"id":"2112.03406","title":"Equal Bits: Enforcing Equally Distributed Binary Network Weights","created":"2021-12-02","cited_by_count":9,"area":null},{"id":"2112.04002","title":"SHRIMP: Sparser Random Feature Models via Iterative Magnitude Pruning","created":"2021-12-07","cited_by_count":9,"area":null},{"id":"2205.07320","title":"Analyzing Lottery Ticket Hypothesis from PAC-Bayesian Theory Perspective","created":"2022-05-15","cited_by_count":9,"area":null},{"id":"2210.06699","title":"Parameter-Efficient Masking Networks","created":"2022-10-13","cited_by_count":9,"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":"2307.16879","title":"Image Synthesis under Limited Data: A Survey and Taxonomy","created":"2023-07-31","cited_by_count":9,"area":null},{"id":"2406.00431","title":"SpaFL: Communication-Efficient Federated Learning with Sparse Models and Low computational Overhead","created":"2024-06-01","cited_by_count":9,"area":null},{"id":"2110.04350","title":"FRL: Federated Rank Learning","created":"2021-10-08","cited_by_count":8,"area":null},{"id":"2303.11525","title":"Sparse-IFT: Sparse Iso-FLOP Transformations for Maximizing Training Efficiency","created":"2023-03-21","cited_by_count":8,"area":null},{"id":"2309.14518","title":"Detach-ROCKET: Sequential feature selection for time series classification with random convolutional kernels","created":"2023-09-25","cited_by_count":8,"area":null},{"id":"2402.01089","title":"No Free Prune: Information-Theoretic Barriers to Pruning at Initialization","created":"2024-02-02","cited_by_count":8,"area":null},{"id":"2112.00725","title":"The Augmented Image Prior: Distilling 1000 Classes by Extrapolating from a Single Image","created":"2021-12-01","cited_by_count":7,"area":null},{"id":"2201.13361","title":"Signing the Supermask: Keep, Hide, Invert","created":"2022-01-31","cited_by_count":7,"area":null},{"id":"2207.08148","title":"Improving Deep Neural Network Random Initialization Through Neuronal Rewiring","created":"2022-07-17","cited_by_count":7,"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":"2402.15978","title":"Shaving Weights with Occam's Razor: Bayesian Sparsification for Neural Networks Using the Marginal Likelihood","created":"2024-02-25","cited_by_count":7,"area":null},{"id":"2405.17420","title":"Survival of the Fittest Representation: A Case Study with Modular Addition","created":"2024-05-27","cited_by_count":7,"area":null},{"id":"2206.04385","title":"HideNseek: Federated Lottery Ticket via Server-side Pruning and Sign Supermask","created":"2022-06-09","cited_by_count":6,"area":null},{"id":"2304.04858","title":"Simulated Annealing in Early Layers Leads to Better Generalization","created":"2023-04-10","cited_by_count":6,"area":null},{"id":"2101.06475","title":"Slot Machines: Discovering Winning Combinations of Random Weights in Neural Networks","created":"2021-01-16","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":"2202.01341","title":"Robust Binary Models by Pruning Randomly-initialized Networks","created":"2022-02-03","cited_by_count":5,"area":null},{"id":"2210.10209","title":"Exclusive Supermask Subnetwork Training for Continual Learning","created":"2022-10-18","cited_by_count":5,"area":null},{"id":"2301.11936","title":"Quantum Ridgelet Transform: Winning Lottery Ticket of Neural Networks with Quantum Computation","created":"2023-01-27","cited_by_count":5,"area":null},{"id":"2302.05045","title":"Exploiting Sparsity in Pruned Neural Networks to Optimize Large Model Training","created":"2023-02-10","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":"2505.10679","title":"Are Spatial-Temporal Graph Convolution Networks for Human Action Recognition Over-Parameterized?","created":"2025-05-15","cited_by_count":5,"area":null},{"id":"2106.14126","title":"AdaptCL: Efficient Collaborative Learning with Dynamic and Adaptive Pruning","created":"2021-06-27","cited_by_count":4,"area":null},{"id":"2107.01461","title":"A Lottery Ticket Hypothesis Framework for Low-Complexity Device-Robust Neural Acoustic Scene Classification","created":"2021-07-03","cited_by_count":4,"area":null},{"id":"2108.00259","title":"How much pre-training is enough to discover a good subnetwork?","created":"2021-07-31","cited_by_count":4,"area":null},{"id":"2110.08996","title":"Finding Everything within Random Binary Networks","created":"2021-10-18","cited_by_count":4,"area":null},{"id":"2110.11150","title":"Lottery Tickets with Nonzero Biases","created":"2021-10-21","cited_by_count":4,"area":null},{"id":"2205.15619","title":"Meta-ticket: Finding optimal subnetworks for few-shot learning within randomly initialized neural networks","created":"2022-05-31","cited_by_count":4,"area":null},{"id":"2212.12653","title":"Hyperspherical Quantization: Toward Smaller and More Accurate Models","created":"2022-12-24","cited_by_count":4,"area":null},{"id":"2301.11360","title":"The Power of Linear Combinations: Learning with Random Convolutions","created":"2023-01-26","cited_by_count":4,"area":null},{"id":"2312.12484","title":"SkyMask: Attack-agnostic Robust Federated Learning with Fine-grained Learnable Masks","created":"2023-12-19","cited_by_count":4,"area":null},{"id":"2408.03220","title":"Masked Random Noise for Communication Efficient Federated Learning","created":"2024-08-06","cited_by_count":4,"area":null},{"id":"2103.07674","title":"Efficient Sparse Artificial Neural Networks","created":"2021-03-13","cited_by_count":3,"area":null},{"id":"2104.06153","title":"The Impact of Activation Sparsity on Overfitting in Convolutional Neural Networks","created":"2021-04-13","cited_by_count":3,"area":null},{"id":"2104.13343","title":"Sifting out the features by pruning: Are convolutional networks the winning lottery ticket of fully connected ones?","created":"2021-04-27","cited_by_count":3,"area":null},{"id":"2109.03939","title":"What's Hidden in a One-layer Randomly Weighted Transformer?","created":"2021-09-08","cited_by_count":3,"area":null}],"next_cursor":"100"}