{"list":"other","total":56,"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":"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":"2106.09685","title":"LoRA: Low-Rank Adaptation of Large Language Models","created":"2021-06-17","cited_by_count":14380},{"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":"2001.08361","title":"Scaling Laws for Neural Language Models","created":"2020-01-23","cited_by_count":6586},{"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":"1902.00751","title":"Parameter-Efficient Transfer Learning for NLP","created":"2019-02-02","cited_by_count":4236},{"id":"1905.07830","title":"HellaSwag: Can a Machine Really Finish Your Sentence?","created":"2019-05-19","cited_by_count":4100},{"id":"2104.08691","title":"The Power of Scale for Parameter-Efficient Prompt Tuning","created":"2021-04-18","cited_by_count":3795},{"id":"2205.01068","title":"OPT: Open Pre-trained Transformer Language Models","created":"2022-05-02","cited_by_count":3512},{"id":"2305.14314","title":"QLoRA: Efficient Finetuning of Quantized LLMs","created":"2023-05-23","cited_by_count":3418},{"id":"1911.11641","title":"PIQA: Reasoning about Physical Commonsense in Natural Language","created":"2019-11-26","cited_by_count":2883},{"id":"1905.10044","title":"BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questions","created":"2019-05-24","cited_by_count":2183},{"id":"1809.02789","title":"Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answering","created":"2018-09-08","cited_by_count":2164},{"id":"1905.00414","title":"Similarity of Neural Network Representations Revisited","created":"2019-05-01","cited_by_count":1755},{"id":"2211.10438","title":"SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language Models","created":"2022-11-18","cited_by_count":1386},{"id":"2301.00774","title":"SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shot","created":"2023-01-02","cited_by_count":1121},{"id":"2306.13649","title":"On-Policy Distillation of Language Models: Learning from Self-Generated Mistakes","created":"2023-06-23","cited_by_count":939},{"id":"2306.11695","title":"A Simple and Effective Pruning Approach for Large Language Models","created":"2023-06-20","cited_by_count":800},{"id":"2005.00247","title":"AdapterFusion: Non-Destructive Task Composition for Transfer Learning","created":"2020-05-01","cited_by_count":788},{"id":"2305.02301","title":"Distilling Step-by-Step! Outperforming Larger Language Models with Less Training Data and Smaller Model Sizes","created":"2023-05-03","cited_by_count":737},{"id":"1906.00910","title":"Learning Representations by Maximizing Mutual Information Across Views","created":"2019-06-03","cited_by_count":734},{"id":"2110.07602","title":"P-Tuning v2: Prompt Tuning Can Be Comparable to Fine-tuning Universally Across Scales and Tasks","created":"2021-10-14","cited_by_count":689},{"id":"2304.03277","title":"Instruction Tuning with GPT-4","created":"2023-04-06","cited_by_count":686},{"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":"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":"1907.13625","title":"On Mutual Information Maximization for Representation Learning","created":"2019-07-31","cited_by_count":316},{"id":"2401.06118","title":"Extreme Compression of Large Language Models via Additive Quantization","created":"2024-01-11","cited_by_count":232},{"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":"2402.03898","title":"DistiLLM: Towards Streamlined Distillation for Large Language Models","created":"2024-02-06","cited_by_count":163},{"id":"2312.11983","title":"Fluctuation-based Adaptive Structured Pruning for Large Language Models","created":"2023-12-19","cited_by_count":111},{"id":"2306.11222","title":"LoSparse: Structured Compression of Large Language Models based on Low-Rank and Sparse Approximation","created":"2023-06-20","cited_by_count":104},{"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":"2311.11696","title":"Sparse Low-rank Adaptation of Pre-trained Language Models","created":"2023-11-20","cited_by_count":96},{"id":"2402.11295","title":"OneBit: Towards Extremely Low-bit Large Language Models","created":"2024-02-17","cited_by_count":79},{"id":"2402.16880","title":"BESA: Pruning Large Language Models with Blockwise Parameter-Efficient Sparsity Allocation","created":"2024-02-18","cited_by_count":45},{"id":"2406.02924","title":"Pruner-Zero: Evolving Symbolic Pruning Metric from scratch for Large Language Models","created":"2024-06-05","cited_by_count":40},{"id":"2310.18356","title":"LoRAShear: Efficient Large Language Model Structured Pruning and Knowledge Recovery","created":"2023-10-24","cited_by_count":38},{"id":"2403.16187","title":"ALoRA: Allocating Low-Rank Adaptation for Fine-tuning Large Language Models","created":"2024-03-24","cited_by_count":36},{"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":"2108.12594","title":"Layer-wise Model Pruning based on Mutual Information","created":"2021-08-28","cited_by_count":19},{"id":"2310.05015","title":"Compresso: Structured Pruning with Collaborative Prompting Learns Compact Large Language Models","created":"2023-10-08","cited_by_count":19},{"id":"2406.07831","title":"ALPS: Improved Optimization for Highly Sparse One-Shot Pruning for Large Language Models","created":"2024-06-12","cited_by_count":19},{"id":"2108.08532","title":"An Information Theory-inspired Strategy for Automatic Network Pruning","created":"2021-08-19","cited_by_count":17},{"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.09695","title":"LoRAP: Transformer Sub-Layers Deserve Differentiated Structured Compression for Large Language Models","created":"2024-04-15","cited_by_count":12},{"id":"2405.16057","title":"SPP: Sparsity-Preserved Parameter-Efficient Fine-Tuning for Large Language Models","created":"2024-05-25","cited_by_count":11},{"id":"2402.09773","title":"NutePrune: Efficient Progressive Pruning with Numerous Teachers for Large Language Models","created":"2024-02-15","cited_by_count":7},{"id":"2402.12419","title":"EBFT: Effective and Block-Wise Fine-Tuning for Sparse LLMs","created":"2024-02-19","cited_by_count":6},{"id":"2408.13482","title":"MPruner: Optimizing Neural Network Size with CKA-Based Mutual Information Pruning","created":"2024-08-24","cited_by_count":1}],"next_cursor":null}