{"list":"other","total":52,"rows":[{"id":"1810.04805","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","created":"2018-10-11","cited_by_count":40399},{"id":"2303.08774","title":"GPT-4 Technical Report","created":"2023-03-15","cited_by_count":18396},{"id":"2302.13971","title":"LLaMA: Open and Efficient Foundation Language Models","created":"2023-02-27","cited_by_count":14132},{"id":"1907.11692","title":"RoBERTa: A Robustly Optimized BERT Pretraining Approach","created":"2019-07-26","cited_by_count":13372},{"id":"2307.09288","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","created":"2023-07-18","cited_by_count":13028},{"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":"2001.08361","title":"Scaling Laws for Neural Language Models","created":"2020-01-23","cited_by_count":6586},{"id":"2309.06180","title":"Efficient Memory Management for Large Language Model Serving with PagedAttention","created":"2023-09-12","cited_by_count":5944},{"id":"2103.03874","title":"Measuring Mathematical Problem Solving With the MATH Dataset","created":"2021-03-05","cited_by_count":5371},{"id":"1804.07461","title":"GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understanding","created":"2018-04-20","cited_by_count":4899},{"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":"1606.05250","title":"SQuAD: 100,000+ Questions for Machine Comprehension of Text","created":"2016-06-16","cited_by_count":4148},{"id":"1905.07830","title":"HellaSwag: Can a Machine Really Finish Your Sentence?","created":"2019-05-19","cited_by_count":4100},{"id":"2101.00190","title":"Prefix-Tuning: Optimizing Continuous Prompts for Generation","created":"2021-01-01","cited_by_count":3915},{"id":"2104.08691","title":"The Power of Scale for Parameter-Efficient Prompt Tuning","created":"2021-04-18","cited_by_count":3795},{"id":"2108.07732","title":"Program Synthesis with Large Language Models","created":"2021-08-16","cited_by_count":3637},{"id":"2203.15556","title":"Training Compute-Optimal Large Language Models","created":"2022-03-29","cited_by_count":3019},{"id":"2109.07958","title":"TruthfulQA: Measuring How Models Mimic Human Falsehoods","created":"2021-09-08","cited_by_count":2975},{"id":"1704.05426","title":"A Broad-Coverage Challenge Corpus for Sentence Understanding through Inference","created":"2017-04-18","cited_by_count":2682},{"id":"2303.18223","title":"A Survey of Large Language Models","created":"2023-03-31","cited_by_count":2576},{"id":"2206.07682","title":"Emergent Abilities of Large Language Models","created":"2022-06-15","cited_by_count":2512},{"id":"1803.03635","title":"The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networks","created":"2018-03-09","cited_by_count":2262},{"id":"2308.12950","title":"Code Llama: Open Foundation Models for Code","created":"2023-08-24","cited_by_count":2139},{"id":"1506.02626","title":"Learning both Weights and Connections for Efficient Neural Networks","created":"2015-06-08","cited_by_count":2031},{"id":"1508.05326","title":"A large annotated corpus for learning natural language inference","created":"2015-08-21","cited_by_count":1847},{"id":"2203.05482","title":"Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference time","created":"2022-03-10","cited_by_count":1396},{"id":"2212.04089","title":"Editing Models with Task Arithmetic","created":"2022-12-08","cited_by_count":1120},{"id":"1708.00055","title":"SemEval-2017 Task 1: Semantic Textual Similarity - Multilingual and Cross-lingual Focused Evaluation","created":"2017-07-31","cited_by_count":1001},{"id":"1805.12471","title":"Neural Network Acceptability Judgments","created":"2018-05-31","cited_by_count":958},{"id":"2110.04366","title":"Towards a Unified View of Parameter-Efficient Transfer Learning","created":"2021-10-08","cited_by_count":872},{"id":"1707.08114","title":"A Survey on Multi-Task Learning","created":"2017-07-25","cited_by_count":840},{"id":"2306.08568","title":"WizardCoder: Empowering Code Large Language Models with Evol-Instruct","created":"2023-06-14","cited_by_count":733},{"id":"2103.10385","title":"GPT Understands, Too","created":"2021-03-18","cited_by_count":716},{"id":"2308.09583","title":"WizardMath: Empowering Mathematical Reasoning for Large Language Models via Reinforced Evol-Instruct","created":"2023-08-18","cited_by_count":625},{"id":"2111.09832","title":"Merging Models with Fisher-Weighted Averaging","created":"2021-11-18","cited_by_count":621},{"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":"1902.09574","title":"The State of Sparsity in Deep Neural Networks","created":"2019-02-25","cited_by_count":476},{"id":"2212.09849","title":"Dataless Knowledge Fusion by Merging Weights of Language Models","created":"2022-12-19","cited_by_count":387},{"id":"2002.06305","title":"Fine-Tuning Pretrained Language Models: Weight Initializations, Data Orders, and Early Stopping","created":"2020-02-15","cited_by_count":384},{"id":"2009.09796","title":"Multi-Task Learning with Deep Neural Networks: A Survey","created":"2020-09-10","cited_by_count":375},{"id":"1710.09282","title":"A Survey of Model Compression and Acceleration for Deep Neural Networks","created":"2017-10-23","cited_by_count":301},{"id":"2101.09671","title":"Pruning and Quantization for Deep Neural Network Acceleration: A Survey","created":"2021-01-24","cited_by_count":263},{"id":"2204.00408","title":"Structured Pruning Learns Compact and Accurate Models","created":"2022-04-01","cited_by_count":170},{"id":"2110.07577","title":"UniPELT: A Unified Framework for Parameter-Efficient Language Model Tuning","created":"2021-10-14","cited_by_count":162},{"id":"2306.14870","title":"Composing Parameter-Efficient Modules with Arithmetic Operations","created":"2023-06-26","cited_by_count":156},{"id":"2010.07611","title":"Layer-adaptive sparsity for the Magnitude-based Pruning","created":"2020-10-15","cited_by_count":126},{"id":"1905.06290","title":"A Surprisingly Robust Trick for Winograd Schema Challenge","created":"2019-05-15","cited_by_count":30},{"id":"2210.14102","title":"Exploring Mode Connectivity for Pre-trained Language Models","created":"2022-10-25","cited_by_count":26}],"next_cursor":null}