{"total":24,"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":"2310.01382","title":"Compressing LLMs: The Truth is Rarely Pure and Never Simple","created":"2023-10-02","cited_by_count":62,"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":"2403.15447","title":"Decoding Compressed Trust: Scrutinizing the Trustworthiness of Efficient LLMs Under Compression","created":"2024-03-18","cited_by_count":57,"area":null},{"id":"2306.03805","title":"The Emergence of Essential Sparsity in Large Pre-trained Models: The Weights that Matter","created":"2023-06-06","cited_by_count":42,"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":"2312.01397","title":"Visual Prompting Upgrades Neural Network Sparsification: A Data-Model Perspective","created":"2023-12-03","cited_by_count":23,"area":null},{"id":"2306.10460","title":"Instant Soup: Cheap Pruning Ensembles in A Single Pass Can Draw Lottery Tickets from Large Models","created":"2023-06-18","cited_by_count":20,"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":"2502.15618","title":"Probe Pruning: Accelerating LLMs through Dynamic Pruning via Model-Probing","created":"2025-02-21","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":"2312.15033","title":"Sparsity-Guided Holistic Explanation for LLMs with Interpretable Inference-Time Intervention","created":"2023-12-22","cited_by_count":12,"area":null},{"id":"2311.00447","title":"On the Opportunities of Green Computing: A Survey","created":"2023-11-01","cited_by_count":7,"area":null},{"id":"2502.15975","title":"Sparsity May Be All You Need: Sparse Random Parameter Adaptation","created":"2025-02-21","cited_by_count":5,"area":null},{"id":"2412.02328","title":"Efficient Model Compression Techniques with FishLeg","created":"2024-12-03","cited_by_count":4,"area":null},{"id":"2411.03171","title":"Navigating Extremes: Dynamic Sparsity in Large Output Spaces","created":"2024-11-05","cited_by_count":3,"area":null},{"id":"2306.10466","title":"Graph Ladling: Shockingly Simple Parallel GNN Training without Intermediate Communication","created":"2023-06-18","cited_by_count":2,"area":null},{"id":"2312.13547","title":"How to Prune Your Language Model: Recovering Accuracy on the \"Sparsity May Cry'' Benchmark","created":"2023-12-21","cited_by_count":2,"area":null},{"id":"2409.09196","title":"Are Sparse Neural Networks Better Hard Sample Learners?","created":"2024-09-13","cited_by_count":1,"area":null},{"id":"2304.00114","title":"Dense Sparse Retrieval: Using Sparse Language Models for Inference Efficient Dense Retrieval","created":"2023-03-31","cited_by_count":0,"area":null},{"id":"2309.08171","title":"Unveiling Invariances via Neural Network Pruning","created":"2023-09-15","cited_by_count":0,"area":null},{"id":"2403.08265","title":"Random Search as a Baseline for Sparse Neural Network Architecture Search","created":"2024-03-13","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":"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}],"next_cursor":null}