{"list":"other","total":68,"rows":[{"id":"2005.14165","title":"Language Models are Few-Shot Learners","created":"2020-05-28","cited_by_count":32419},{"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":"1803.05457","title":"Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challenge","created":"2018-03-14","cited_by_count":4886},{"id":"2312.00752","title":"Mamba: Linear-Time Sequence Modeling with Selective State Spaces","created":"2023-12-01","cited_by_count":4718},{"id":"2104.09864","title":"RoFormer: Enhanced Transformer with Rotary Position Embedding","created":"2021-04-20","cited_by_count":4703},{"id":"2307.01952","title":"SDXL: Improving Latent Diffusion Models for High-Resolution Image Synthesis","created":"2023-07-04","cited_by_count":4356},{"id":"1905.07830","title":"HellaSwag: Can a Machine Really Finish Your Sentence?","created":"2019-05-19","cited_by_count":4100},{"id":"2212.04356","title":"Robust Speech Recognition via Large-Scale Weak Supervision","created":"2022-12-06","cited_by_count":4057},{"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":"2403.05530","title":"Gemini 1.5: Unlocking multimodal understanding across millions of tokens of context","created":"2024-03-08","cited_by_count":3224},{"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":"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":"2006.16236","title":"Transformers are RNNs: Fast Autoregressive Transformers with Linear Attention","created":"2020-06-29","cited_by_count":2022},{"id":"2408.00118","title":"Gemma 2: Improving Open Language Models at a Practical Size","created":"2024-07-31","cited_by_count":1998},{"id":"2211.05100","title":"BLOOM: A 176B-Parameter Open-Access Multilingual Language Model","created":"2022-11-09","cited_by_count":1984},{"id":"2210.17323","title":"GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformers","created":"2022-10-31","cited_by_count":1919},{"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":"2106.10199","title":"BitFit: Simple Parameter-efficient Fine-tuning for Transformer-based Masked Language-models","created":"2021-06-18","cited_by_count":1245},{"id":"2212.07143","title":"Reproducible scaling laws for contrastive language-image learning","created":"2022-12-14","cited_by_count":1173},{"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":"2108.12409","title":"Train Short, Test Long: Attention with Linear Biases Enables Input Length Extrapolation","created":"2021-08-27","cited_by_count":1103},{"id":"2404.14469","title":"SnapKV: LLM Knows What You are Looking for Before Generation","created":"2024-04-22","cited_by_count":880},{"id":"2305.13048","title":"RWKV: Reinventing RNNs for the Transformer Era","created":"2023-05-22","cited_by_count":827},{"id":"2306.11695","title":"A Simple and Effective Pruning Approach for Large Language Models","created":"2023-06-20","cited_by_count":800},{"id":"1911.02150","title":"Fast Transformer Decoding: One Write-Head is All You Need","created":"2019-11-06","cited_by_count":717},{"id":"2103.10385","title":"GPT Understands, Too","created":"2021-03-18","cited_by_count":716},{"id":"2305.11627","title":"LLM-Pruner: On the Structural Pruning of Large Language Models","created":"2023-05-19","cited_by_count":650},{"id":"2402.02750","title":"KIVI: A Tuning-Free Asymmetric 2bit Quantization for KV Cache","created":"2024-02-05","cited_by_count":637},{"id":"2401.18079","title":"KVQuant: Towards 10 Million Context Length LLM Inference with KV Cache Quantization","created":"2024-01-31","cited_by_count":591},{"id":"2403.03507","title":"GaLore: Memory-Efficient LLM Training by Gradient Low-Rank Projection","created":"2024-03-06","cited_by_count":463},{"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":"2303.10512","title":"AdaLoRA: Adaptive Budget Allocation for Parameter-Efficient Fine-Tuning","created":"2023-03-18","cited_by_count":357},{"id":"2012.07463","title":"Parameter-Efficient Transfer Learning with Diff Pruning","created":"2020-12-14","cited_by_count":352},{"id":"2402.19427","title":"Griffin: Mixing Gated Linear Recurrences with Local Attention for Efficient Language Models","created":"2024-02-29","cited_by_count":242},{"id":"2110.07904","title":"SPoT: Better Frozen Model Adaptation through Soft Prompt Transfer","created":"2021-10-15","cited_by_count":235},{"id":"2101.00121","title":"WARP: Word-level Adversarial ReProgramming","created":"2021-01-01","cited_by_count":221},{"id":"2111.09839","title":"Training Neural Networks with Fixed Sparse Masks","created":"2021-11-18","cited_by_count":214},{"id":"2306.07280","title":"Controlling Text-to-Image Diffusion by Orthogonal Finetuning","created":"2023-06-12","cited_by_count":208},{"id":"2411.05007","title":"SVDQuant: Absorbing Outliers by Low-Rank Components for 4-Bit Diffusion Models","created":"2024-11-07","cited_by_count":170},{"id":"2109.05687","title":"Raise a Child in Large Language Model: Towards Effective and Generalizable Fine-tuning","created":"2021-09-13","cited_by_count":146},{"id":"2110.07560","title":"Composable Sparse Fine-Tuning for Cross-Lingual Transfer","created":"2021-10-14","cited_by_count":144},{"id":"2405.05254","title":"You Only Cache Once: Decoder-Decoder Architectures for Language Models","created":"2024-05-08","cited_by_count":144},{"id":"2211.15583","title":"On the Effectiveness of Parameter-Efficient Fine-Tuning","created":"2022-11-28","cited_by_count":141},{"id":"2407.05000","title":"LoRA-GA: Low-Rank Adaptation with Gradient Approximation","created":"2024-07-06","cited_by_count":141},{"id":"2405.12981","title":"Reducing Transformer Key-Value Cache Size with Cross-Layer Attention","created":"2024-05-21","cited_by_count":131},{"id":"2405.14366","title":"MiniCache: KV Cache Compression in Depth Dimension for Large Language Models","created":"2024-05-23","cited_by_count":125},{"id":"2303.02861","title":"Multitask Prompt Tuning Enables Parameter-Efficient Transfer Learning","created":"2023-03-06","cited_by_count":115},{"id":"2311.06243","title":"Parameter-Efficient Orthogonal Finetuning via Butterfly Factorization","created":"2023-11-10","cited_by_count":114},{"id":"2410.21228","title":"LoRA vs Full Fine-tuning: An Illusion of Equivalence","created":"2024-10-28","cited_by_count":109},{"id":"2004.12406","title":"Masking as an Efficient Alternative to Finetuning for Pretrained Language Models","created":"2020-04-26","cited_by_count":93},{"id":"2311.00430","title":"Distil-Whisper: Robust Knowledge Distillation via Large-Scale Pseudo Labelling","created":"2023-11-01","cited_by_count":90},{"id":"2205.11961","title":"ATTEMPT: Parameter-Efficient Multi-task Tuning via Attentional Mixtures of Soft Prompts","created":"2022-05-24","cited_by_count":85},{"id":"2407.18242","title":"LoRA-Pro: Are Low-Rank Adapters Properly Optimized?","created":"2024-07-25","cited_by_count":77},{"id":"2309.02411","title":"Delta-LoRA: Fine-Tuning High-Rank Parameters with the Delta of Low-Rank Matrices","created":"2023-09-05","cited_by_count":74},{"id":"2407.14057","title":"LazyLLM: Dynamic Token Pruning for Efficient Long Context LLM Inference","created":"2024-07-19","cited_by_count":70},{"id":"2405.19597","title":"SVFT: Parameter-Efficient Fine-Tuning with Singular Vectors","created":"2024-05-30","cited_by_count":58},{"id":"2405.12130","title":"MoRA: High-Rank Updating for Parameter-Efficient Fine-Tuning","created":"2024-05-20","cited_by_count":31},{"id":"2406.07056","title":"Effectively Compress KV Heads for LLM","created":"2024-06-11","cited_by_count":30},{"id":"2305.16597","title":"Neural Architecture Search for Parameter-Efficient Fine-tuning of Large Pre-trained Language Models","created":"2023-05-26","cited_by_count":25},{"id":"2406.09297","title":"MLKV: Multi-Layer Key-Value Heads for Memory Efficient Transformer Decoding","created":"2024-06-13","cited_by_count":21},{"id":"2405.17484","title":"Bridging The Gap between Low-rank and Orthogonal Adaptation via Householder Reflection Adaptation","created":"2024-05-24","cited_by_count":15},{"id":"2407.20485","title":"A2SF: Accumulative Attention Scoring with Forgetting Factor for Token Pruning in Transformer Decoder","created":"2024-07-30","cited_by_count":8}],"next_cursor":null}