{"list":"other","total":56,"rows":[{"id":"2005.14165","title":"Language Models are Few-Shot Learners","created":"2020-05-28","cited_by_count":32419},{"id":"1912.01703","title":"PyTorch: An Imperative Style, High-Performance Deep Learning Library","created":"2019-12-03","cited_by_count":20305},{"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":"2201.11903","title":"Chain-of-Thought Prompting Elicits Reasoning in Large Language Models","created":"2022-01-28","cited_by_count":12459},{"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":"2205.01068","title":"OPT: Open Pre-trained Transformer Language Models","created":"2022-05-02","cited_by_count":3512},{"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":"2303.12712","title":"Sparks of Artificial General Intelligence: Early experiments with GPT-4","created":"2023-03-22","cited_by_count":2592},{"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":"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":"1506.02626","title":"Learning both Weights and Connections for Efficient Neural Networks","created":"2015-06-08","cited_by_count":2031},{"id":"2211.10438","title":"SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language Models","created":"2022-11-18","cited_by_count":1386},{"id":"2306.00978","title":"AWQ: Activation-aware Weight Quantization for LLM Compression and Acceleration","created":"2023-06-01","cited_by_count":1298},{"id":"1608.08710","title":"Pruning Filters for Efficient ConvNets","created":"2016-08-31","cited_by_count":1143},{"id":"2301.00774","title":"SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shot","created":"2023-01-02","cited_by_count":1121},{"id":"2208.07339","title":"LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scale","created":"2022-08-15","cited_by_count":906},{"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":"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":"2305.11627","title":"LLM-Pruner: On the Structural Pruning of Large Language Models","created":"2023-05-19","cited_by_count":650},{"id":"1608.03665","title":"Learning Structured Sparsity in Deep Neural Networks","created":"2016-08-12","cited_by_count":541},{"id":"2206.01861","title":"ZeroQuant: Efficient and Affordable Post-Training Quantization for Large-Scale Transformers","created":"2022-06-04","cited_by_count":526},{"id":"2304.15004","title":"Are Emergent Abilities of Large Language Models a Mirage?","created":"2023-04-28","cited_by_count":523},{"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":"2002.07376","title":"Picking Winning Tickets Before Training by Preserving Gradient Flow","created":"2020-02-18","cited_by_count":471},{"id":"2308.13137","title":"OmniQuant: Omnidirectionally Calibrated Quantization for Large Language Models","created":"2023-08-25","cited_by_count":424},{"id":"2306.03078","title":"SpQR: A Sparse-Quantized Representation for Near-Lossless LLM Weight Compression","created":"2023-06-05","cited_by_count":367},{"id":"1707.04780","title":"Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Science","created":"2017-07-15","cited_by_count":328},{"id":"2212.09720","title":"The case for 4-bit precision: k-bit Inference Scaling Laws","created":"2022-12-19","cited_by_count":251},{"id":"1911.13299","title":"What's Hidden in a Randomly Weighted Neural Network?","created":"2019-11-29","cited_by_count":237},{"id":"2006.14769","title":"Supermasks in Superposition","created":"2020-06-26","cited_by_count":227},{"id":"1907.04840","title":"Sparse Networks from Scratch: Faster Training without Losing Performance","created":"2019-07-10","cited_by_count":213},{"id":"1905.01067","title":"Deconstructing Lottery Tickets: Zeros, Signs, and the Supermask","created":"2019-05-03","cited_by_count":207},{"id":"1902.05967","title":"Parameter Efficient Training of Deep Convolutional Neural Networks by Dynamic Sparse Reparameterization","created":"2019-02-15","cited_by_count":189},{"id":"2102.04010","title":"Learning N:M Fine-grained Structured Sparse Neural Networks From Scratch","created":"2021-02-08","cited_by_count":179},{"id":"2006.10901","title":"Sparse GPU Kernels for Deep Learning","created":"2020-06-18","cited_by_count":141},{"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":"2102.02887","title":"Do We Actually Need Dense Over-Parameterization? In-Time Over-Parameterization in Sparse Training","created":"2021-02-04","cited_by_count":110},{"id":"2102.08124","title":"Accelerated Sparse Neural Training: A Provable and Efficient Method to Find N:M Transposable Masks","created":"2021-02-16","cited_by_count":103},{"id":"2106.03517","title":"Top-KAST: Top-K Always Sparse Training","created":"2021-06-07","cited_by_count":79},{"id":"2110.14032","title":"MEST: Accurate and Fast Memory-Economic Sparse Training Framework on the Edge","created":"2021-10-26","cited_by_count":79},{"id":"1708.08917","title":"CirCNN: Accelerating and Compressing Deep Neural Networks Using Block-CirculantWeight Matrices","created":"2017-08-29","cited_by_count":55},{"id":"1901.09181","title":"Sparse evolutionary Deep Learning with over one million artificial neurons on commodity hardware","created":"2019-01-26","cited_by_count":48},{"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":"2206.06662","title":"Learning Best Combination for Efficient N:M Sparsity","created":"2022-06-14","cited_by_count":32},{"id":"2303.02141","title":"Sparsity May Cry: Let Us Fail (Current) Sparse Neural Networks Together!","created":"2023-03-03","cited_by_count":27},{"id":"2211.15335","title":"You Can Have Better Graph Neural Networks by Not Training Weights at All: Finding Untrained GNNs Tickets","created":"2022-11-28","cited_by_count":14},{"id":"2208.10842","title":"Lottery Pools: Winning More by Interpolating Tickets without Increasing Training or Inference Cost","created":"2022-08-23","cited_by_count":11},{"id":"2104.08700","title":"Lottery Jackpots Exist in Pre-trained Models","created":"2021-04-18","cited_by_count":10}],"next_cursor":null}