{"total":79,"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":"2310.05175","title":"Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsity","created":"2023-10-08","cited_by_count":165,"area":null},{"id":"2207.03620","title":"More ConvNets in the 2020s: Scaling up Kernels Beyond 51x51 using Sparsity","created":"2022-07-07","cited_by_count":142,"area":null},{"id":"2206.00187","title":"DisPFL: Towards Communication-Efficient Personalized Federated Learning via Decentralized Sparse Training","created":"2022-06-01","cited_by_count":74,"area":null},{"id":"2210.05177","title":"Make Sharpness-Aware Minimization Stronger: A Sparsified Perturbation Approach","created":"2022-10-11","cited_by_count":70,"area":null},{"id":"2210.08277","title":"Deep Differentiable Logic Gate Networks","created":"2022-10-15","cited_by_count":67,"area":null},{"id":"2411.04732","title":"Convolutional Differentiable Logic Gate Networks","created":"2024-11-07","cited_by_count":37,"area":null},{"id":"2412.13795","title":"Mix-LN: Unleashing the Power of Deeper Layers by Combining Pre-LN and Post-LN","created":"2024-12-18","cited_by_count":37,"area":null},{"id":"2410.10912","title":"AlphaPruning: Using Heavy-Tailed Self Regularization Theory for Improved Layer-wise Pruning of Large Language Models","created":"2024-10-14","cited_by_count":36,"area":null},{"id":"2505.12079","title":"SepPrune: Structured Pruning for Efficient Deep Speech Separation","created":"2025-05-17","cited_by_count":31,"area":null},{"id":"2303.10464","title":"SPDF: Sparse Pre-training and Dense Fine-tuning for Large Language Models","created":"2023-03-18","cited_by_count":28,"area":null},{"id":"2501.06842","title":"SPAM: Spike-Aware Adam with Momentum Reset for Stable LLM Training","created":"2025-01-12","cited_by_count":28,"area":null},{"id":"2303.02141","title":"Sparsity May Cry: Let Us Fail (Current) Sparse Neural Networks Together!","created":"2023-03-03","cited_by_count":27,"area":null},{"id":"2401.01814","title":"Large Language Models Relearn Removed Concepts","created":"2024-01-03","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":"2602.10825","title":"Flow caching for autoregressive video generation","created":"2026-02-11","cited_by_count":25,"area":null},{"id":"2312.01397","title":"Visual Prompting Upgrades Neural Network Sparsification: A Data-Model Perspective","created":"2023-12-03","cited_by_count":23,"area":null},{"id":"2410.07461","title":"Is C4 Dataset Optimal for Pruning? An Investigation of Calibration Data for LLM Pruning","created":"2024-10-09","cited_by_count":20,"area":null},{"id":"2305.19454","title":"Dynamic Sparsity Is Channel-Level Sparsity Learner","created":"2023-05-30","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":"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":"2402.19262","title":"Masks, Signs, And Learning Rate Rewinding","created":"2024-02-29","cited_by_count":15,"area":null},{"id":"2403.15173","title":"LSK3DNet: Towards Effective and Efficient 3D Perception with Large Sparse Kernels","created":"2024-03-22","cited_by_count":15,"area":null},{"id":"2408.09966","title":"Mask in the Mirror: Implicit Sparsification","created":"2024-08-19","cited_by_count":14,"area":null},{"id":"2310.02277","title":"Junk DNA Hypothesis: Pruning Small Pre-Trained Weights Irreversibly and Monotonically Impairs \"Difficult\" Downstream Tasks in LLMs","created":"2023-09-29","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":"2310.16391","title":"Winning Prize Comes from Losing Tickets: Improve Invariant Learning by Exploring Variant Parameters for Out-of-Distribution Generalization","created":"2023-10-25","cited_by_count":12,"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":"2203.14328","title":"On the Neural Tangent Kernel Analysis of Randomly Pruned Neural Networks","created":"2022-03-27","cited_by_count":9,"area":null},{"id":"2308.00473","title":"Is Last Layer Re-Training Truly Sufficient for Robustness to Spurious Correlations?","created":"2023-08-01","cited_by_count":9,"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":"2505.01731","title":"Efficient Shapley Value-based Non-Uniform Pruning of Large Language Models","created":"2025-05-03","cited_by_count":8,"area":null},{"id":"2203.02770","title":"Don't Be So Dense: Sparse-to-Sparse GAN Training Without Sacrificing Performance","created":"2022-03-05","cited_by_count":7,"area":null},{"id":"2211.15215","title":"Progressive Learning without Forgetting","created":"2022-11-28","cited_by_count":7,"area":null},{"id":"2307.04552","title":"SparseVSR: Lightweight and Noise Robust Visual Speech Recognition","created":"2023-07-10","cited_by_count":7,"area":null},{"id":"2205.15322","title":"Superposing Many Tickets into One: A Performance Booster for Sparse Neural Network Training","created":"2022-05-30","cited_by_count":6,"area":null},{"id":"2302.08185","title":"WHC: Weighted Hybrid Criterion for Filter Pruning on Convolutional Neural Networks","created":"2023-02-16","cited_by_count":6,"area":null},{"id":"2409.18850","title":"Two Sparse Matrices are Better than One: Sparsifying Neural Networks with Double Sparse Factorization","created":"2024-09-27","cited_by_count":6,"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":"2505.23807","title":"DLP: Dynamic Layerwise Pruning in Large Language Models","created":"2025-05-27","cited_by_count":6,"area":null},{"id":"2510.15655","title":"WARP-LUTs -- Walsh-Assisted Relaxation for Probabilistic Look Up Tables","created":"2025-10-17","cited_by_count":6,"area":null},{"id":"2306.17504","title":"Systematic Investigation of Sparse Perturbed Sharpness-Aware Minimization Optimizer","created":"2023-06-30","cited_by_count":4,"area":null},{"id":"2312.08851","title":"Achelous++: Power-Oriented Water-Surface Panoptic Perception Framework on Edge Devices based on Vision-Radar Fusion and Pruning of Heterogeneous Modalities","created":"2023-12-14","cited_by_count":4,"area":null},{"id":"2210.16169","title":"LOFT: Finding Lottery Tickets through Filter-wise Training","created":"2022-10-28","cited_by_count":3,"area":null},{"id":"2301.00335","title":"Pruning Before Training May Improve Generalization, Provably","created":"2023-01-01","cited_by_count":3,"area":null},{"id":"2301.10835","title":"When Layers Play the Lottery, all Tickets Win at Initialization","created":"2023-01-25","cited_by_count":3,"area":null},{"id":"2306.01470","title":"Understanding MLP-Mixer as a Wide and Sparse MLP","created":"2023-06-02","cited_by_count":3,"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":"2403.14684","title":"Self-Regulated Neurogenesis for Online Data-Incremental Learning","created":"2024-03-13","cited_by_count":3,"area":null},{"id":"2406.01755","title":"Sparser, Better, Deeper, Stronger: Improving Sparse Training with Exact Orthogonal Initialization","created":"2024-06-03","cited_by_count":3,"area":null},{"id":"2301.00327","title":"Neural Networks with Sparse Activation Induced by Large Bias: Tighter Analysis with Bias-Generalized NTK","created":"2023-01-01","cited_by_count":2,"area":null},{"id":"2303.15479","title":"Exploring the Performance of Pruning Methods in Neural Networks: An Empirical Study of the Lottery Ticket Hypothesis","created":"2023-03-26","cited_by_count":2,"area":null},{"id":"2305.16886","title":"Understanding Sparse Neural Networks from their Topology via Multipartite Graph Representations","created":"2023-05-26","cited_by_count":2,"area":null},{"id":"2411.07066","title":"Zeroth-Order Adaptive Neuron Alignment Based Pruning without Re-Training","created":"2024-11-11","cited_by_count":2,"area":null},{"id":"2506.16787","title":"Revisiting LoRA through the Lens of Parameter Redundancy: Spectral Encoding Helps","created":"2025-06-20","cited_by_count":2,"area":null},{"id":"2602.03527","title":"WARP Logic Neural Networks","created":"2026-02-03","cited_by_count":2,"area":null},{"id":"2603.02227","title":"Routing Absorption in Sparse Attention: Why Random Gates Are Hard to Beat","created":"2026-02-11","cited_by_count":2,"area":null},{"id":"2401.08830","title":"Stochastic Subnetwork Annealing: A Regularization Technique for Fine Tuning Pruned Subnetworks","created":"2024-01-16","cited_by_count":1,"area":null},{"id":"2403.20047","title":"Embracing Unknown Step by Step: Towards Reliable Sparse Training in Real World","created":"2024-03-29","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":"2408.02301","title":"Network Fission Ensembles for Low-Cost Self-Ensembles","created":"2024-08-05","cited_by_count":1,"area":null},{"id":"2408.03046","title":"Comb, Prune, Distill: Towards Unified Pruning for Vision Model Compression","created":"2024-08-06","cited_by_count":1,"area":null},{"id":"2511.03983","title":"TwIST: Rigging the Lottery in Transformers with Independent Subnetwork Training","created":"2025-11-06","cited_by_count":1,"area":null},{"id":"2512.06288","title":"Theoretical Compression Bounds for Wide Multilayer Perceptrons","created":"2025-12-06","cited_by_count":1,"area":null},{"id":"2302.05832","title":"Sparse Mutation Decompositions: Fine Tuning Deep Neural Networks with Subspace Evolution","created":"2023-02-12","cited_by_count":0,"area":null},{"id":"2304.06840","title":"Structured Pruning for Multi-Task Deep Neural Networks","created":"2023-04-13","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":"2308.09955","title":"To prune or not to prune : A chaos-causality approach to principled pruning of dense neural networks","created":"2023-08-19","cited_by_count":0,"area":null},{"id":"2403.00952","title":"MediSwift: Efficient Sparse Pre-trained Biomedical Language Models","created":"2024-03-01","cited_by_count":0,"area":null},{"id":"2404.06230","title":"Aggressive or Imperceptible, or Both: Network Pruning Assisted Hybrid Byzantines in Federated Learning","created":"2024-04-09","cited_by_count":0,"area":null},{"id":"2407.04075","title":"Sparsest Models Elude Pruning: An Expos\\'e of Pruning's Current Capabilities","created":"2024-07-04","cited_by_count":0,"area":null},{"id":"2407.17029","title":"Accurate and Efficient Fine-Tuning of Quantized Large Language Models Through Optimal Balance","created":"2024-07-24","cited_by_count":0,"area":null},{"id":"2407.17412","title":"(PASS) Visual Prompt Locates Good Structure Sparsity through a Recurrent HyperNetwork","created":"2024-07-24","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":"2505.17909","title":"NeuroTrails: Training with Dynamic Sparse Heads as the Key to Effective Ensembling","created":"2025-05-23","cited_by_count":0,"area":null},{"id":"2512.22495","title":"The Quest for Winning Tickets in Low-Rank Adapters","created":"2025-12-27","cited_by_count":0,"area":null},{"id":"2602.06675","title":"Pruning at Initialisation through the lens of Graphon Limit: Convergence, Expressivity, and Generalisation","created":"2026-02-06","cited_by_count":0,"area":null},{"id":"2602.10754","title":"Exploring the impact of adaptive rewiring in Graph Neural Networks","created":"2026-02-11","cited_by_count":0,"area":null}],"next_cursor":null}