{"total":105,"rows":[{"id":"2208.01066","title":"What Can Transformers Learn In-Context? A Case Study of Simple Function Classes","created":"2022-08-01","cited_by_count":715,"area":null},{"id":"2306.04637","title":"Transformers as Statisticians: Provable In-Context Learning with In-Context Algorithm Selection","created":"2023-06-07","cited_by_count":298,"area":null},{"id":"2210.10749","title":"Transformers Learn Shortcuts to Automata","created":"2022-10-19","cited_by_count":268,"area":null},{"id":"2402.12875","title":"Chain of Thought Empowers Transformers to Solve Inherently Serial Problems","created":"2024-02-20","cited_by_count":260,"area":"lr"},{"id":"2106.06981","title":"Thinking Like Transformers","created":"2021-06-13","cited_by_count":184,"area":null},{"id":"2106.16213","title":"Saturated Transformers are Constant-Depth Threshold Circuits","created":"2021-06-30","cited_by_count":139,"area":null},{"id":"2306.02896","title":"Representational Strengths and Limitations of Transformers","created":"2023-06-05","cited_by_count":133,"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":"2206.04301","title":"Unveiling Transformers with LEGO: a synthetic reasoning task","created":"2022-06-09","cited_by_count":106,"area":null},{"id":"2305.16380","title":"Scan and Snap: Understanding Training Dynamics and Token Composition in 1-layer Transformer","created":"2023-05-25","cited_by_count":102,"area":null},{"id":"2204.06618","title":"Formal Language Recognition by Hard Attention Transformers: Perspectives from Circuit Complexity","created":"2022-04-13","cited_by_count":93,"area":null},{"id":"2303.04245","title":"How Do Transformers Learn Topic Structure: Towards a Mechanistic Understanding","created":"2023-03-07","cited_by_count":86,"area":null},{"id":"2310.08566","title":"Transformers as Decision Makers: Provable In-Context Reinforcement Learning via Supervised Pretraining","created":"2023-10-12","cited_by_count":83,"area":"offlinerl"},{"id":"2505.12514","title":"Reasoning by Superposition: A Theoretical Perspective on Chain of Continuous Thought","created":"2025-05-18","cited_by_count":77,"area":"lr"},{"id":"2306.00946","title":"Exposing Attention Glitches with Flip-Flop Language Modeling","created":"2023-06-01","cited_by_count":75,"area":null},{"id":"2402.09963","title":"Why are Sensitive Functions Hard for Transformers?","created":"2024-02-15","cited_by_count":74,"area":null},{"id":"2211.12316","title":"Simplicity Bias in Transformers and their Ability to Learn Sparse Boolean Functions","created":"2022-11-22","cited_by_count":70,"area":null},{"id":"2402.08164","title":"On Limitations of the Transformer Architecture","created":"2024-02-13","cited_by_count":63,"area":null},{"id":"2310.00535","title":"JoMA: Demystifying Multilayer Transformers via JOint Dynamics of MLP and Attention","created":"2023-10-01","cited_by_count":52,"area":null},{"id":"2310.07923","title":"The Expressive Power of Transformers with Chain of Thought","created":"2023-10-11","cited_by_count":50,"area":"lr"},{"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":"2303.08117","title":"Do Transformers Parse while Predicting the Masked Word?","created":"2023-03-14","cited_by_count":48,"area":null},{"id":"2307.14023","title":"Are Transformers with One Layer Self-Attention Using Low-Rank Weight Matrices Universal Approximators?","created":"2023-07-26","cited_by_count":47,"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":"2412.02975","title":"Theoretical limitations of multi-layer Transformer","created":"2024-12-04","cited_by_count":45,"area":null},{"id":"2305.14701","title":"Modeling rapid language learning by distilling Bayesian priors into artificial neural networks","created":"2023-05-24","cited_by_count":42,"area":null},{"id":"2304.13276","title":"The Closeness of In-Context Learning and Weight Shifting for Softmax Regression","created":"2023-04-26","cited_by_count":41,"area":null},{"id":"2306.01128","title":"Learning Transformer Programs","created":"2023-06-01","cited_by_count":41,"area":"mechinterp"},{"id":"2307.11353","title":"What can a Single Attention Layer Learn? A Study Through the Random Features Lens","created":"2023-07-21","cited_by_count":40,"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":"2312.01429","title":"Transformers are uninterpretable with myopic methods: a case study with bounded Dyck grammars","created":"2023-12-03","cited_by_count":30,"area":null},{"id":"2306.02295","title":"A Mathematical Abstraction for Balancing the Trade-off Between Creativity and Reality in Large Language Models","created":"2023-06-04","cited_by_count":29,"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":"2405.04669","title":"Towards a Theoretical Understanding of the 'Reversal Curse' via Training Dynamics","created":"2024-05-07","cited_by_count":27,"area":"lr"},{"id":"2312.03656","title":"Interpretability Illusions in the Generalization of Simplified Models","created":"2023-12-06","cited_by_count":25,"area":null},{"id":"2405.20131","title":"Language Models Need Inductive Biases to Count Inductively","created":"2024-05-30","cited_by_count":25,"area":null},{"id":"2411.07107","title":"Training Neural Networks as Recognizers of Formal Languages","created":"2024-11-11","cited_by_count":24,"area":"lr"},{"id":"2405.05847","title":"Learned feature representations are biased by complexity, learning order, position, and more","created":"2024-05-09","cited_by_count":23,"area":null},{"id":"2406.06893","title":"Transformers Provably Learn Sparse Token Selection While Fully-Connected Nets Cannot","created":"2024-06-11","cited_by_count":22,"area":null},{"id":"2402.04084","title":"Provably learning a multi-head attention layer","created":"2024-02-06","cited_by_count":21,"area":null},{"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,"area":null},{"id":"2402.13934","title":"Do Efficient Transformers Really Save Computation?","created":"2024-02-21","cited_by_count":20,"area":null},{"id":"2310.19089","title":"Pushdown Layers: Encoding Recursive Structure in Transformer Language Models","created":"2023-10-29","cited_by_count":19,"area":null},{"id":"2305.14699","title":"Can Transformers Learn to Solve Problems Recursively?","created":"2023-05-24","cited_by_count":17,"area":null},{"id":"2307.01189","title":"Trainable Transformer in Transformer","created":"2023-07-03","cited_by_count":17,"area":null},{"id":"2310.01749","title":"Stack Attention: Improving the Ability of Transformers to Model Hierarchical Patterns","created":"2023-10-03","cited_by_count":17,"area":null},{"id":"2410.04368","title":"Algorithmic Capabilities of Random Transformers","created":"2024-10-06","cited_by_count":17,"area":null},{"id":"2410.07432","title":"Can Transformers Reason Logically? A Study in SAT Solving","created":"2024-10-09","cited_by_count":16,"area":"lr"},{"id":"2411.12892","title":"Selective Attention: Enhancing Transformer through Principled Context Control","created":"2024-11-19","cited_by_count":16,"area":null},{"id":"2310.11685","title":"Why Softmax Attention Outperforms Linear Attention","created":"2023-10-18","cited_by_count":15,"area":null},{"id":"2412.09925","title":"Simulating Hard Attention Using Soft Attention","created":"2024-12-13","cited_by_count":15,"area":null},{"id":"2401.12947","title":"Transformer-Based Models Are Not Yet Perfect At Learning to Emulate Structural Recursion","created":"2024-01-23","cited_by_count":14,"area":null},{"id":"2402.02212","title":"A Survey to Recent Progress Towards Understanding In-Context Learning","created":"2024-02-03","cited_by_count":14,"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":"2502.12123","title":"On the Query Complexity of Verifier-Assisted Language Generation","created":"2025-02-17","cited_by_count":12,"area":"lr"},{"id":"2506.05295","title":"Sample Complexity and Representation Ability of Test-time Scaling Paradigms","created":"2025-06-05","cited_by_count":12,"area":"lr"},{"id":"2503.14615","title":"Unique Hard Attention: A Tale of Two Sides","created":"2025-03-18","cited_by_count":10,"area":null},{"id":"2311.00684","title":"Attention Alignment and Flexible Positional Embeddings Improve Transformer Length Extrapolation","created":"2023-11-01","cited_by_count":9,"area":null},{"id":"2410.04271","title":"Fundamental Limitations on Subquadratic Alternatives to Transformers","created":"2024-10-05","cited_by_count":9,"area":"ssm"},{"id":"2404.02040","title":"Transformers as Transducers","created":"2024-04-02","cited_by_count":8,"area":null},{"id":"2410.18077","title":"ALTA: Compiler-Based Analysis of Transformers","created":"2024-10-23","cited_by_count":7,"area":null},{"id":"2407.21046","title":"Promises and Pitfalls of Generative Masked Language Modeling: Theoretical Framework and Practical Guidelines","created":"2024-07-22","cited_by_count":6,"area":null},{"id":"2506.05200","title":"Transformers Meet In-Context Learning: A Universal Approximation Theory","created":"2025-06-05","cited_by_count":6,"area":null},{"id":"2510.00368","title":"The Transformer Cookbook","created":"2025-10-01","cited_by_count":6,"area":null},{"id":"2511.11579","title":"Decoupling Positional and Symbolic Attention Behavior in Transformers","created":"2025-10-03","cited_by_count":6,"area":null},{"id":"2502.06007","title":"Transformers versus the EM Algorithm in Multi-class Clustering","created":"2025-02-09","cited_by_count":5,"area":null},{"id":"2205.02724","title":"Implicit N-grams Induced by Recurrence","created":"2022-05-05","cited_by_count":4,"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":"2512.00003","title":"Efficient Turing Machine Simulation with Transformers","created":"2025-09-28","cited_by_count":4,"area":"lr"},{"id":"2512.01925","title":"Rectifying LLM Thought from Lens of Optimization","created":"2025-12-01","cited_by_count":4,"area":"lr"},{"id":"2411.16993","title":"Tree Transformers are an Ineffective Model of Syntactic Constituency","created":"2024-11-25","cited_by_count":3,"area":null},{"id":"2411.18885","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","created":"2024-11-28","cited_by_count":3,"area":null},{"id":"2509.09001","title":"Fast attention mechanisms: a tale of parallelism","created":"2025-09-10","cited_by_count":3,"area":null},{"id":"2602.11175","title":"Barriers to Discrete Reasoning with Transformers: A Survey Across Depth, Exactness, and Bandwidth","created":"2026-01-19","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":"2410.06045","title":"Extracting Moore Machines from Transformers using Queries and Counterexamples","created":"2024-10-08","cited_by_count":2,"area":null},{"id":"2505.19815","title":"Deciphering Trajectory-Aided LLM Reasoning: An Optimization Perspective","created":"2025-05-26","cited_by_count":2,"area":"lr"},{"id":"2510.27118","title":"Probability Distributions Computed by Autoregressive Transformers","created":"2025-10-31","cited_by_count":2,"area":null},{"id":"2512.09757","title":"Circuits, Features, and Heuristics in Molecular Transformers","created":"2025-12-10","cited_by_count":2,"area":"mechinterp"},{"id":"2604.01577","title":"Exploration of Fast-Slow Latent Recurrence for Train-Short, Test-Long Generalization","created":"2026-04-02","cited_by_count":2,"area":null},{"id":"2604.22128","title":"Dissociating Decodability and Causal Use in Bracket-Sequence Transformers","created":"2026-04-24","cited_by_count":2,"area":null},{"id":"2402.15814","title":"On Efficiently Representing Regular Languages as RNNs","created":"2024-02-24","cited_by_count":1,"area":null},{"id":"2407.10949","title":"Representing Rule-based Chatbots with Transformers","created":"2024-07-15","cited_by_count":1,"area":null},{"id":"2503.04848","title":"Three tiers of computation in transformers and in brain architectures","created":"2025-03-05","cited_by_count":1,"area":null},{"id":"2602.01763","title":"A Provable Expressiveness Hierarchy in Hybrid Linear-Full Attention","created":"2026-02-02","cited_by_count":1,"area":null},{"id":"2604.17857","title":"On the Emergence of Syntax by Means of Local Interaction","created":"2026-04-20","cited_by_count":1,"area":null},{"id":"2605.10019","title":"The two clocks and the innovation window: When and how generative models learn rules","created":"2026-05-11","cited_by_count":1,"area":null},{"id":"2605.24033","title":"Towards Verifiable Transformers: Solver-Checkable Circuit Explanations","created":"2026-05-21","cited_by_count":1,"area":"mechinterp"},{"id":"2605.31423","title":"Fixed Universal Transformers","created":"2026-05-29","cited_by_count":1,"area":null},{"id":"2606.17522","title":"An expressivity analysis of hierarchical modelling in deep transformers via bounded-depth grammars","created":"2026-06-16","cited_by_count":1,"area":null},{"id":"2606.20936","title":"Comparing Transformers and Hybrid Models at the Token Level","created":"2026-06-18","cited_by_count":1,"area":null},{"id":"2310.16350","title":"Unraveling Feature Extraction Mechanisms in Neural Networks","created":"2023-10-25","cited_by_count":0,"area":null},{"id":"2311.09387","title":"Banach-Tarski Embeddings and Transformers","created":"2023-11-15","cited_by_count":0,"area":null},{"id":"2502.00197","title":"Learning Model Successors","created":"2025-01-31","cited_by_count":0,"area":null},{"id":"2506.03370","title":"Comparison of different Unique hard attention transformer models by the formal languages they can recognize","created":"2025-06-03","cited_by_count":0,"area":null},{"id":"2510.08341","title":"Post-Norm can Resharpen Attention","created":"2025-10-09","cited_by_count":0,"area":null},{"id":"2510.14614","title":"First Attentions Last: Better Exploiting First Attentions for Efficient Transformer Training","created":"2025-10-16","cited_by_count":0,"area":null},{"id":"2511.19279","title":"MapFormer: Self-Supervised Learning of Cognitive Maps with Input-Dependent Positional Embeddings","created":"2025-11-24","cited_by_count":0,"area":null}],"next_cursor":"100"}