{"total":37,"rows":[{"id":"2306.11695","title":"A Simple and Effective Pruning Approach for Large Language Models","created":"2023-06-20","cited_by_count":800,"area":null},{"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":"2306.15063","title":"Pretraining task diversity and the emergence of non-Bayesian in-context learning for regression","created":"2023-06-26","cited_by_count":146,"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":"2408.11804","title":"Approaching Deep Learning through the Spectral Dynamics of Weights","created":"2024-08-21","cited_by_count":31,"area":null},{"id":"2403.04861","title":"A Survey of Lottery Ticket Hypothesis","created":"2024-03-07","cited_by_count":24,"area":null},{"id":"2210.09223","title":"CAP: Correlation-Aware Pruning for Highly-Accurate Sparse Vision Models","created":"2022-10-14","cited_by_count":20,"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":"2407.20584","title":"Pruning Large Language Models with Semi-Structural Adaptive Sparse Training","created":"2024-07-30","cited_by_count":20,"area":null},{"id":"2402.19262","title":"Masks, Signs, And Learning Rate Rewinding","created":"2024-02-29","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":"2404.06498","title":"Simultaneous linear connectivity of neural networks modulo permutation","created":"2024-04-09","cited_by_count":10,"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":"2504.12801","title":"Sign-In to the Lottery: Reparameterizing Sparse Training From Scratch","created":"2025-04-17","cited_by_count":6,"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":"2306.12190","title":"Quantifying lottery tickets under label noise: accuracy, calibration, and complexity","created":"2023-06-21","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":"2501.12486","title":"The Journey Matters: Average Parameter Count over Pre-training Unifies Sparse and Dense Scaling Laws","created":"2025-01-21","cited_by_count":2,"area":null},{"id":"2505.05143","title":"Sparse Training from Random Initialization: Aligning Lottery Ticket Masks using Weight Symmetry","created":"2025-05-08","cited_by_count":2,"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":"2308.03128","title":"Iterative Magnitude Pruning as a Renormalisation Group: A Study in The Context of The Lottery Ticket Hypothesis","created":"2023-08-06","cited_by_count":1,"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":"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":"2509.25996","title":"CAST: Continuous and Differentiable Semi-Structured Sparsity-Aware Training for Large Language Models","created":"2025-09-30","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":"2602.04832","title":"It's Not a Lottery, It's a Race: Understanding How Gradient Descent Adapts the Network's Capacity to the Task","created":"2026-02-04","cited_by_count":1,"area":null},{"id":"2403.15022","title":"Insights into the Lottery Ticket Hypothesis and Iterative Magnitude Pruning","created":"2024-03-22","cited_by_count":0,"area":null},{"id":"2406.06773","title":"Evaluating Zero-Shot Long-Context LLM Compression","created":"2024-06-10","cited_by_count":0,"area":null},{"id":"2504.21047","title":"Model Connectomes: A Generational Approach to Data-Efficient Language Models","created":"2025-04-29","cited_by_count":0,"area":null},{"id":"2509.11190","title":"Investigating the Lottery Ticket Hypothesis for Variational Quantum Circuits","created":"2025-09-14","cited_by_count":0,"area":null},{"id":"2512.11089","title":"TPV: Parameter Perturbations Through the Lens of Test Prediction Variance","created":"2025-12-11","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},{"id":"2606.19941","title":"Compositionality Emerges in a Narrow Depth-Connectivity Regime: Architecture Constraints and Solution Manifolds","created":"2026-06-18","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}