{"list":"other","total":65,"rows":[{"id":"2005.14165","title":"Language Models are Few-Shot Learners","created":"2020-05-28","cited_by_count":32419},{"id":"2303.08774","title":"GPT-4 Technical Report","created":"2023-03-15","cited_by_count":18396},{"id":"1707.06347","title":"Proximal Policy Optimization Algorithms","created":"2017-07-20","cited_by_count":15215},{"id":"1910.10683","title":"Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer","created":"2019-10-23","cited_by_count":14599},{"id":"2302.13971","title":"LLaMA: Open and Efficient Foundation Language Models","created":"2023-02-27","cited_by_count":14132},{"id":"2307.09288","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","created":"2023-07-18","cited_by_count":13028},{"id":"2009.03300","title":"Measuring Massive Multitask Language Understanding","created":"2020-09-07","cited_by_count":7963},{"id":"1803.05457","title":"Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challenge","created":"2018-03-14","cited_by_count":4886},{"id":"1905.07830","title":"HellaSwag: Can a Machine Really Finish Your Sentence?","created":"2019-05-19","cited_by_count":4100},{"id":"2310.06825","title":"Mistral 7B","created":"2023-10-10","cited_by_count":3164},{"id":"1609.07843","title":"Pointer Sentinel Mixture Models","created":"2016-09-26","cited_by_count":3096},{"id":"1911.11641","title":"PIQA: Reasoning about Physical Commonsense in Natural Language","created":"2019-11-26","cited_by_count":2883},{"id":"1510.00149","title":"Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Coding","created":"2015-10-01","cited_by_count":2329},{"id":"1803.03635","title":"The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networks","created":"2018-03-09","cited_by_count":2262},{"id":"1905.10044","title":"BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questions","created":"2019-05-24","cited_by_count":2183},{"id":"1806.09055","title":"DARTS: Differentiable Architecture Search","created":"2018-06-24","cited_by_count":1798},{"id":"1611.00712","title":"The Concrete Distribution: A Continuous Relaxation of Discrete Random Variables","created":"2016-11-02","cited_by_count":1148},{"id":"2301.00774","title":"SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shot","created":"2023-01-02","cited_by_count":1121},{"id":"1606.06031","title":"The LAMBADA dataset: Word prediction requiring a broad discourse context","created":"2016-06-20","cited_by_count":992},{"id":"1704.04683","title":"RACE: Large-scale ReAding Comprehension Dataset From Examinations","created":"2017-04-15","cited_by_count":861},{"id":"2306.11695","title":"A Simple and Effective Pruning Approach for Large Language Models","created":"2023-06-20","cited_by_count":800},{"id":"2305.11627","title":"LLM-Pruner: On the Structural Pruning of Large Language Models","created":"2023-05-19","cited_by_count":650},{"id":"1710.01878","title":"To prune, or not to prune: exploring the efficacy of pruning for model compression","created":"2017-10-05","cited_by_count":603},{"id":"1810.05270","title":"Rethinking the Value of Network Pruning","created":"2018-10-11","cited_by_count":599},{"id":"1712.01312","title":"Learning Sparse Neural Networks through $L_0$ Regularization","created":"2017-12-04","cited_by_count":583},{"id":"2003.03033","title":"What is the State of Neural Network Pruning?","created":"2020-03-06","cited_by_count":583},{"id":"1906.10771","title":"Importance Estimation for Neural Network Pruning","created":"2019-06-25","cited_by_count":541},{"id":"1911.11134","title":"Rigging the Lottery: Making All Tickets Winners","created":"2019-11-25","cited_by_count":495},{"id":"1902.09574","title":"The State of Sparsity in Deep Neural Networks","created":"2019-02-25","cited_by_count":476},{"id":"2310.06694","title":"Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruning","created":"2023-10-10","cited_by_count":415},{"id":"2401.15024","title":"SliceGPT: Compress Large Language Models by Deleting Rows and Columns","created":"2024-01-26","cited_by_count":385},{"id":"2403.03853","title":"ShortGPT: Layers in Large Language Models are More Redundant Than You Expect","created":"2024-03-06","cited_by_count":383},{"id":"1802.03494","title":"AMC: AutoML for Model Compression and Acceleration on Mobile Devices","created":"2018-02-10","cited_by_count":378},{"id":"1808.06866","title":"Soft Filter Pruning for Accelerating Deep Convolutional Neural Networks","created":"2018-08-21","cited_by_count":315},{"id":"2402.05162","title":"Assessing the Brittleness of Safety Alignment via Pruning and Low-Rank Modifications","created":"2024-02-07","cited_by_count":231},{"id":"1903.10258","title":"MetaPruning: Meta Learning for Automatic Neural Network Channel Pruning","created":"2019-03-25","cited_by_count":227},{"id":"2002.08307","title":"Compressing BERT: Studying the Effects of Weight Pruning on Transfer Learning","created":"2020-02-19","cited_by_count":185},{"id":"1707.01213","title":"Data-Driven Sparse Structure Selection for Deep Neural Networks","created":"2017-07-05","cited_by_count":181},{"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},{"id":"2108.00708","title":"Group Fisher Pruning for Practical Network Compression","created":"2021-08-02","cited_by_count":131},{"id":"2402.11187","title":"LaCo: Large Language Model Pruning via Layer Collapse","created":"2024-02-17","cited_by_count":126},{"id":"2203.07259","title":"The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Models","created":"2022-03-14","cited_by_count":115},{"id":"2312.11983","title":"Fluctuation-based Adaptive Structured Pruning for Large Language Models","created":"2023-12-19","cited_by_count":111},{"id":"2012.09243","title":"Neural Pruning via Growing Regularization","created":"2020-12-16","cited_by_count":97},{"id":"2402.09025","title":"SLEB: Streamlining LLMs through Redundancy Verification and Elimination of Transformer Blocks","created":"2024-02-14","cited_by_count":97},{"id":"2110.01515","title":"A Review of the Gumbel-max Trick and its Extensions for Discrete Stochasticity in Machine Learning","created":"2021-10-04","cited_by_count":82},{"id":"2402.02834","title":"Shortened LLaMA: Depth Pruning for Large Language Models with Comparison of Retraining Methods","created":"2024-02-05","cited_by_count":82},{"id":"1611.06694","title":"Training Sparse Neural Networks","created":"2016-11-21","cited_by_count":73},{"id":"2211.07937","title":"An Improved Analysis of (Variance-Reduced) Policy Gradient and Natural Policy Gradient Methods","created":"2022-11-15","cited_by_count":68},{"id":"1309.1541","title":"Projection onto the probability simplex: An efficient algorithm with a simple proof, and an application","created":"2013-09-06","cited_by_count":67},{"id":"2310.08915","title":"Dynamic Sparse No Training: Training-Free Fine-tuning for Sparse LLMs","created":"2023-10-13","cited_by_count":61},{"id":"2301.13741","title":"UPop: Unified and Progressive Pruning for Compressing Vision-Language Transformers","created":"2023-01-31","cited_by_count":54},{"id":"2402.16880","title":"BESA: Pruning Large Language Models with Blockwise Parameter-Efficient Sparsity Allocation","created":"2024-02-18","cited_by_count":45},{"id":"2402.05406","title":"Everybody Prune Now: Structured Pruning of LLMs with only Forward Passes","created":"2024-02-08","cited_by_count":43},{"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},{"id":"2310.18356","title":"LoRAShear: Efficient Large Language Model Structured Pruning and Knowledge Recovery","created":"2023-10-24","cited_by_count":38},{"id":"2311.04902","title":"Beyond Size: How Gradients Shape Pruning Decisions in Large Language Models","created":"2023-11-08","cited_by_count":30},{"id":"2401.12200","title":"APT: Adaptive Pruning and Tuning Pretrained Language Models for Efficient Training and Inference","created":"2024-01-22","cited_by_count":29},{"id":"2310.05015","title":"Compresso: Structured Pruning with Collaborative Prompting Learns Compact Large Language Models","created":"2023-10-08","cited_by_count":19},{"id":"2310.09499","title":"One-Shot Sensitivity-Aware Mixed Sparsity Pruning for Large Language Models","created":"2023-10-14","cited_by_count":16},{"id":"2310.15929","title":"E-Sparse: Boosting the Large Language Model Inference through Entropy-based N:M Sparsity","created":"2023-10-24","cited_by_count":15},{"id":"2404.04748","title":"Multilingual Brain Surgeon: Large Language Models Can be Compressed Leaving No Language Behind","created":"2024-04-06","cited_by_count":11},{"id":"2310.10054","title":"NASH: A Simple Unified Framework of Structured Pruning for Accelerating Encoder-Decoder Language Models","created":"2023-10-16","cited_by_count":7},{"id":"2402.09773","title":"NutePrune: Efficient Progressive Pruning with Numerous Teachers for Large Language Models","created":"2024-02-15","cited_by_count":7},{"id":"2202.12986","title":"Extracting Effective Subnetworks with Gumbel-Softmax","created":"2022-02-25","cited_by_count":2}],"next_cursor":null}