{"list":"other","total":56,"rows":[{"id":"1706.03762","title":"Attention Is All You Need","created":"2017-06-12","cited_by_count":60443},{"id":"1512.03385","title":"Deep Residual Learning for Image Recognition","created":"2015-12-10","cited_by_count":52148},{"id":"1412.6980","title":"Adam: A Method for Stochastic Optimization","created":"2014-12-22","cited_by_count":37471},{"id":"2005.14165","title":"Language Models are Few-Shot Learners","created":"2020-05-28","cited_by_count":32492},{"id":"2203.02155","title":"Training language models to follow instructions with human feedback","created":"2022-03-04","cited_by_count":16029},{"id":"2407.21783","title":"The Llama 3 Herd of Models","created":"2024-07-31","cited_by_count":14983},{"id":"2201.11903","title":"Chain-of-Thought Prompting Elicits Reasoning in Large Language Models","created":"2022-01-28","cited_by_count":12501},{"id":"2501.12948","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","created":"2025-01-22","cited_by_count":6504},{"id":"1607.06450","title":"Layer Normalization","created":"2016-07-21","cited_by_count":5723},{"id":"1703.03400","title":"Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks","created":"2017-03-09","cited_by_count":4900},{"id":"2205.11916","title":"Large Language Models are Zero-Shot Reasoners","created":"2022-05-24","cited_by_count":4392},{"id":"2101.00190","title":"Prefix-Tuning: Optimizing Continuous Prompts for Generation","created":"2021-01-01","cited_by_count":3927},{"id":"1706.03741","title":"Deep reinforcement learning from human preferences","created":"2017-06-12","cited_by_count":3919},{"id":"2109.01652","title":"Finetuned Language Models Are Zero-Shot Learners","created":"2021-09-03","cited_by_count":3795},{"id":"2204.05862","title":"Training a Helpful and Harmless Assistant with Reinforcement Learning from Human Feedback","created":"2022-04-12","cited_by_count":3762},{"id":"2403.05530","title":"Gemini 1.5: Unlocking multimodal understanding across millions of tokens of context","created":"2024-03-08","cited_by_count":3268},{"id":"2212.08073","title":"Constitutional AI: Harmlessness from AI Feedback","created":"2022-12-15","cited_by_count":3095},{"id":"2210.11416","title":"Scaling Instruction-Finetuned Language Models","created":"2022-10-20","cited_by_count":3030},{"id":"2009.01325","title":"Learning to summarize from human feedback","created":"2020-09-02","cited_by_count":2594},{"id":"2309.17453","title":"Efficient Streaming Language Models with Attention Sinks","created":"2023-09-29","cited_by_count":2214},{"id":"2101.06804","title":"What Makes Good In-Context Examples for GPT-$3$?","created":"2021-01-17","cited_by_count":1198},{"id":"2211.01910","title":"Large Language Models Are Human-Level Prompt Engineers","created":"2022-11-03","cited_by_count":1052},{"id":"2310.01798","title":"Large Language Models Cannot Self-Correct Reasoning Yet","created":"2023-10-03","cited_by_count":1026},{"id":"2203.14465","title":"STaR: Bootstrapping Reasoning With Reasoning","created":"2022-03-28","cited_by_count":949},{"id":"2112.00114","title":"Show Your Work: Scratchpads for Intermediate Computation with Language Models","created":"2021-11-30","cited_by_count":895},{"id":"1807.03819","title":"Universal Transformers","created":"2018-07-10","cited_by_count":657},{"id":"2410.05229","title":"GSM-Symbolic: Understanding the Limitations of Mathematical Reasoning in Large Language Models","created":"2024-10-07","cited_by_count":555},{"id":"2305.15408","title":"Towards Revealing the Mystery behind Chain of Thought: A Theoretical Perspective","created":"2023-05-24","cited_by_count":294},{"id":"2310.02226","title":"Think before you speak: Training Language Models With Pause Tokens","created":"2023-10-03","cited_by_count":268},{"id":"2402.12875","title":"Chain of Thought Empowers Transformers to Solve Inherently Serial Problems","created":"2024-02-20","cited_by_count":263},{"id":"2301.13196","title":"Looped Transformers as Programmable Computers","created":"2023-01-30","cited_by_count":239},{"id":"2404.08819","title":"The Illusion of State in State-Space Models","created":"2024-04-12","cited_by_count":190},{"id":"2106.06981","title":"Thinking Like Transformers","created":"2021-06-13","cited_by_count":185},{"id":"2106.13353","title":"Cutting Down on Prompts and Parameters: Simple Few-Shot Learning with Language Models","created":"2021-06-24","cited_by_count":139},{"id":"2106.16213","title":"Saturated Transformers are Constant-Depth Threshold Circuits","created":"2021-06-30","cited_by_count":139},{"id":"1901.03429","title":"On the Turing Completeness of Modern Neural Network Architectures","created":"2019-01-10","cited_by_count":129},{"id":"1511.08228","title":"Neural GPUs Learn Algorithms","created":"2015-11-25","cited_by_count":122},{"id":"1805.04908","title":"On the Practical Computational Power of Finite Precision RNNs for Language Recognition","created":"2018-05-13","cited_by_count":117},{"id":"2107.13163","title":"Statistically Meaningful Approximation: a Case Study on Approximating Turing Machines with Transformers","created":"2021-07-28","cited_by_count":102},{"id":"2006.09286","title":"On the Computational Power of Transformers and its Implications in Sequence Modeling","created":"2020-06-16","cited_by_count":85},{"id":"2310.14735","title":"Unleashing the potential of prompt engineering for large language models","created":"2023-10-23","cited_by_count":76},{"id":"2406.11050","title":"A Peek into Token Bias: Large Language Models Are Not Yet Genuine Reasoners","created":"2024-06-16","cited_by_count":73},{"id":"2309.06979","title":"Auto-Regressive Next-Token Predictors are Universal Learners","created":"2023-09-13","cited_by_count":72},{"id":"2504.07139","title":"Artificial Intelligence Index Report 2025","created":"2025-04-08","cited_by_count":68},{"id":"1710.11622","title":"Meta-Learning and Universality: Deep Representations and Gradient Descent can Approximate any Learning Algorithm","created":"2017-10-31","cited_by_count":65},{"id":"2004.08500","title":"A Formal Hierarchy of RNN Architectures","created":"2020-04-18","cited_by_count":62},{"id":"1506.02516","title":"Learning to Transduce with Unbounded Memory","created":"2015-06-08","cited_by_count":54},{"id":"2301.04589","title":"Memory Augmented Large Language Models are Computationally Universal","created":"2023-01-10","cited_by_count":47},{"id":"2310.05900","title":"Learning to Decode the Surface Code with a Recurrent, Transformer-Based Neural Network","created":"2023-10-09","cited_by_count":42},{"id":"1906.06349","title":"On the Computational Power of RNNs","created":"2019-06-14","cited_by_count":35},{"id":"1511.06392","title":"Neural Random-Access Machines","created":"2015-11-19","cited_by_count":34},{"id":"2406.09347","title":"Separations in the Representational Capabilities of Transformers and Recurrent Architectures","created":"2024-06-13","cited_by_count":29},{"id":"2405.19522","title":"Artificial Intelligence Index Report 2024","created":"2024-05-29","cited_by_count":25},{"id":"2407.03310","title":"Universal Length Generalization with Turing Programs","created":"2024-07-03","cited_by_count":25},{"id":"2310.16076","title":"Practical Computational Power of Linear Transformers and Their Recurrent and Self-Referential Extensions","created":"2023-10-24","cited_by_count":20},{"id":"2410.03170","title":"Autoregressive Large Language Models are Computationally Universal","created":"2024-10-04","cited_by_count":17}],"next_cursor":null}