{"list":"other","total":60,"rows":[{"id":"1706.03762","title":"Attention Is All You Need","created":"2017-06-12","cited_by_count":60361},{"id":"2103.00020","title":"Learning Transferable Visual Models From Natural Language Supervision","created":"2021-02-26","cited_by_count":33744},{"id":"2005.14165","title":"Language Models are Few-Shot Learners","created":"2020-05-28","cited_by_count":32419},{"id":"2010.11929","title":"An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale","created":"2020-10-22","cited_by_count":30186},{"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":"2309.06180","title":"Efficient Memory Management for Large Language Model Serving with PagedAttention","created":"2023-09-12","cited_by_count":5944},{"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":"2104.09864","title":"RoFormer: Enhanced Transformer with Rotary Position Embedding","created":"2021-04-20","cited_by_count":4703},{"id":"2201.12086","title":"BLIP: Bootstrapping Language-Image Pre-training for Unified Vision-Language Understanding and Generation","created":"2022-01-28","cited_by_count":4322},{"id":"1905.07830","title":"HellaSwag: Can a Machine Really Finish Your Sentence?","created":"2019-05-19","cited_by_count":4100},{"id":"2205.14135","title":"FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awareness","created":"2022-05-27","cited_by_count":3673},{"id":"2004.05150","title":"Longformer: The Long-Document Transformer","created":"2020-04-10","cited_by_count":3413},{"id":"2307.08691","title":"FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioning","created":"2023-07-17","cited_by_count":2598},{"id":"2006.16236","title":"Transformers are RNNs: Fast Autoregressive Transformers with Linear Attention","created":"2020-06-29","cited_by_count":2022},{"id":"1905.00537","title":"SuperGLUE: A Stickier Benchmark for General-Purpose Language Understanding Systems","created":"2019-05-02","cited_by_count":1729},{"id":"2001.04451","title":"Reformer: The Efficient Transformer","created":"2020-01-13","cited_by_count":1668},{"id":"2009.14794","title":"Rethinking Attention with Performers","created":"2020-09-30","cited_by_count":1601},{"id":"1904.10509","title":"Generating Long Sequences with Sparse Transformers","created":"2019-04-23","cited_by_count":1546},{"id":"2006.04768","title":"Linformer: Self-Attention with Linear Complexity","created":"2020-06-08","cited_by_count":1474},{"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":"2405.04434","title":"DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Model","created":"2024-05-07","cited_by_count":1135},{"id":"2301.00774","title":"SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shot","created":"2023-01-02","cited_by_count":1121},{"id":"2306.11695","title":"A Simple and Effective Pruning Approach for Large Language Models","created":"2023-06-20","cited_by_count":800},{"id":"2402.09353","title":"DoRA: Weight-Decomposed Low-Rank Adaptation","created":"2024-02-14","cited_by_count":758},{"id":"2305.11627","title":"LLM-Pruner: On the Structural Pruning of Large Language Models","created":"2023-05-19","cited_by_count":650},{"id":"2407.08608","title":"FlashAttention-3: Fast and Accurate Attention with Asynchrony and Low-precision","created":"2024-07-11","cited_by_count":519},{"id":"2102.11174","title":"Linear Transformers Are Secretly Fast Weight Programmers","created":"2021-02-22","cited_by_count":502},{"id":"2401.15024","title":"SliceGPT: Compress Large Language Models by Deleting Rows and Columns","created":"2024-01-26","cited_by_count":385},{"id":"1704.04289","title":"Stochastic Gradient Descent as Approximate Bayesian Inference","created":"2017-04-13","cited_by_count":300},{"id":"2404.02948","title":"PiSSA: Principal Singular Values and Singular Vectors Adaptation of Large Language Models","created":"2024-04-03","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":"2104.08378","title":"Accelerating Sparse Deep Neural Networks","created":"2021-04-16","cited_by_count":223},{"id":"2307.05695","title":"ReLoRA: High-Rank Training Through Low-Rank Updates","created":"2023-07-11","cited_by_count":204},{"id":"2207.00112","title":"Language model compression with weighted low-rank factorization","created":"2022-06-30","cited_by_count":195},{"id":"2312.05821","title":"ASVD: Activation-aware Singular Value Decomposition for Compressing Large Language Models","created":"2023-12-10","cited_by_count":169},{"id":"2406.01721","title":"DuQuant: Distributing Outliers via Dual Transformation Makes Stronger Quantized LLMs","created":"2024-06-03","cited_by_count":167},{"id":"2010.05627","title":"Towards Theoretically Understanding Why SGD Generalizes Better Than ADAM in Deep Learning","created":"2020-10-12","cited_by_count":126},{"id":"2312.13558","title":"The Truth is in There: Improving Reasoning in Language Models with Layer-Selective Rank Reduction","created":"2023-12-21","cited_by_count":123},{"id":"2306.11222","title":"LoSparse: Structured Compression of Large Language Models based on Low-Rank and Sparse Approximation","created":"2023-06-20","cited_by_count":104},{"id":"2111.00035","title":"Skyformer: Remodel Self-Attention with Gaussian Kernel and Nystr\\\"om Method","created":"2021-10-29","cited_by_count":63},{"id":"2405.18886","title":"Compressing Large Language Models using Low Rank and Low Precision Decomposition","created":"2024-05-29","cited_by_count":59},{"id":"2105.01029","title":"Initialization and Regularization of Factorized Neural Layers","created":"2021-05-03","cited_by_count":58},{"id":"2408.09632","title":"MoDeGPT: Modular Decomposition for Large Language Model Compression","created":"2024-08-19","cited_by_count":48},{"id":"2308.12043","title":"IncreLoRA: Incremental Parameter Allocation Method for Parameter-Efficient Fine-tuning","created":"2023-08-23","cited_by_count":45},{"id":"2406.02214","title":"SLTrain: a sparse plus low-rank approach for parameter and memory efficient pretraining","created":"2024-06-04","cited_by_count":45},{"id":"2205.13571","title":"Low-rank lottery tickets: finding efficient low-rank neural networks via matrix differential equations","created":"2022-05-26","cited_by_count":43},{"id":"2312.17244","title":"The LLM Surgeon","created":"2023-12-28","cited_by_count":38},{"id":"2209.13569","title":"Exploring Low Rank Training of Deep Neural Networks","created":"2022-09-27","cited_by_count":30},{"id":"2309.14021","title":"LORD: Low Rank Decomposition Of Monolingual Code LLMs For One-Shot Compression","created":"2023-09-25","cited_by_count":26},{"id":"2409.13652","title":"OATS: Outlier-Aware Pruning Through Sparse and Low Rank Decomposition","created":"2024-09-20","cited_by_count":20},{"id":"2410.05437","title":"ESPACE: Dimensionality Reduction of Activations for Model Compression","created":"2024-10-07","cited_by_count":15},{"id":"2306.01485","title":"Robust low-rank training via approximate orthonormal constraints","created":"2023-06-02","cited_by_count":13},{"id":"2306.14152","title":"Low-Rank Prune-And-Factorize for Language Model Compression","created":"2023-06-25","cited_by_count":11},{"id":"2306.11250","title":"InRank: Incremental Low-Rank Learning","created":"2023-06-20","cited_by_count":10},{"id":"2108.00065","title":"Model Preserving Compression for Neural Networks","created":"2021-07-30","cited_by_count":9},{"id":"2410.21271","title":"EoRA: Fine-tuning-free Compensation for Compressed LLM with Eigenspace Low-Rank Approximation","created":"2024-10-28","cited_by_count":7},{"id":"2112.05359","title":"Sketching as a Tool for Understanding and Accelerating Self-attention for Long Sequences","created":"2021-12-10","cited_by_count":5},{"id":"2501.19090","title":"Pivoting Factorization: A Compact Meta Low-Rank Representation of Sparsity for Efficient Inference in Large Language Models","created":"2025-01-31","cited_by_count":4}],"next_cursor":null}