{"list":"other","total":56,"rows":[{"id":"2407.21783","title":"The Llama 3 Herd of Models","created":"2024-07-31","cited_by_count":14715},{"id":"1503.02531","title":"Distilling the Knowledge in a Neural Network","created":"2015-03-09","cited_by_count":10324},{"id":"2110.14168","title":"Training Verifiers to Solve Math Word Problems","created":"2021-10-27","cited_by_count":10109},{"id":"2107.03374","title":"Evaluating Large Language Models Trained on Code","created":"2021-07-07","cited_by_count":8320},{"id":"2009.03300","title":"Measuring Massive Multitask Language Understanding","created":"2020-09-07","cited_by_count":7963},{"id":"2103.03874","title":"Measuring Mathematical Problem Solving With the MATH Dataset","created":"2021-03-05","cited_by_count":5371},{"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":"2108.07732","title":"Program Synthesis with Large Language Models","created":"2021-08-16","cited_by_count":3637},{"id":"1606.08415","title":"Gaussian Error Linear Units (GELUs)","created":"2016-06-27","cited_by_count":3502},{"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":"2210.11416","title":"Scaling Instruction-Finetuned Language Models","created":"2022-10-20","cited_by_count":3024},{"id":"1803.03635","title":"The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networks","created":"2018-03-09","cited_by_count":2262},{"id":"2407.10671","title":"Qwen2 Technical Report","created":"2024-07-15","cited_by_count":2120},{"id":"1506.02626","title":"Learning both Weights and Connections for Efficient Neural Networks","created":"2015-06-08","cited_by_count":2031},{"id":"2002.05202","title":"GLU Variants Improve Transformer","created":"2020-02-12","cited_by_count":1804},{"id":"2006.16668","title":"GShard: Scaling Giant Models with Conditional Computation and Automatic Sharding","created":"2020-06-30","cited_by_count":1631},{"id":"2311.07911","title":"Instruction-Following Evaluation for Large Language Models","created":"2023-11-14","cited_by_count":1228},{"id":"2405.04434","title":"DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Model","created":"2024-05-07","cited_by_count":1135},{"id":"1606.06031","title":"The LAMBADA dataset: Word prediction requiring a broad discourse context","created":"2016-06-20","cited_by_count":992},{"id":"1702.03118","title":"Sigmoid-Weighted Linear Units for Neural Network Function Approximation in Reinforcement Learning","created":"2017-02-10","cited_by_count":950},{"id":"2112.06905","title":"GLaM: Efficient Scaling of Language Models with Mixture-of-Experts","created":"2021-12-13","cited_by_count":897},{"id":"2404.04475","title":"Length-Controlled AlpacaEval: A Simple Way to Debias Automatic Evaluators","created":"2024-04-06","cited_by_count":897},{"id":"2401.06066","title":"DeepSeekMoE: Towards Ultimate Expert Specialization in Mixture-of-Experts Language Models","created":"2024-01-11","cited_by_count":867},{"id":"1905.09418","title":"Analyzing Multi-Head Self-Attention: Specialized Heads Do the Heavy Lifting, the Rest Can Be Pruned","created":"2019-05-23","cited_by_count":856},{"id":"1707.06209","title":"Crowdsourcing Multiple Choice Science Questions","created":"2017-07-19","cited_by_count":765},{"id":"2305.11627","title":"LLM-Pruner: On the Structural Pruning of Large Language Models","created":"2023-05-19","cited_by_count":650},{"id":"2202.09368","title":"Mixture-of-Experts with Expert Choice Routing","created":"2022-02-18","cited_by_count":623},{"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":"1712.01312","title":"Learning Sparse Neural Networks through $L_0$ Regularization","created":"2017-12-04","cited_by_count":583},{"id":"2106.03193","title":"The FLORES-101 Evaluation Benchmark for Low-Resource and Multilingual Machine Translation","created":"2021-06-06","cited_by_count":560},{"id":"1608.03665","title":"Learning Structured Sparsity in Deep Neural Networks","created":"2016-08-12","cited_by_count":541},{"id":"2406.11939","title":"From Crowdsourced Data to High-Quality Benchmarks: Arena-Hard and BenchBuilder Pipeline","created":"2024-06-17","cited_by_count":500},{"id":"2310.06694","title":"Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruning","created":"2023-10-10","cited_by_count":415},{"id":"2202.08906","title":"ST-MoE: Designing Stable and Transferable Sparse Expert Models","created":"2022-02-17","cited_by_count":399},{"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":"2007.12223","title":"The Lottery Ticket Hypothesis for Pre-trained BERT Networks","created":"2020-07-23","cited_by_count":275},{"id":"2310.17157","title":"Deja Vu: Contextual Sparsity for Efficient LLMs at Inference Time","created":"2023-10-26","cited_by_count":252},{"id":"1910.04732","title":"Structured Pruning of Large Language Models","created":"2019-10-10","cited_by_count":203},{"id":"2407.14679","title":"Compact Language Models via Pruning and Knowledge Distillation","created":"2024-07-19","cited_by_count":148},{"id":"2208.08227","title":"MultiPL-E: A Scalable and Extensible Approach to Benchmarking Neural Code Generation","created":"2022-08-17","cited_by_count":136},{"id":"2402.11187","title":"LaCo: Large Language Model Pruning via Layer Collapse","created":"2024-02-17","cited_by_count":126},{"id":"2310.04564","title":"ReLU Strikes Back: Exploiting Activation Sparsity in Large Language Models","created":"2023-10-06","cited_by_count":94},{"id":"2303.09752","title":"CoLT5: Faster Long-Range Transformers with Conditional Computation","created":"2023-03-17","cited_by_count":84},{"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":"2408.11796","title":"LLM Pruning and Distillation in Practice: The Minitron Approach","created":"2024-08-21","cited_by_count":82},{"id":"1704.05119","title":"Exploring Sparsity in Recurrent Neural Networks","created":"2017-04-17","cited_by_count":75},{"id":"2304.04947","title":"Conditional Adapters: Parameter-efficient Transfer Learning with Fast Inference","created":"2023-04-11","cited_by_count":69},{"id":"2302.04089","title":"ZipLM: Inference-Aware Structured Pruning of Language Models","created":"2023-02-07","cited_by_count":49},{"id":"2402.13516","title":"ProSparse: Introducing and Enhancing Intrinsic Activation Sparsity within Large Language Models","created":"2024-02-21","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":"2404.08763","title":"CATS: Contextually-Aware Thresholding for Sparsity in Large Language Models","created":"2024-04-12","cited_by_count":41},{"id":"2410.02098","title":"EC-DIT: Scaling Diffusion Transformers with Adaptive Expert-Choice Routing","created":"2024-10-02","cited_by_count":30},{"id":"2407.18961","title":"MMAU: A Holistic Benchmark of Agent Capabilities Across Diverse Domains","created":"2024-07-18","cited_by_count":19},{"id":"2409.12136","title":"GRIN: GRadient-INformed MoE","created":"2024-09-18","cited_by_count":17},{"id":"2409.03856","title":"Sirius: Contextual Sparsity with Correction for Efficient LLMs","created":"2024-09-05","cited_by_count":4}],"next_cursor":null}