{"total":61,"rows":[{"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":"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":"2406.06467","title":"How Far Can Transformers Reason? The Globality Barrier and Inductive Scratchpad","created":"2024-06-10","cited_by_count":36,"area":null},{"id":"2505.17495","title":"ProxySPEX: Inference-Efficient Interpretability via Sparse Feature Interactions in LLMs","created":"2025-05-23","cited_by_count":16,"area":null},{"id":"2403.06925","title":"Transformers Learn Low Sensitivity Functions: Investigations and Implications","created":"2024-03-11","cited_by_count":14,"area":null},{"id":"2505.00926","title":"How Transformers Learn Regular Language Recognition: A Theoretical Study on Training Dynamics and Implicit Bias","created":"2025-05-02","cited_by_count":11,"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":"2505.11199","title":"The Counting Power of Transformers","created":"2025-05-16","cited_by_count":9,"area":null},{"id":"2603.01959","title":"The Expressive Limits of Diagonal SSMs for State-Tracking","created":"2026-03-02","cited_by_count":9,"area":null},{"id":"2410.13779","title":"The Mystery of the Pathological Path-star Task for Language Models","created":"2024-10-17","cited_by_count":8,"area":null},{"id":"2502.16792","title":"The Role of Sparsity for Length Generalization in Transformers","created":"2025-02-24","cited_by_count":8,"area":null},{"id":"2505.23696","title":"Computational Algebra with Attention: Transformer Oracles for Border Basis Algorithms","created":"2025-05-29","cited_by_count":7,"area":null},{"id":"2505.21785","title":"Born a Transformer -- Always a Transformer? On the Effect of Pretraining on Architectural Abilities","created":"2025-05-27","cited_by_count":6,"area":null},{"id":"2510.00368","title":"The Transformer Cookbook","created":"2025-10-01","cited_by_count":6,"area":null},{"id":"2607.20594","title":"When Does Recurrence Become an Algorithm? Convergence Selection in Weight-Tied Looped Transformers","created":"2026-07-22","cited_by_count":6,"area":null},{"id":"2503.06366","title":"Machine Learning meets Algebraic Combinatorics: A Suite of Datasets Capturing Research-level Conjecturing Ability in Pure Mathematics","created":"2025-03-09","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":"2410.20035","title":"Training the Untrainable: Introducing Inductive Bias via Representational Alignment","created":"2024-10-26","cited_by_count":4,"area":null},{"id":"2502.09245","title":"You Do Not Fully Utilize Transformer's Representation Capacity","created":"2025-02-13","cited_by_count":4,"area":null},{"id":"2505.19531","title":"Minimalist Softmax Attention Provably Learns Constrained Boolean Functions","created":"2025-05-26","cited_by_count":4,"area":null},{"id":"2601.01754","title":"Context-Free Recognition with Transformers","created":"2026-01-05","cited_by_count":4,"area":null},{"id":"2503.10542","title":"Language Models, Graph Searching, and Supervision Adulteration: When More Supervision is Less and How to Make More More","created":"2025-03-13","cited_by_count":3,"area":null},{"id":"2504.12465","title":"Geometric Generality of Transformer-Based Gr\\\"obner Basis Computation","created":"2025-04-16","cited_by_count":3,"area":null},{"id":"2505.10606","title":"Continuity and Isolation Lead to Doubts or Dilemmas in Large Language Models","created":"2025-05-15","cited_by_count":3,"area":null},{"id":"2602.01651","title":"On the Spatiotemporal Dynamics of Generalization in Neural Networks","created":"2026-02-02","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":"2410.06045","title":"Extracting Moore Machines from Transformers using Queries and Counterexamples","created":"2024-10-08","cited_by_count":2,"area":null},{"id":"2502.01432","title":"Emergent Stack Representations in Modeling Counter Languages Using Transformers","created":"2025-02-03","cited_by_count":2,"area":null},{"id":"2509.10414","title":"Is In-Context Learning Learning?","created":"2025-09-12","cited_by_count":2,"area":null},{"id":"2602.11262","title":"Unlearnable phases of matter","created":"2026-02-11","cited_by_count":2,"area":null},{"id":"2603.19954","title":"On the Ability of Transformers to Verify Plans","created":"2026-03-20","cited_by_count":2,"area":null},{"id":"2607.17624","title":"Can Transformers Really Do It All? On the Compatibility of Inductive Biases Across Tasks","created":"2026-07-20","cited_by_count":2,"area":null},{"id":"2407.18601","title":"Reorganizing attention-space geometry with expressive attention","created":"2024-07-26","cited_by_count":1,"area":null},{"id":"2502.06038","title":"Provably Overwhelming Transformer Models with Designed Inputs","created":"2025-02-09","cited_by_count":1,"area":null},{"id":"2506.23875","title":"Discovering Learning-Friendly Generation Orders for Sequential Computation","created":"2025-06-30","cited_by_count":1,"area":null},{"id":"2509.20581","title":"Hierarchical Resolution Transformers: A Wavelet-Inspired Architecture for Multi-Scale Language Understanding","created":"2025-09-24","cited_by_count":1,"area":null},{"id":"2604.23267","title":"Fine-tuning vs. In-context Learning in Large Language Models: A Formal Language Learning Perspective","created":"2026-04-25","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.26035","title":"Length Generalization with Log-Depth Recurrent Units","created":"2026-05-25","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.08768","title":"Understanding the Parameter Space Geometry of Transformers Encoding Boolean Functions","created":"2026-06-07","cited_by_count":1,"area":null},{"id":"2609.25438","title":"PermuFormer: Multi-Task Pretraining for Permutation Representation in Algebraic Combinatorics","created":"2026-09-21","cited_by_count":1,"area":null},{"id":"2506.20305","title":"Learning Moderately Input-Sensitive Functions: A Case Study in QR Code Decoding","created":"2025-06-25","cited_by_count":0,"area":null},{"id":"2510.04130","title":"On the Limitations and Capabilities of Position Embeddings for Length Generalization","created":"2025-10-05","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":"2602.08287","title":"Noise Stability of Transformer Models","created":"2026-02-09","cited_by_count":0,"area":null},{"id":"2602.08695","title":"Trapped by simplicity: When Transformers fail to learn from noisy features","created":"2026-02-09","cited_by_count":0,"area":null},{"id":"2603.29069","title":"On the Mirage of Long-Range Dependency, with an Application to Integer Multiplication","created":"2026-03-30","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},{"id":"2604.09501","title":"You Can't Fight in Here! This is BBS!","created":"2026-04-10","cited_by_count":0,"area":null},{"id":"2605.07648","title":"Learning Large-Scale Modular Addition with an Auxiliary Modulus","created":"2026-05-08","cited_by_count":0,"area":null},{"id":"2605.10061","title":"Not-So-Strange Love: Language Models and Generative Linguistic Theories are More Compatible than They Appear","created":"2026-05-11","cited_by_count":0,"area":null},{"id":"2605.27616","title":"Not All NVFP4 QAT Recipes Are Equal: How Architecture and Scale Shape Model Quality for Anomaly Segmentation","created":"2026-05-26","cited_by_count":0,"area":null},{"id":"2605.29152","title":"Do Deep Networks Forget Initialization? A Forgetting-Time View of Practical Inductive Bias","created":"2026-05-27","cited_by_count":0,"area":null},{"id":"2606.09822","title":"Causally Evaluating the Learnability of Formal Language Tasks","created":"2026-06-08","cited_by_count":0,"area":null},{"id":"2607.19573","title":"On the Computational Complexity of Structural Generalization","created":"2026-07-21","cited_by_count":0,"area":null},{"id":"2609.11132","title":"How Wrong Can a Good Predictor Be? Diverging Updates with Vanishing Predictive KL","created":"2026-09-10","cited_by_count":0,"area":null}],"next_cursor":null}