{"list":"other","total":66,"rows":[{"id":"1706.03762","title":"Attention Is All You Need","created":"2017-06-12","cited_by_count":60361},{"id":"1810.04805","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","created":"2018-10-11","cited_by_count":40399},{"id":"2005.14165","title":"Language Models are Few-Shot Learners","created":"2020-05-28","cited_by_count":32419},{"id":"2303.08774","title":"GPT-4 Technical Report","created":"2023-03-15","cited_by_count":18396},{"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":"2108.07258","title":"On the Opportunities and Risks of Foundation Models","created":"2021-08-16","cited_by_count":4033},{"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":"2111.00396","title":"Efficiently Modeling Long Sequences with Structured State Spaces","created":"2021-10-31","cited_by_count":2465},{"id":"1308.3432","title":"Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computation","created":"2013-08-15","cited_by_count":2079},{"id":"2006.16236","title":"Transformers are RNNs: Fast Autoregressive Transformers with Linear Attention","created":"2020-06-29","cited_by_count":2022},{"id":"1901.02860","title":"Transformer-XL: Attentive Language Models Beyond a Fixed-Length Context","created":"2019-01-09","cited_by_count":1850},{"id":"1711.05101","title":"Decoupled Weight Decay Regularization","created":"2017-11-14","cited_by_count":1831},{"id":"2304.01373","title":"Pythia: A Suite for Analyzing Large Language Models Across Training and Scaling","created":"2023-04-03","cited_by_count":1786},{"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":"2308.14508","title":"LongBench: A Bilingual, Multitask Benchmark for Long Context Understanding","created":"2023-08-28","cited_by_count":1417},{"id":"1506.06724","title":"Aligning Books and Movies: Towards Story-like Visual Explanations by Watching Movies and Reading Books","created":"2015-06-22","cited_by_count":1043},{"id":"1906.04341","title":"What Does BERT Look At? An Analysis of BERT's Attention","created":"2019-06-11","cited_by_count":1003},{"id":"2306.14048","title":"H$_2$O: Heavy-Hitter Oracle for Efficient Generative Inference of Large Language Models","created":"2023-06-24","cited_by_count":832},{"id":"2305.13048","title":"RWKV: Reinventing RNNs for the Transformer Era","created":"2023-05-22","cited_by_count":827},{"id":"2208.04933","title":"Simplified State Space Layers for Sequence Modeling","created":"2022-08-09","cited_by_count":788},{"id":"1802.05751","title":"Image Transformer","created":"2018-02-15","cited_by_count":772},{"id":"1911.05507","title":"Compressive Transformers for Long-Range Sequence Modelling","created":"2019-11-13","cited_by_count":726},{"id":"2307.08621","title":"Retentive Network: A Successor to Transformer for Large Language Models","created":"2023-07-17","cited_by_count":613},{"id":"2312.06635","title":"Gated Linear Attention Transformers with Hardware-Efficient Training","created":"2023-12-11","cited_by_count":514},{"id":"2310.01801","title":"Model Tells You What to Discard: Adaptive KV Cache Compression for LLMs","created":"2023-10-03","cited_by_count":474},{"id":"2003.05997","title":"Efficient Content-Based Sparse Attention with Routing Transformers","created":"2020-03-12","cited_by_count":471},{"id":"2305.17118","title":"Scissorhands: Exploiting the Persistence of Importance Hypothesis for LLM KV Cache Compression at Test Time","created":"2023-05-26","cited_by_count":439},{"id":"2303.06349","title":"Resurrecting Recurrent Neural Networks for Long Sequences","created":"2023-03-11","cited_by_count":408},{"id":"1912.12180","title":"Axial Attention in Multidimensional Transformers","created":"2019-12-20","cited_by_count":358},{"id":"2305.14788","title":"Adapting Language Models to Compress Contexts","created":"2023-05-24","cited_by_count":356},{"id":"2103.02143","title":"Random Feature Attention","created":"2021-03-03","cited_by_count":354},{"id":"1602.02068","title":"From Softmax to Sparsemax: A Sparse Model of Attention and Multi-Label Classification","created":"2016-02-05","cited_by_count":341},{"id":"2002.11296","title":"Sparse Sinkhorn Attention","created":"2020-02-26","cited_by_count":251},{"id":"2309.12307","title":"LongLoRA: Efficient Fine-tuning of Long-Context Large Language Models","created":"2023-09-21","cited_by_count":244},{"id":"2305.16300","title":"Landmark Attention: Random-Access Infinite Context Length for Transformers","created":"2023-05-25","cited_by_count":213},{"id":"2307.02486","title":"LongNet: Scaling Transformers to 1,000,000,000 Tokens","created":"2023-07-05","cited_by_count":204},{"id":"2404.07143","title":"Leave No Context Behind: Efficient Infinite Context Transformers with Infini-attention","created":"2024-04-10","cited_by_count":200},{"id":"2202.10447","title":"Transformer Quality in Linear Time","created":"2022-02-21","cited_by_count":191},{"id":"2402.10171","title":"Data Engineering for Scaling Language Models to 128K Context","created":"2024-02-15","cited_by_count":186},{"id":"1905.05702","title":"Sparse Sequence-to-Sequence Models","created":"2019-05-14","cited_by_count":170},{"id":"2006.03236","title":"Funnel-Transformer: Filtering out Sequential Redundancy for Efficient Language Processing","created":"2020-06-05","cited_by_count":162},{"id":"1911.02972","title":"Blockwise Self-Attention for Long Document Understanding","created":"2019-11-07","cited_by_count":159},{"id":"1905.07799","title":"Adaptive Attention Span in Transformers","created":"2019-05-19","cited_by_count":149},{"id":"2110.15343","title":"Scatterbrain: Unifying Sparse and Low-rank Attention Approximation","created":"2021-10-28","cited_by_count":130},{"id":"1709.04057","title":"Parallelizing Linear Recurrent Neural Nets Over Sequence Length","created":"2017-09-12","cited_by_count":127},{"id":"2308.16137","title":"LM-Infinite: Zero-Shot Extreme Length Generalization for Large Language Models","created":"2023-08-30","cited_by_count":124},{"id":"2007.04825","title":"Fast Transformers with Clustered Attention","created":"2020-07-09","cited_by_count":123},{"id":"2402.04347","title":"The Hedgehog & the Porcupine: Expressive Linear Attentions with Softmax Mimicry","created":"2024-02-06","cited_by_count":120},{"id":"2306.14893","title":"LongCoder: A Long-Range Pre-trained Language Model for Code Completion","created":"2023-06-26","cited_by_count":112},{"id":"2203.07852","title":"Block-Recurrent Transformers","created":"2022-03-11","cited_by_count":110},{"id":"2109.09115","title":"Do Long-Range Language Models Actually Use Long-Range Context?","created":"2021-09-19","cited_by_count":92},{"id":"2303.09752","title":"CoLT5: Faster Long-Range Transformers with Conditional Computation","created":"2023-03-17","cited_by_count":84},{"id":"2304.04947","title":"Conditional Adapters: Parameter-efficient Transfer Learning with Fast Inference","created":"2023-04-11","cited_by_count":69},{"id":"2305.15805","title":"Dynamic Context Pruning for Efficient and Interpretable Autoregressive Transformers","created":"2023-05-25","cited_by_count":67},{"id":"2107.05768","title":"Combiner: Full Attention Transformer with Sparse Computation Cost","created":"2021-07-12","cited_by_count":64},{"id":"2106.06899","title":"Memory-efficient Transformers via Top-$k$ Attention","created":"2021-06-13","cited_by_count":60},{"id":"2405.03133","title":"Lory: Fully Differentiable Mixture-of-Experts for Autoregressive Language Model Pre-training","created":"2024-05-06","cited_by_count":37},{"id":"2306.01160","title":"Faster Causal Attention Over Large Sequences Through Sparse Flash Attention","created":"2023-06-01","cited_by_count":25},{"id":"2007.03356","title":"Do Transformers Need Deep Long-Range Memory","created":"2020-07-07","cited_by_count":24},{"id":"2310.15494","title":"TRAMS: Training-free Memory Selection for Long-range Language Modeling","created":"2023-10-24","cited_by_count":5}],"next_cursor":null}