{"total":33,"rows":[{"id":"2406.02924","title":"Pruner-Zero: Evolving Symbolic Pruning Metric from scratch for Large Language Models","created":"2024-06-05","cited_by_count":40,"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":"2210.02412","title":"Why Random Pruning Is All We Need to Start Sparse","created":"2022-10-05","cited_by_count":26,"area":null},{"id":"2305.02538","title":"Cuttlefish: Low-Rank Model Training without All the Tuning","created":"2023-05-04","cited_by_count":25,"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":"2408.09966","title":"Mask in the Mirror: Implicit Sparsification","created":"2024-08-19","cited_by_count":14,"area":null},{"id":"2411.07837","title":"FRUGAL: Memory-Efficient Optimization by Reducing State Overhead for Scalable Training","created":"2024-11-12","cited_by_count":10,"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":"2306.05857","title":"How Sparse Can We Prune A Deep Network: A Fundamental Limit Perspective","created":"2023-06-09","cited_by_count":9,"area":null},{"id":"2308.14929","title":"Maestro: Uncovering Low-Rank Structures via Trainable Decomposition","created":"2023-08-28","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":"2406.04934","title":"Optimal Recurrent Network Topologies for Dynamical Systems Reconstruction","created":"2024-06-07","cited_by_count":8,"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":"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":"2406.08804","title":"DIET: Customized Slimming for Incompatible Networks in Sequential Recommendation","created":"2024-06-13","cited_by_count":3,"area":null},{"id":"2501.02837","title":"Forward Once for All: Structural Parameterized Adaptation for Efficient Cloud-coordinated On-device Recommendation","created":"2025-01-06","cited_by_count":3,"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":"2305.17559","title":"Pruning at Initialization -- A Sketching Perspective","created":"2023-05-27","cited_by_count":2,"area":null},{"id":"2312.03236","title":"Multicoated and Folded Graph Neural Networks with Strong Lottery Tickets","created":"2023-12-06","cited_by_count":2,"area":null},{"id":"2406.05288","title":"Optimal Eye Surgeon: Finding Image Priors through Sparse Generators at Initialization","created":"2024-06-07","cited_by_count":2,"area":null},{"id":"2407.17437","title":"Nerva: a Truly Sparse Implementation of Neural Networks","created":"2024-07-24","cited_by_count":2,"area":null},{"id":"2601.09176","title":"$D^2Prune$: Sparsifying Large Language Models via Dual Taylor Expansion and Attention Distribution Awareness","created":"2026-01-14","cited_by_count":2,"area":null},{"id":"2403.04805","title":"Pruning neural network models for gene regulatory dynamics using data and domain knowledge","created":"2024-03-05","cited_by_count":1,"area":null},{"id":"2502.11450","title":"What Scalable Second-Order Information Knows for Pruning at Initialization","created":"2025-02-17","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":"2601.22141","title":"Routing the Lottery: Adaptive Subnetworks for Heterogeneous Data","created":"2026-01-29","cited_by_count":1,"area":null},{"id":"2312.00660","title":"Resource-constrained knowledge diffusion processes inspired by human peer learning","created":"2023-12-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":"2512.07142","title":"Winning the Lottery by Preserving Network Training Dynamics with Concrete Ticket Search","created":"2025-12-08","cited_by_count":0,"area":null},{"id":"2603.08914","title":"Uncovering a Winning Lottery Ticket with Continuously Relaxed Bernoulli Gates","created":"2026-03-09","cited_by_count":0,"area":null},{"id":"2605.17704","title":"Toy Combinatorial Interpretability Models Reveal Lottery Tickets in Early Feature Space","created":"2026-05-18","cited_by_count":0,"area":null}],"next_cursor":null}