{"list":"other","total":58,"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":"2501.12948","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","created":"2025-01-22","cited_by_count":6330},{"id":"2104.09864","title":"RoFormer: Enhanced Transformer with Rotary Position Embedding","created":"2021-04-20","cited_by_count":4703},{"id":"1809.09600","title":"HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answering","created":"2018-09-25","cited_by_count":3754},{"id":"2205.14135","title":"FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awareness","created":"2022-05-27","cited_by_count":3673},{"id":"1701.06538","title":"Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer","created":"2017-01-23","cited_by_count":3509},{"id":"2004.05150","title":"Longformer: The Long-Document Transformer","created":"2020-04-10","cited_by_count":3413},{"id":"2101.03961","title":"Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity","created":"2021-01-11","cited_by_count":3073},{"id":"1705.03551","title":"TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehension","created":"2017-05-09","cited_by_count":2955},{"id":"1611.01144","title":"Categorical Reparameterization with Gumbel-Softmax","created":"2016-11-03","cited_by_count":2739},{"id":"2307.08691","title":"FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioning","created":"2023-07-17","cited_by_count":2598},{"id":"2309.17453","title":"Efficient Streaming Language Models with Attention Sinks","created":"2023-09-29","cited_by_count":2186},{"id":"1806.09055","title":"DARTS: Differentiable Architecture Search","created":"2018-06-24","cited_by_count":1798},{"id":"1904.10509","title":"Generating Long Sequences with Sparse Transformers","created":"2019-04-23","cited_by_count":1546},{"id":"1611.01578","title":"Neural Architecture Search with Reinforcement Learning","created":"2016-11-05","cited_by_count":1499},{"id":"2308.14508","title":"LongBench: A Bilingual, Multitask Benchmark for Long Context Understanding","created":"2023-08-28","cited_by_count":1417},{"id":"2305.13245","title":"GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpoints","created":"2023-05-22","cited_by_count":1346},{"id":"2404.06654","title":"RULER: What's the Real Context Size of Your Long-Context Language Models?","created":"2024-04-09","cited_by_count":1346},{"id":"2011.01060","title":"Constructing A Multi-hop QA Dataset for Comprehensive Evaluation of Reasoning Steps","created":"2020-11-02","cited_by_count":1282},{"id":"1611.00712","title":"The Concrete Distribution: A Continuous Relaxation of Discrete Random Variables","created":"2016-11-02","cited_by_count":1148},{"id":"1707.07012","title":"Learning Transferable Architectures for Scalable Image Recognition","created":"2017-07-21","cited_by_count":1101},{"id":"2108.00573","title":"MuSiQue: Multihop Questions via Single-hop Question Composition","created":"2021-08-02","cited_by_count":916},{"id":"2106.02034","title":"DynamicViT: Efficient Vision Transformers with Dynamic Token Sparsification","created":"2021-06-03","cited_by_count":864},{"id":"1802.03268","title":"Efficient Neural Architecture Search via Parameter Sharing","created":"2018-02-09","cited_by_count":837},{"id":"1911.05507","title":"Compressive Transformers for Long-Range Sequence Modelling","created":"2019-11-13","cited_by_count":726},{"id":"1712.07040","title":"The NarrativeQA Reading Comprehension Challenge","created":"2017-12-19","cited_by_count":597},{"id":"1911.12237","title":"SAMSum Corpus: A Human-annotated Dialogue Dataset for Abstractive Summarization","created":"2019-11-27","cited_by_count":535},{"id":"2105.03011","title":"A Dataset of Information-Seeking Questions and Answers Anchored in Research Papers","created":"2021-05-07","cited_by_count":486},{"id":"2301.13848","title":"Benchmarking Large Language Models for News Summarization","created":"2023-01-31","cited_by_count":445},{"id":"1906.01749","title":"Multi-News: a Large-Scale Multi-Document Summarization Dataset and Abstractive Hierarchical Model","created":"2019-06-04","cited_by_count":431},{"id":"2502.11089","title":"Native Sparse Attention: Hardware-Aligned and Natively Trainable Sparse Attention","created":"2025-02-16","cited_by_count":407},{"id":"2407.02490","title":"MInference 1.0: Accelerating Pre-filling for Long-Context LLMs via Dynamic Sparse Attention","created":"2024-07-02","cited_by_count":383},{"id":"2104.05938","title":"QMSum: A New Benchmark for Query-based Multi-domain Meeting Summarization","created":"2021-04-13","cited_by_count":365},{"id":"2306.03091","title":"RepoBench: Benchmarking Repository-Level Code Auto-Completion Systems","created":"2023-06-05","cited_by_count":353},{"id":"2403.12968","title":"LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression","created":"2024-03-19","cited_by_count":348},{"id":"2104.02112","title":"Efficient Attentions for Long Document Summarization","created":"2021-04-05","cited_by_count":345},{"id":"1910.04465","title":"Searching for A Robust Neural Architecture in Four GPU Hours","created":"2019-10-10","cited_by_count":260},{"id":"2404.02258","title":"Mixture-of-Depths: Dynamically allocating compute in transformer-based language models","created":"2024-04-02","cited_by_count":258},{"id":"1502.07943","title":"Non-stochastic Best Arm Identification and Hyperparameter Optimization","created":"2015-02-27","cited_by_count":221},{"id":"2305.16300","title":"Landmark Attention: Random-Access Infinite Context Length for Transformers","created":"2023-05-25","cited_by_count":213},{"id":"2402.04617","title":"InfLLM: Training-Free Long-Context Extrapolation for LLMs with an Efficient Context Memory","created":"2024-02-07","cited_by_count":197},{"id":"2308.16369","title":"SARATHI: Efficient LLM Inference by Piggybacking Decodes with Chunked Prefills","created":"2023-08-31","cited_by_count":193},{"id":"2402.18013","title":"A Survey on Recent Advances in LLM-Based Multi-turn Dialogue Systems","created":"2024-02-28","cited_by_count":170},{"id":"2107.00910","title":"Learned Token Pruning for Transformers","created":"2021-07-02","cited_by_count":139},{"id":"2301.08727","title":"Neural Architecture Search: Insights from 1000 Papers","created":"2023-01-20","cited_by_count":139},{"id":"2410.13276","title":"SeerAttention: Learning Intrinsic Sparse Attention in Your LLMs","created":"2024-10-17","cited_by_count":124},{"id":"2403.09636","title":"Dynamic Memory Compression: Retrofitting LLMs for Accelerated Inference","created":"2024-03-14","cited_by_count":116},{"id":"2306.14893","title":"LongCoder: A Long-Range Pre-trained Language Model for Code Completion","created":"2023-06-26","cited_by_count":112},{"id":"1711.05073","title":"DuReader: a Chinese Machine Reading Comprehension Dataset from Real-world Applications","created":"2017-11-14","cited_by_count":110},{"id":"2211.09761","title":"Efficient Transformers with Dynamic Token Pooling","created":"2022-11-17","cited_by_count":76},{"id":"2305.15805","title":"Dynamic Context Pruning for Efficient and Interpretable Autoregressive Transformers","created":"2023-05-25","cited_by_count":67},{"id":"2406.16747","title":"Sparser is Faster and Less is More: Efficient Sparse Attention for Long-Range Transformers","created":"2024-06-24","cited_by_count":52},{"id":"2406.14909","title":"Mixture of Attention Spans: Optimizing LLM Inference Efficiency with Heterogeneous Sliding-Window Lengths","created":"2024-06-21","cited_by_count":44},{"id":"2412.12094","title":"SepLLM: Accelerate Large Language Models by Compressing One Segment into One Separator","created":"2024-12-16","cited_by_count":41},{"id":"2305.05280","title":"VCSUM: A Versatile Chinese Meeting Summarization Dataset","created":"2023-05-09","cited_by_count":18},{"id":"2406.09827","title":"A Training-free Sub-quadratic Cost Transformer Model Serving Framework With Hierarchically Pruned Attention","created":"2024-06-14","cited_by_count":12}],"next_cursor":null}