{"total":55,"rows":[{"id":"2307.05782","title":"Large Language Models","created":"2023-07-11","cited_by_count":780,"area":null},{"id":"2305.18654","title":"Faith and Fate: Limits of Transformers on Compositionality","created":"2023-05-29","cited_by_count":503,"area":null},{"id":"2402.01032","title":"Repeat After Me: Transformers are Better than State Space Models at Copying","created":"2024-02-01","cited_by_count":216,"area":null},{"id":"2404.08819","title":"The Illusion of State in State-Space Models","created":"2024-04-12","cited_by_count":187,"area":null},{"id":"2311.00208","title":"What Formal Languages Can Transformers Express? A Survey","created":"2023-11-01","cited_by_count":124,"area":null},{"id":"2402.09963","title":"Why are Sensitive Functions Hard for Transformers?","created":"2024-02-15","cited_by_count":74,"area":null},{"id":"2503.03961","title":"A Little Depth Goes a Long Way: The Expressive Power of Log-Depth Transformers","created":"2025-03-05","cited_by_count":53,"area":null},{"id":"2310.13897","title":"Masked Hard-Attention Transformers Recognize Exactly the Star-Free Languages","created":"2023-10-21","cited_by_count":49,"area":null},{"id":"2405.17394","title":"The Expressive Capacity of State Space Models: A Formal Language Perspective","created":"2024-05-27","cited_by_count":46,"area":null},{"id":"2408.01367","title":"Transformers are Universal In-context Learners","created":"2024-08-02","cited_by_count":43,"area":null},{"id":"2404.04393","title":"Counting Like Transformers: Compiling Temporal Counting Logic Into Softmax Transformers","created":"2024-04-05","cited_by_count":39,"area":null},{"id":"2310.03817","title":"Logical Languages Accepted by Transformer Encoders with Hard Attention","created":"2023-10-05","cited_by_count":38,"area":null},{"id":"2404.14994","title":"Transformers Can Represent $n$-gram Language Models","created":"2024-04-23","cited_by_count":32,"area":null},{"id":"2406.09347","title":"Separations in the Representational Capabilities of Transformers and Recurrent Architectures","created":"2024-06-13","cited_by_count":29,"area":null},{"id":"2411.04551","title":"Measure-to-measure interpolation using Transformers","created":"2024-11-07","cited_by_count":29,"area":null},{"id":"2310.08540","title":"Do pretrained Transformers Learn In-Context by Gradient Descent?","created":"2023-10-12","cited_by_count":18,"area":null},{"id":"2505.23623","title":"Characterizing the Expressivity of Fixed-Precision Transformer Language Models","created":"2025-05-29","cited_by_count":14,"area":null},{"id":"2402.05359","title":"An Examination on the Effectiveness of Divide-and-Conquer Prompting in Large Language Models","created":"2024-02-08","cited_by_count":12,"area":null},{"id":"2411.01992","title":"Ask, and it shall be given: On the Turing completeness of prompting","created":"2024-11-04","cited_by_count":10,"area":null},{"id":"2503.14615","title":"Unique Hard Attention: A Tale of Two Sides","created":"2025-03-18","cited_by_count":10,"area":null},{"id":"2410.18077","title":"ALTA: Compiler-Based Analysis of Transformers","created":"2024-10-23","cited_by_count":7,"area":null},{"id":"2402.15478","title":"Transformers are Expressive, But Are They Expressive Enough for Regression?","created":"2024-02-23","cited_by_count":6,"area":null},{"id":"2509.22445","title":"Bridging Kolmogorov Complexity and Deep Learning: Asymptotically Optimal Description Length Objectives for Transformers","created":"2025-09-26","cited_by_count":6,"area":null},{"id":"2509.25611","title":"Transformers through the lens of support-preserving maps between measures","created":"2025-09-30","cited_by_count":6,"area":null},{"id":"2510.00368","title":"The Transformer Cookbook","created":"2025-10-01","cited_by_count":6,"area":null},{"id":"2405.18548","title":"Transformer Encoder Satisfiability: Complexity and Impact on Formal Reasoning","created":"2024-05-28","cited_by_count":5,"area":null},{"id":"2410.10101","title":"Learning Linear Attention in Polynomial Time","created":"2024-10-14","cited_by_count":5,"area":null},{"id":"2602.05896","title":"Parity, Sensitivity, and Transformers","created":"2026-02-05","cited_by_count":5,"area":null},{"id":"2403.09728","title":"Simulating Weighted Automata over Sequences and Trees with Transformers","created":"2024-03-12","cited_by_count":4,"area":null},{"id":"2603.02238","title":"Length Generalization Bounds for Transformers","created":"2026-02-13","cited_by_count":4,"area":null},{"id":"2306.17184","title":"State space models can express n-gram languages","created":"2023-06-20","cited_by_count":3,"area":null},{"id":"2605.00768","title":"Characterizing the Expressivity of Local Attention in Transformers","created":"2026-05-01","cited_by_count":3,"area":null},{"id":"2605.09867","title":"Continuous Latent Contexts Enable Efficient Online Learning in Transformers","created":"2026-05-11","cited_by_count":3,"area":null},{"id":"2309.00857","title":"Evaluating Transformer's Ability to Learn Mildly Context-Sensitive Languages","created":"2023-09-02","cited_by_count":2,"area":null},{"id":"2405.04515","title":"A Transformer with Stack Attention","created":"2024-05-07","cited_by_count":2,"area":null},{"id":"2508.01067","title":"Expressive Power of Graph Transformers via Logic","created":"2025-08-01","cited_by_count":2,"area":null},{"id":"2508.08293","title":"Topos Theory for Generative AI and LLMs","created":"2025-08-05","cited_by_count":2,"area":null},{"id":"2602.21307","title":"SymTorch: Symbolic Distillation of Neural Networks","created":"2026-02-24","cited_by_count":2,"area":null},{"id":"2605.28075","title":"Measure-to-measure Regression with Transformers","created":"2026-05-27","cited_by_count":2,"area":null},{"id":"2607.22361","title":"Indexing: the Beginning and the End","created":"2026-07-24","cited_by_count":2,"area":null},{"id":"2312.09048","title":"On The Expressivity of Recurrent Neural Cascades","created":"2023-12-14","cited_by_count":1,"area":null},{"id":"2406.12915","title":"How Out-of-Distribution Detection Learning Theory Enhances Transformer: Learnability and Reliability","created":"2024-06-13","cited_by_count":1,"area":null},{"id":"2603.11161","title":"Algorithmic Task Capture, Computational Complexity, and Inductive Bias of Infinite Transformers","created":"2026-03-11","cited_by_count":1,"area":null},{"id":"2608.04243","title":"Attention-based representations for multi-task computation","created":"2026-08-04","cited_by_count":1,"area":null},{"id":"2608.11909","title":"Disentangling the Expressivity of RoPE","created":"2026-08-12","cited_by_count":1,"area":null},{"id":"2405.11657","title":"On the Expressivity of Recurrent Neural Cascades with Identity","created":"2024-05-19","cited_by_count":0,"area":null},{"id":"2410.06211","title":"A mechanistically interpretable neural network for regulatory genomics","created":"2024-10-08","cited_by_count":0,"area":null},{"id":"2601.21618","title":"Semantic Content Determines Algorithmic Performance","created":"2026-01-29","cited_by_count":0,"area":null},{"id":"2604.15769","title":"Closing the Theory-Practice Gap in Spiking Transformers via Effective Dimension","created":"2026-04-17","cited_by_count":0,"area":null},{"id":"2605.04683","title":"Average Attention Transformers and Arithmetic Circuits","created":"2026-05-06","cited_by_count":0,"area":null},{"id":"2605.07705","title":"Encoder-Decoder Transformers: Logical Characterizations and Periodicity","created":"2026-05-08","cited_by_count":0,"area":null},{"id":"2605.10393","title":"The Polynomial Counting Capabilities of Message Passing Neural Networks","created":"2026-05-11","cited_by_count":0,"area":null},{"id":"2605.13687","title":"A Hierarchical Language Model with Predictable Scaling Laws and Provable Benefits of Reasoning","created":"2026-05-13","cited_by_count":0,"area":null},{"id":"2608.12671","title":"On the Expressive Power of Transformers","created":"2026-08-13","cited_by_count":0,"area":null},{"id":"2610.14030","title":"Rotate the Loop: Blockwise Conformality for Looped Transformers","created":"2026-09-30","cited_by_count":0,"area":null}],"next_cursor":null}