{"total":128,"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":"2305.13534","title":"How Language Model Hallucinations Can Snowball","created":"2023-05-22","cited_by_count":311,"area":null},{"id":"2310.16028","title":"What Algorithms can Transformers Learn? A Study in Length Generalization","created":"2023-10-24","cited_by_count":199,"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":"2403.06963","title":"The pitfalls of next-token prediction","created":"2024-03-11","cited_by_count":160,"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":"2505.23719","title":"TiRex: Zero-Shot Forecasting Across Long and Short Horizons with Enhanced In-Context Learning","created":"2025-05-29","cited_by_count":120,"area":null},{"id":"2401.12973","title":"In-Context Language Learning: Architectures and Algorithms","created":"2024-01-23","cited_by_count":89,"area":null},{"id":"2502.10297","title":"DeltaProduct: Improving State-Tracking in Linear RNNs via Householder Products","created":"2025-02-14","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":"2301.10743","title":"Tighter Bounds on the Expressivity of Transformer Encoders","created":"2023-01-25","cited_by_count":66,"area":null},{"id":"2402.18510","title":"RNNs are not Transformers (Yet): The Key Bottleneck on In-context Retrieval","created":"2024-02-28","cited_by_count":64,"area":null},{"id":"2402.08164","title":"On Limitations of the Transformer Architecture","created":"2024-02-13","cited_by_count":63,"area":null},{"id":"2502.01951","title":"On the Emergence of Position Bias in Transformers","created":"2025-02-04","cited_by_count":59,"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":"2412.02975","title":"Theoretical limitations of multi-layer Transformer","created":"2024-12-04","cited_by_count":45,"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":"2410.01405","title":"On Expressive Power of Looped Transformers: Theoretical Analysis and Enhancement via Timestep Encoding","created":"2024-10-02","cited_by_count":36,"area":null},{"id":"2503.02854","title":"(How) Do Language Models Track State?","created":"2025-03-04","cited_by_count":34,"area":null},{"id":"2505.19488","title":"Understanding Transformer from the Perspective of Associative Memory","created":"2025-05-26","cited_by_count":34,"area":null},{"id":"2404.14994","title":"Transformers Can Represent $n$-gram Language Models","created":"2024-04-23","cited_by_count":32,"area":null},{"id":"2405.16411","title":"Training Tensor Attention Efficiently: From Cubic to Almost Linear Time","created":"2024-05-26","cited_by_count":30,"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":"2308.03212","title":"Average-Hard Attention Transformers are Constant-Depth Uniform Threshold Circuits","created":"2023-08-06","cited_by_count":26,"area":null},{"id":"2411.07602","title":"Circuit Complexity Bounds for RoPE-based Transformer Architecture","created":"2024-11-12","cited_by_count":26,"area":null},{"id":"2410.18860","title":"DeCoRe: Decoding by Contrasting Retrieval Heads to Mitigate Hallucinations","created":"2024-10-24","cited_by_count":25,"area":null},{"id":"2407.15160","title":"When Can Transformers Count to n?","created":"2024-07-21","cited_by_count":24,"area":null},{"id":"2402.13934","title":"Do Efficient Transformers Really Save Computation?","created":"2024-02-21","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":"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":"2410.09375","title":"Looped ReLU MLPs May Be All You Need as Practical Programmable Computers","created":"2024-10-12","cited_by_count":19,"area":null},{"id":"2506.12027","title":"Constant Bit-size Transformers Are Turing Complete","created":"2025-05-22","cited_by_count":19,"area":null},{"id":"2405.09220","title":"ALPINE: Unveiling the Planning Capability of Autoregressive Learning in Language Models","created":"2024-05-15","cited_by_count":18,"area":null},{"id":"2505.17761","title":"Structured Linear CDEs: Maximally Expressive and Parallel-in-Time Sequence Models","created":"2025-05-23","cited_by_count":18,"area":null},{"id":"2509.22284","title":"Structured Sparse Transition Matrices to Enable State Tracking in State-Space Models","created":"2025-09-26","cited_by_count":16,"area":null},{"id":"2406.08787","title":"A Survey on Compositional Learning of AI Models: Theoretical and Experimental Practices","created":"2024-06-13","cited_by_count":15,"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":"2310.17639","title":"In-Context Learning Dynamics with Random Binary Sequences","created":"2023-10-26","cited_by_count":13,"area":null},{"id":"2507.12549","title":"The Serial Scaling Hypothesis","created":"2025-07-16","cited_by_count":13,"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":"2412.18040","title":"Theoretical Constraints on the Expressive Power of $\\mathsf{RoPE}$-based Tensor Attention Transformers","created":"2024-12-23","cited_by_count":12,"area":null},{"id":"2506.00744","title":"Blending Complementary Memory Systems in Hybrid Quadratic-Linear Transformers","created":"2025-05-31","cited_by_count":12,"area":null},{"id":"2503.01805","title":"Depth-Width tradeoffs in Algorithmic Reasoning of Graph Tasks with Transformers","created":"2025-03-03","cited_by_count":11,"area":null},{"id":"2604.10701","title":"Bringing Value Models Back: Generative Critics for Value Modeling in LLM Reinforcement Learning","created":"2026-04-12","cited_by_count":11,"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":"2501.04299","title":"Circuit Complexity Bounds for Visual Autoregressive Model","created":"2025-01-08","cited_by_count":10,"area":null},{"id":"2412.05562","title":"Modern Hopfield Networks Require Chain-of-Thought to Solve $\\mathsf{NC}^1$-Hard Problems","created":"2024-12-07","cited_by_count":9,"area":null},{"id":"2505.11199","title":"The Counting Power of Transformers","created":"2025-05-16","cited_by_count":9,"area":null},{"id":"2510.24966","title":"Sequences of Logits Reveal the Low Rank Structure of Language Models","created":"2025-10-28","cited_by_count":9,"area":null},{"id":"2505.21024","title":"Pause Tokens Strictly Increase the Expressivity of Constant-Depth Transformers","created":"2025-05-27","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":"2602.10743","title":"Kalman Linear Attention: Parallel Bayesian Filtering For Efficient Language Modelling and State Tracking","created":"2026-02-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":"2406.15275","title":"How language models extrapolate outside the training data: A case study in Textualized Gridworld","created":"2024-06-21","cited_by_count":7,"area":null},{"id":"2412.07752","title":"FlashRNN: I/O-Aware Optimization of Traditional RNNs on modern hardware","created":"2024-12-10","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":"2411.15671","title":"Best of Both Worlds: Advantages of Hybrid Graph Sequence Models","created":"2024-11-23","cited_by_count":6,"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":"2509.23186","title":"Understanding and Enhancing the Planning Capability of Language Models via Multi-Token Prediction","created":"2025-09-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":"2602.14814","title":"Learning State-Tracking from Code Using Linear RNNs","created":"2026-02-16","cited_by_count":6,"area":null},{"id":"2605.30233","title":"Do Language Models Track Entities Across State Changes?","created":"2026-05-28","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":"2402.00976","title":"Investigating Recurrent Transformers with Dynamic Halt","created":"2024-02-01","cited_by_count":5,"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":"2506.01153","title":"Weight-Space Linear Recurrent Neural Networks","created":"2025-06-01","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":"2606.06479","title":"Pretraining Recurrent Networks without Recurrence","created":"2026-06-04","cited_by_count":5,"area":null},{"id":"2510.01450","title":"Local Linear Attention: An Optimal Interpolation of Linear and Softmax Attention For Test-Time Regression","created":"2025-10-01","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":"2603.08859","title":"Expressivity-Efficiency Tradeoffs for Hybrid Sequence Models","created":"2026-03-09","cited_by_count":4,"area":null},{"id":"2607.14144","title":"The Capability Convergence Hypothesis: Capability from Access Structure, Not Scale","created":"2026-07-14","cited_by_count":4,"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.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":"2604.17121","title":"The Topological Trouble With Transformers","created":"2026-04-18","cited_by_count":3,"area":null},{"id":"2506.12220","title":"Two Heads Are Better than One: Simulating Large Transformers with Small Ones","created":"2025-06-13","cited_by_count":2,"area":null},{"id":"2601.09775","title":"The Geometry of Thought: Disclosing the Transformer as a Tropical Polynomial Circuit","created":"2026-01-14","cited_by_count":2,"area":null},{"id":"2601.19467","title":"On the Expressiveness of State Space Models via Temporal Logics","created":"2026-01-27","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":"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":"2605.22471","title":"Lost in Tokenization: Fundamental Trade-offs in Graph Tokenization for Transformers","created":"2026-05-21","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":"2502.06038","title":"Provably Overwhelming Transformer Models with Designed Inputs","created":"2025-02-09","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":"2505.22081","title":"Can Test-time Computation Mitigate Reproduction Bias in Neural Symbolic Regression?","created":"2025-05-28","cited_by_count":1,"area":null},{"id":"2507.21257","title":"CompoST: A Benchmark for Analyzing the Ability of LLMs To Compositionally Interpret Questions in a QALD Setting","created":"2025-07-28","cited_by_count":1,"area":null},{"id":"2511.06232","title":"Scaling Laws and In-Context Learning: A Unified Theoretical Framework","created":"2025-11-09","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":"2602.01763","title":"A Provable Expressiveness Hierarchy in Hybrid Linear-Full Attention","created":"2026-02-02","cited_by_count":1,"area":null},{"id":"2602.02707","title":"Every Bit Counts: A Theoretical Study of Precision-Expressivity Tradeoffs in Quantized Transformers","created":"2026-02-02","cited_by_count":1,"area":null},{"id":"2604.12128","title":"Phantom Paradoxes: Language Models Treat Unresolved Circular Truth Dependence as Contradiction","created":"2026-04-13","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.20936","title":"Comparing Transformers and Hybrid Models at the Token Level","created":"2026-06-18","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.22347","title":"Where Cognition Lives: Dissecting Emergent from Computed Function in a Minimal Complete Cognitive Architecture","created":"2026-08-23","cited_by_count":1,"area":null},{"id":"2608.27339","title":"Beyond Parallel Blindness: Information Floors and Model Gaps in Block Drafting","created":"2026-08-27","cited_by_count":1,"area":null},{"id":"2211.11750","title":"Reconstructing high-order sequence features of dynamic functional connectivity networks based on diversified covert attention patterns for Alzheimer's disease classification","created":"2022-11-19","cited_by_count":0,"area":null}],"next_cursor":"100"}