{"list":"other","total":77,"rows":[{"id":"1706.03762","title":"Attention Is All You Need","created":"2017-06-12","cited_by_count":60361},{"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":"2407.21783","title":"The Llama 3 Herd of Models","created":"2024-07-31","cited_by_count":14715},{"id":"1910.10683","title":"Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer","created":"2019-10-23","cited_by_count":14599},{"id":"2201.11903","title":"Chain-of-Thought Prompting Elicits Reasoning in Large Language Models","created":"2022-01-28","cited_by_count":12459},{"id":"2110.14168","title":"Training Verifiers to Solve Math Word Problems","created":"2021-10-27","cited_by_count":10109},{"id":"2009.03300","title":"Measuring Massive Multitask Language Understanding","created":"2020-09-07","cited_by_count":7963},{"id":"2001.08361","title":"Scaling Laws for Neural Language Models","created":"2020-01-23","cited_by_count":6586},{"id":"2501.12948","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","created":"2025-01-22","cited_by_count":6330},{"id":"2103.03874","title":"Measuring Mathematical Problem Solving With the MATH Dataset","created":"2021-03-05","cited_by_count":5371},{"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":"2205.11916","title":"Large Language Models are Zero-Shot Reasoners","created":"2022-05-24","cited_by_count":4374},{"id":"1905.07830","title":"HellaSwag: Can a Machine Really Finish Your Sentence?","created":"2019-05-19","cited_by_count":4100},{"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":"2203.15556","title":"Training Compute-Optimal Large Language Models","created":"2022-03-29","cited_by_count":3019},{"id":"1705.03551","title":"TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehension","created":"2017-05-09","cited_by_count":2955},{"id":"1909.11942","title":"ALBERT: A Lite BERT for Self-supervised Learning of Language Representations","created":"2019-09-26","cited_by_count":2790},{"id":"1311.2901","title":"Visualizing and Understanding Convolutional Networks","created":"2013-11-12","cited_by_count":2290},{"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":"1308.3432","title":"Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computation","created":"2013-08-15","cited_by_count":2079},{"id":"2406.01574","title":"MMLU-Pro: A More Robust and Challenging Multi-Task Language Understanding Benchmark","created":"2024-06-03","cited_by_count":1848},{"id":"1811.00937","title":"CommonsenseQA: A Question Answering Challenge Targeting Commonsense Knowledge","created":"2018-11-02","cited_by_count":1822},{"id":"2210.09261","title":"Challenging BIG-Bench Tasks and Whether Chain-of-Thought Can Solve Them","created":"2022-10-17","cited_by_count":1807},{"id":"1603.09382","title":"Deep Networks with Stochastic Depth","created":"2016-03-30","cited_by_count":979},{"id":"2209.10652","title":"Toy Models of Superposition","created":"2022-09-21","cited_by_count":971},{"id":"2209.11895","title":"In-context Learning and Induction Heads","created":"2022-09-24","cited_by_count":964},{"id":"1903.00161","title":"DROP: A Reading Comprehension Benchmark Requiring Discrete Reasoning Over Paragraphs","created":"2019-03-01","cited_by_count":903},{"id":"2301.05217","title":"Progress measures for grokking via mechanistic interpretability","created":"2023-01-12","cited_by_count":839},{"id":"2412.06769","title":"Training Large Language Models to Reason in a Continuous Latent Space","created":"2024-12-09","cited_by_count":797},{"id":"2304.06364","title":"AGIEval: A Human-Centric Benchmark for Evaluating Foundation Models","created":"2023-04-13","cited_by_count":716},{"id":"1704.05796","title":"Network Dissection: Quantifying Interpretability of Deep Visual Representations","created":"2017-04-19","cited_by_count":708},{"id":"1807.03819","title":"Universal Transformers","created":"2018-07-10","cited_by_count":647},{"id":"1709.01686","title":"BranchyNet: Fast Inference via Early Exiting from Deep Neural Networks","created":"2017-09-06","cited_by_count":596},{"id":"1603.08983","title":"Adaptive Computation Time for Recurrent Neural Networks","created":"2016-03-29","cited_by_count":506},{"id":"2210.13382","title":"Emergent World Representations: Exploring a Sequence Model Trained on a Synthetic Task","created":"2022-10-24","cited_by_count":431},{"id":"2501.00656","title":"2 OLMo 2 Furious","created":"2024-12-31","cited_by_count":340},{"id":"2502.02013","title":"Layer by Layer: Uncovering Hidden Representations in Language Models","created":"2025-02-04","cited_by_count":311},{"id":"2207.07061","title":"Confident Adaptive Language Modeling","created":"2022-07-14","cited_by_count":310},{"id":"2404.16710","title":"LayerSkip: Enabling Early Exit Inference and Self-Speculative Decoding","created":"2024-04-25","cited_by_count":307},{"id":"2305.15408","title":"Towards Revealing the Mystery behind Chain of Thought: A Theoretical Perspective","created":"2023-05-24","cited_by_count":294},{"id":"2402.12875","title":"Chain of Thought Empowers Transformers to Solve Inherently Serial Problems","created":"2024-02-20","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":"2004.04037","title":"DynaBERT: Dynamic BERT with Adaptive Width and Depth","created":"2020-04-08","cited_by_count":251},{"id":"2301.13196","title":"Looped Transformers as Programmable Computers","created":"2023-01-30","cited_by_count":237},{"id":"1910.10073","title":"Depth-Adaptive Transformer","created":"2019-10-22","cited_by_count":236},{"id":"2402.14905","title":"MobileLLM: Optimizing Sub-billion Parameter Language Models for On-Device Use Cases","created":"2024-02-22","cited_by_count":223},{"id":"1511.06297","title":"Conditional Computation in Neural Networks for faster models","created":"2015-11-19","cited_by_count":167},{"id":"2311.12424","title":"Looped Transformers are Better at Learning Learning Algorithms","created":"2023-11-21","cited_by_count":149},{"id":"2404.05405","title":"Physics of Language Models: Part 3.3, Knowledge Capacity Scaling Laws","created":"2024-04-08","cited_by_count":144},{"id":"2507.10524","title":"Mixture-of-Recursions: Learning Dynamic Recursive Depths for Adaptive Token-Level Computation","created":"2025-07-14","cited_by_count":133},{"id":"2403.08763","title":"Simple and Scalable Strategies to Continually Pre-train Large Language Models","created":"2024-03-13","cited_by_count":127},{"id":"2106.04537","title":"Can You Learn an Algorithm? Generalizing from Easy to Hard Problems with Recurrent Networks","created":"2021-06-08","cited_by_count":117},{"id":"2402.01761","title":"Rethinking Interpretability in the Era of Large Language Models","created":"2024-01-30","cited_by_count":111},{"id":"2407.20311","title":"Physics of Language Models: Part 2.1, Grade-School Math and the Hidden Reasoning Process","created":"2024-07-29","cited_by_count":108},{"id":"2406.08446","title":"OLMES: A Standard for Language Model Evaluations","created":"2024-06-12","cited_by_count":106},{"id":"2409.15647","title":"Looped Transformers for Length Generalization","created":"2024-09-24","cited_by_count":99},{"id":"2305.15054","title":"A Mechanistic Interpretation of Arithmetic Reasoning in Language Models using Causal Mediation Analysis","created":"2023-05-24","cited_by_count":89},{"id":"2310.05424","title":"Fast and Robust Early-Exiting Framework for Autoregressive Language Models with Synchronized Parallel Decoding","created":"2023-10-09","cited_by_count":80},{"id":"2405.17399","title":"Transformers Can Do Arithmetic with the Right Embeddings","created":"2024-05-27","cited_by_count":78},{"id":"2410.20672","title":"Relaxed Recursive Transformers: Effective Parameter Sharing with Layer-wise LoRA","created":"2024-10-28","cited_by_count":78},{"id":"1509.08971","title":"Conditional Deep Learning for Energy-Efficient and Enhanced Pattern Recognition","created":"2015-09-29","cited_by_count":67},{"id":"2410.08292","title":"Can Looped Transformers Learn to Implement Multi-step Gradient Descent for In-context Learning?","created":"2024-10-10","cited_by_count":65},{"id":"2405.16039","title":"MoEUT: Mixture-of-Experts Universal Transformers","created":"2024-05-25","cited_by_count":59},{"id":"2406.03476","title":"Does your data spark joy? Performance gains from domain upsampling at the end of training","created":"2024-06-05","cited_by_count":52},{"id":"2310.07096","title":"Sparse Universal Transformer","created":"2023-10-11","cited_by_count":32},{"id":"2502.10835","title":"Back Attention: Understanding and Enhancing Multi-Hop Reasoning in Large Language Models","created":"2025-02-15","cited_by_count":23},{"id":"2404.01601","title":"What Can Transformer Learn with Varying Depth? Case Studies on Sequence Learning Tasks","created":"2024-04-02","cited_by_count":19},{"id":"2410.17875","title":"Understanding Layer Significance in LLM Alignment","created":"2024-10-23","cited_by_count":19},{"id":"2009.13102","title":"Deep Transformers with Latent Depth","created":"2020-09-28","cited_by_count":17},{"id":"2410.20008","title":"Layer by Layer: Uncovering Where Multi-Task Learning Happens in Instruction-Tuned Large Language Models","created":"2024-10-25","cited_by_count":15},{"id":"2410.13859","title":"$\\gamma-$MoD: Exploring Mixture-of-Depth Adaptation for Multimodal Large Language Models","created":"2024-10-17","cited_by_count":14},{"id":"2505.12075","title":"Do different prompting methods yield a common task representation in language models?","created":"2025-05-17","cited_by_count":11},{"id":"2401.12819","title":"Dynamic Layer Tying for Parameter-Efficient Transformers","created":"2024-01-23","cited_by_count":10},{"id":"2410.23451","title":"Rethinking Deep Thinking: Stable Learning of Algorithms using Lipschitz Constraints","created":"2024-10-30","cited_by_count":9},{"id":"2507.08567","title":"AbbIE: Autoregressive Block-Based Iterative Encoder for Efficient Sequence Modeling","created":"2025-07-11","cited_by_count":7}],"next_cursor":null}