{"list":"other","total":51,"rows":[{"id":"2005.14165","title":"Language Models are Few-Shot Learners","created":"2020-05-28","cited_by_count":32419},{"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":"1503.02531","title":"Distilling the Knowledge in a Neural Network","created":"2015-03-09","cited_by_count":10324},{"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":"1905.07830","title":"HellaSwag: Can a Machine Really Finish Your Sentence?","created":"2019-05-19","cited_by_count":4100},{"id":"2305.14314","title":"QLoRA: Efficient Finetuning of Quantized LLMs","created":"2023-05-23","cited_by_count":3418},{"id":"1609.07843","title":"Pointer Sentinel Mixture Models","created":"2016-09-26","cited_by_count":3096},{"id":"2101.03961","title":"Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity","created":"2021-01-11","cited_by_count":3073},{"id":"1911.11641","title":"PIQA: Reasoning about Physical Commonsense in Natural Language","created":"2019-11-26","cited_by_count":2883},{"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":"2210.17323","title":"GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformers","created":"2022-10-31","cited_by_count":1919},{"id":"2401.04088","title":"Mixtral of Experts","created":"2024-01-08","cited_by_count":1823},{"id":"2006.16668","title":"GShard: Scaling Giant Models with Conditional Computation and Automatic Sharding","created":"2020-06-30","cited_by_count":1631},{"id":"2211.10438","title":"SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language Models","created":"2022-11-18","cited_by_count":1386},{"id":"2305.13245","title":"GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpoints","created":"2023-05-22","cited_by_count":1346},{"id":"2306.00978","title":"AWQ: Activation-aware Weight Quantization for LLM Compression and Acceleration","created":"2023-06-01","cited_by_count":1298},{"id":"2409.12186","title":"Qwen2.5-Coder Technical Report","created":"2024-09-18","cited_by_count":1203},{"id":"2301.00774","title":"SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shot","created":"2023-01-02","cited_by_count":1121},{"id":"1810.02340","title":"SNIP: Single-shot Network Pruning based on Connection Sensitivity","created":"2018-10-04","cited_by_count":812},{"id":"2306.11695","title":"A Simple and Effective Pruning Approach for Large Language Models","created":"2023-06-20","cited_by_count":800},{"id":"1905.13319","title":"MathQA: Towards Interpretable Math Word Problem Solving with Operation-Based Formalisms","created":"2019-05-30","cited_by_count":662},{"id":"2305.11627","title":"LLM-Pruner: On the Structural Pruning of Large Language Models","created":"2023-05-19","cited_by_count":650},{"id":"2303.06865","title":"FlexGen: High-Throughput Generative Inference of Large Language Models with a Single GPU","created":"2023-03-13","cited_by_count":575},{"id":"2206.01861","title":"ZeroQuant: Efficient and Affordable Post-Training Quantization for Large-Scale Transformers","created":"2022-06-04","cited_by_count":526},{"id":"2503.24290","title":"Open-Reasoner-Zero: An Open Source Approach to Scaling Up Reinforcement Learning on the Base Model","created":"2025-03-31","cited_by_count":461},{"id":"2401.15024","title":"SliceGPT: Compress Large Language Models by Deleting Rows and Columns","created":"2024-01-26","cited_by_count":385},{"id":"2402.13116","title":"A Survey on Knowledge Distillation of Large Language Models","created":"2024-02-20","cited_by_count":284},{"id":"2308.07633","title":"A Survey on Model Compression for Large Language Models","created":"2023-08-15","cited_by_count":269},{"id":"2403.07378","title":"SVD-LLM: Truncation-aware Singular Value Decomposition for Large Language Model Compression","created":"2024-03-12","cited_by_count":243},{"id":"2404.14294","title":"A Survey on Efficient Inference for Large Language Models","created":"2024-04-22","cited_by_count":205},{"id":"2207.00112","title":"Language model compression with weighted low-rank factorization","created":"2022-06-30","cited_by_count":195},{"id":"2204.05149","title":"The Carbon Footprint of Machine Learning Training Will Plateau, Then Shrink","created":"2022-04-11","cited_by_count":184},{"id":"2312.05821","title":"ASVD: Activation-aware Singular Value Decomposition for Compressing Large Language Models","created":"2023-12-10","cited_by_count":169},{"id":"2110.01786","title":"MoEfication: Transformer Feed-forward Layers are Mixtures of Experts","created":"2021-10-05","cited_by_count":152},{"id":"2402.04291","title":"BiLLM: Pushing the Limit of Post-Training Quantization for LLMs","created":"2024-02-06","cited_by_count":144},{"id":"2503.12340","title":"SVD-LLM V2: Optimizing Singular Value Truncation for Large Language Model Compression","created":"2025-03-16","cited_by_count":67},{"id":"2407.01885","title":"Survey on Knowledge Distillation for Large Language Models: Methods, Evaluation, and Application","created":"2024-07-02","cited_by_count":56},{"id":"2001.04246","title":"AdaBERT: Task-Adaptive BERT Compression with Differentiable Neural Architecture Search","created":"2020-01-13","cited_by_count":51},{"id":"2502.02723","title":"Dobi-SVD: Differentiable SVD for LLM Compression and Some New Perspectives","created":"2025-02-04","cited_by_count":48},{"id":"2202.07105","title":"A Survey on Model Compression and Acceleration for Pretrained Language Models","created":"2022-02-15","cited_by_count":45},{"id":"2501.03035","title":"Quantization Meets Reasoning: Exploring LLM Low-Bit Quantization Degradation for Mathematical Reasoning","created":"2025-01-06","cited_by_count":37},{"id":"2410.03765","title":"Basis Sharing: Cross-Layer Parameter Sharing for Large Language Model Compression","created":"2024-10-02","cited_by_count":35},{"id":"2007.00864","title":"Hardware Acceleration of Sparse and Irregular Tensor Computations of ML Models: A Survey and Insights","created":"2020-07-02","cited_by_count":28},{"id":"2505.22689","title":"SlimLLM: Accurate Structured Pruning for Large Language Models","created":"2025-05-28","cited_by_count":18},{"id":"2502.01403","title":"AdaSVD: Adaptive Singular Value Decomposition for Large Language Models","created":"2025-02-03","cited_by_count":15},{"id":"2602.03051","title":"SAES-SVD: Self-Adaptive Suppression of Accumulated and Local Errors for SVD-based LLM Compression","created":"2026-02-03","cited_by_count":12},{"id":"2403.07953","title":"Enabling Unstructured Sparse Acceleration on Structured Sparse Accelerators","created":"2024-03-12","cited_by_count":8},{"id":"2506.20353","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","created":"2025-06-25","cited_by_count":8},{"id":"2509.25622","title":"Layer-wise dynamic rank for compressing large language models","created":"2025-09-30","cited_by_count":8}],"next_cursor":null}