{"total":108,"rows":[{"id":"2105.14491","title":"How Attentive are Graph Attention Networks?","created":"2021-05-30","cited_by_count":835,"area":null},{"id":"2307.05782","title":"Large Language Models","created":"2023-07-11","cited_by_count":780,"area":null},{"id":"2207.02098","title":"Neural Networks and the Chomsky Hierarchy","created":"2022-07-05","cited_by_count":217,"area":null},{"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":"2311.00208","title":"What Formal Languages Can Transformers Express? A Survey","created":"2023-11-01","cited_by_count":124,"area":null},{"id":"2107.13163","title":"Statistically Meaningful Approximation: a Case Study on Approximating Turing Machines with Transformers","created":"2021-07-28","cited_by_count":102,"area":null},{"id":"2106.06295","title":"Going Beyond Linear Transformers with Recurrent Fast Weight Programmers","created":"2021-06-11","cited_by_count":89,"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":"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":"2403.17844","title":"Mechanistic Design and Scaling of Hybrid Architectures","created":"2024-03-26","cited_by_count":59,"area":null},{"id":"2501.17047","title":"How Linguistics Learned to Stop Worrying and Love the Language Models","created":"2025-01-28","cited_by_count":51,"area":null},{"id":"2301.04589","title":"Memory Augmented Large Language Models are Computationally Universal","created":"2023-01-10","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":"2401.06416","title":"Mission: Impossible Language Models","created":"2024-01-12","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":"2308.03212","title":"Average-Hard Attention Transformers are Constant-Depth Uniform Threshold Circuits","created":"2023-08-06","cited_by_count":26,"area":null},{"id":"2111.00600","title":"Minimum Description Length Recurrent Neural Networks","created":"2021-10-31","cited_by_count":24,"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":"2406.04289","title":"What Languages are Easy to Language-Model? A Perspective from Learning Probabilistic Regular Languages","created":"2024-06-06","cited_by_count":20,"area":null},{"id":"2109.15256","title":"Inducing Transformer's Compositional Generalization Ability via Auxiliary Sequence Prediction Tasks","created":"2021-09-30","cited_by_count":19,"area":null},{"id":"2405.16674","title":"Limits of Deep Learning: Sequence Modeling through the Lens of Complexity Theory","created":"2024-05-26","cited_by_count":19,"area":null},{"id":"2201.12451","title":"Extracting Finite Automata from RNNs Using State Merging","created":"2022-01-28","cited_by_count":17,"area":null},{"id":"2306.12213","title":"Limits for Learning with Language Models","created":"2023-06-21","cited_by_count":17,"area":null},{"id":"2101.10713","title":"Exploring Transitivity in Neural NLI Models through Veridicality","created":"2021-01-26","cited_by_count":15,"area":null},{"id":"2410.03170","title":"Autoregressive Large Language Models are Computationally Universal","created":"2024-10-04","cited_by_count":15,"area":null},{"id":"2402.10013","title":"Bridging the Empirical-Theoretical Gap in Neural Network Formal Language Learning Using Minimum Description Length","created":"2024-02-15","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":"2506.05136","title":"Information Locality as an Inductive Bias for Neural Language Models","created":"2025-06-05","cited_by_count":14,"area":null},{"id":"2208.08195","title":"Benchmarking Compositionality with Formal Languages","created":"2022-08-17","cited_by_count":12,"area":null},{"id":"2310.08661","title":"Counting and Algorithmic Generalization with Transformers","created":"2023-10-12","cited_by_count":12,"area":null},{"id":"2402.12363","title":"Emergent Word Order Universals from Cognitively-Motivated Language Models","created":"2024-02-19","cited_by_count":11,"area":null},{"id":"2410.03001","title":"Can Transformers Learn $n$-gram Language Models?","created":"2024-10-03","cited_by_count":11,"area":null},{"id":"2305.10782","title":"Human Behavioral Benchmarking: Numeric Magnitude Comparison Effects in Large Language Models","created":"2023-05-18","cited_by_count":10,"area":null},{"id":"2101.02258","title":"Can RNNs learn Recursive Nested Subject-Verb Agreements?","created":"2021-01-06","cited_by_count":9,"area":null},{"id":"2102.10094","title":"Formal Language Theory Meets Modern NLP","created":"2021-02-19","cited_by_count":9,"area":null},{"id":"2211.15578","title":"Mutual Exclusivity Training and Primitive Augmentation to Induce Compositionality","created":"2022-11-28","cited_by_count":8,"area":null},{"id":"2309.14691","title":"On the Computational Complexity and Formal Hierarchy of Second Order Recurrent Neural Networks","created":"2023-09-26","cited_by_count":8,"area":null},{"id":"2503.16048","title":"Meta-Learning Neural Mechanisms rather than Bayesian Priors","created":"2025-03-20","cited_by_count":8,"area":null},{"id":"2508.08435","title":"Fast weight programming and linear transformers: from machine learning to neurobiology","created":"2025-08-11","cited_by_count":8,"area":null},{"id":"2603.03612","title":"Why Are Linear RNNs More Parallelizable?","created":"2026-03-04","cited_by_count":8,"area":null},{"id":"2112.09174","title":"Learning Bounded Context-Free-Grammar via LSTM and the Transformer:Difference and Explanations","created":"2021-12-16","cited_by_count":7,"area":null},{"id":"2211.16429","title":"Exploring the Long-Term Generalization of Counting Behavior in RNNs","created":"2022-11-29","cited_by_count":7,"area":null},{"id":"2312.00100","title":"Introducing Rhetorical Parallelism Detection: A New Task with Datasets, Metrics, and Baselines","created":"2023-11-30","cited_by_count":7,"area":null},{"id":"2210.01343","title":"The Surprising Computational Power of Nondeterministic Stack RNNs","created":"2022-10-04","cited_by_count":6,"area":null},{"id":"2310.05161","title":"Recurrent Neural Language Models as Probabilistic Finite-state Automata","created":"2023-10-08","cited_by_count":6,"area":null},{"id":"2501.06141","title":"Emergent Symbol-like Number Variables in Artificial Neural Networks","created":"2025-01-10","cited_by_count":6,"area":null},{"id":"2106.01580","title":"The Limitations of Limited Context for Constituency Parsing","created":"2021-06-03","cited_by_count":5,"area":null},{"id":"2311.04420","title":"Data Factors for Better Compositional Generalization","created":"2023-11-08","cited_by_count":5,"area":null},{"id":"2402.00236","title":"Positional Encoding Helps Recurrent Neural Networks Handle a Large Vocabulary","created":"2024-01-31","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":"2310.14211","title":"LUNA: A Model-Based Universal Analysis Framework for Large Language Models","created":"2023-10-22","cited_by_count":4,"area":null},{"id":"2405.19222","title":"Lower Bounds on the Expressivity of Recurrent Neural Language Models","created":"2024-05-29","cited_by_count":4,"area":null},{"id":"2510.12722","title":"Which Word Orders Facilitate Length Generalization in LMs? An Investigation with GCG-Based Artificial Languages","created":"2025-10-14","cited_by_count":4,"area":null},{"id":"2510.19315","title":"Transformers are Inherently Succinct","created":"2025-10-22","cited_by_count":4,"area":null},{"id":"2106.02965","title":"Extracting Weighted Automata for Approximate Minimization in Language Modelling","created":"2021-06-05","cited_by_count":3,"area":null},{"id":"2210.12302","title":"What do Large Language Models Learn beyond Language?","created":"2022-10-21","cited_by_count":3,"area":null},{"id":"2304.03639","title":"Theoretical Conditions and Empirical Failure of Bracket Counting on Long Sequences with Linear Recurrent Networks","created":"2023-04-07","cited_by_count":3,"area":null},{"id":"2308.08253","title":"Benchmarking Neural Network Generalization for Grammar Induction","created":"2023-08-16","cited_by_count":3,"area":null},{"id":"2406.05045","title":"A Tensor Decomposition Perspective on Second-order RNNs","created":"2024-06-07","cited_by_count":3,"area":null},{"id":"2505.11694","title":"Neural Networks as Universal Finite-State Machines: A Constructive Deterministic Finite Automaton Theory","created":"2025-05-16","cited_by_count":3,"area":null},{"id":"2512.04727","title":"Sequential Enumeration in Large Language Models","created":"2025-12-04","cited_by_count":3,"area":null},{"id":"2108.08999","title":"Deep Sequence Modeling: Development and Applications in Asset Pricing","created":"2021-08-20","cited_by_count":2,"area":null},{"id":"2205.03750","title":"Learnability of Competitive Threshold Models","created":"2022-05-08","cited_by_count":2,"area":null},{"id":"2207.04796","title":"TArC: Tunisian Arabish Corpus First complete release","created":"2022-07-11","cited_by_count":2,"area":null},{"id":"2212.05178","title":"State-Regularized Recurrent Neural Networks to Extract Automata and Explain Predictions","created":"2022-12-10","cited_by_count":2,"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":"2510.27118","title":"Probability Distributions Computed by Autoregressive Transformers","created":"2025-10-31","cited_by_count":2,"area":null},{"id":"2606.01765","title":"An Algebraic View of the Expressivity of Recurrent Language Models","created":"2026-06-01","cited_by_count":2,"area":null},{"id":"2310.12942","title":"On the Representational Capacity of Recurrent Neural Language Models","created":"2023-10-19","cited_by_count":1,"area":null},{"id":"2402.06492","title":"Inducing Systematicity in Transformers by Attending to Structurally Quantized Embeddings","created":"2024-02-09","cited_by_count":1,"area":null},{"id":"2501.06278","title":"Aligning Brain Activity with Advanced Transformer Models: Exploring the Role of Punctuation in Semantic Processing","created":"2025-01-10","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":"2511.22751","title":"Exact Learning of Arithmetic with Differentiable Agents","created":"2025-11-27","cited_by_count":1,"area":null},{"id":"2512.16581","title":"Abacus: Self-Supervised Event Counting-Aligned Distributional Pretraining for Sequential User Modeling","created":"2025-12-18","cited_by_count":1,"area":null},{"id":"2601.08061","title":"Universal computation is intrinsic to language model decoding","created":"2026-01-12","cited_by_count":1,"area":null},{"id":"2605.30523","title":"Revisiting Padded Transformer Expressivity: Which Architectural Choices Matter and Which Don't","created":"2026-05-28","cited_by_count":1,"area":null},{"id":"2606.12364","title":"On Subquadratic Architectures: From Applications to Principles","created":"2026-06-10","cited_by_count":1,"area":null},{"id":"2101.01178","title":"Advances in Electron Microscopy with Deep Learning","created":"2021-01-04","cited_by_count":0,"area":null},{"id":"2106.00047","title":"Learning and Generalization in RNNs","created":"2021-05-31","cited_by_count":0,"area":null},{"id":"2110.13244","title":"DeepHelp: Deep Learning for Shout Crisis Text Conversations","created":"2021-10-25","cited_by_count":0,"area":null},{"id":"2211.11956","title":"A Short Survey of Systematic Generalization","created":"2022-11-22","cited_by_count":0,"area":null},{"id":"2302.06451","title":"Ordered Memory Baselines","created":"2023-02-08","cited_by_count":0,"area":null},{"id":"2303.06841","title":"Learning Transductions and Alignments with RNN Seq2seq Models","created":"2023-03-13","cited_by_count":0,"area":null},{"id":"2303.15072","title":"Exposing the Functionalities of Neurons for Gated Recurrent Unit Based Sequence-to-Sequence Model","created":"2023-03-27","cited_by_count":0,"area":null},{"id":"2305.09178","title":"Empirical Analysis of the Inductive Bias of Recurrent Neural Networks by Discrete Fourier Transform of Output Sequences","created":"2023-05-16","cited_by_count":0,"area":null},{"id":"2402.06966","title":"DeepCover: Advancing RNN Test Coverage and Online Error Prediction using State Machine Extraction","created":"2024-02-10","cited_by_count":0,"area":null},{"id":"2410.03118","title":"Precision, Stability, and Generalization: A Comprehensive Assessment of RNNs learnability capability for Classifying Counter and Dyck Languages","created":"2024-10-04","cited_by_count":0,"area":null},{"id":"2506.14162","title":"Common Benchmarks Undervalue the Generalization Power of Programmatic Policies","created":"2025-06-17","cited_by_count":0,"area":null},{"id":"2509.13968","title":"Exploring Major Transitions in the Evolution of Biological Cognition With Artificial Neural Networks","created":"2025-09-17","cited_by_count":0,"area":null},{"id":"2509.22598","title":"From Formal Language Theory to Statistical Learning: Finite Observability of Subregular Languages","created":"2025-09-26","cited_by_count":0,"area":null},{"id":"2511.18517","title":"Foundations of Artificial Intelligence Frameworks: Notion and Limits of AGI","created":"2025-11-23","cited_by_count":0,"area":null},{"id":"2512.09394","title":"Language models as tools for investigating the distinction between possible and impossible natural languages","created":"2025-12-10","cited_by_count":0,"area":null},{"id":"2512.12447","title":"Large language models have learned to use language","created":"2025-12-13","cited_by_count":0,"area":null},{"id":"2512.13441","title":"Large language models are not about natural language","created":"2025-12-15","cited_by_count":0,"area":null},{"id":"2512.14506","title":"Linguists should learn to love speech-based deep learning models","created":"2025-12-16","cited_by_count":0,"area":null},{"id":"2601.10421","title":"Are Language Models Models?","created":"2026-01-15","cited_by_count":0,"area":null},{"id":"2601.10918","title":"Neural Induction of Finite-State Transducers","created":"2026-01-16","cited_by_count":0,"area":null},{"id":"2604.02201","title":"On the Role of Depth in the Expressivity of RNNs","created":"2026-04-02","cited_by_count":0,"area":null},{"id":"2604.09466","title":"Across the Levels of Analysis: Explaining Predictive Processing in Humans Requires More Than Machine-Estimated Probabilities","created":"2026-04-10","cited_by_count":0,"area":null}],"next_cursor":"100"}