{"total":248,"rows":[{"id":"2311.05232","title":"A Survey on Hallucination in Large Language Models: Principles, Taxonomy, Challenges, and Open Questions","created":"2023-11-09","cited_by_count":1601,"area":null},{"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":"2305.18654","title":"Faith and Fate: Limits of Transformers on Compositionality","created":"2023-05-29","cited_by_count":503,"area":null},{"id":"2401.11817","title":"Hallucination is Inevitable: An Innate Limitation of Large Language Models","created":"2024-01-22","cited_by_count":332,"area":null},{"id":"2210.10749","title":"Transformers Learn Shortcuts to Automata","created":"2022-10-19","cited_by_count":268,"area":null},{"id":"2207.02098","title":"Neural Networks and the Chomsky Hierarchy","created":"2022-07-05","cited_by_count":217,"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":"2207.00729","title":"The Parallelism Tradeoff: Limitations of Log-Precision Transformers","created":"2022-07-02","cited_by_count":193,"area":null},{"id":"2207.08799","title":"Hidden Progress in Deep Learning: SGD Learns Parities Near the Computational Limit","created":"2022-07-18","cited_by_count":187,"area":null},{"id":"2106.06981","title":"Thinking Like Transformers","created":"2021-06-13","cited_by_count":184,"area":null},{"id":"2204.06031","title":"A Review on Language Models as Knowledge Bases","created":"2022-04-12","cited_by_count":157,"area":null},{"id":"2110.10090","title":"Inductive Biases and Variable Creation in Self-Attention Mechanisms","created":"2021-10-19","cited_by_count":144,"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":"2305.16843","title":"Randomized Positional Encodings Boost Length Generalization of Transformers","created":"2023-05-26","cited_by_count":117,"area":null},{"id":"2202.12172","title":"Overcoming a Theoretical Limitation of Self-Attention","created":"2022-02-24","cited_by_count":113,"area":null},{"id":"2105.11115","title":"Self-Attention Networks Can Process Bounded Hierarchical Languages","created":"2021-05-24","cited_by_count":105,"area":null},{"id":"2201.00044","title":"Transformer Embeddings of Irregularly Spaced Events and Their Participants","created":"2021-12-31","cited_by_count":93,"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.11504","title":"Language Model Behavior: A Comprehensive Survey","created":"2023-03-20","cited_by_count":92,"area":null},{"id":"2504.17550","title":"HalluLens: LLM Hallucination Benchmark","created":"2025-04-24","cited_by_count":92,"area":null},{"id":"2406.04267","title":"Transformers need glasses! Information over-squashing in language tasks","created":"2024-06-06","cited_by_count":91,"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":"2311.08360","title":"The Transient Nature of Emergent In-Context Learning in Transformers","created":"2023-11-14","cited_by_count":76,"area":null},{"id":"2306.00946","title":"Exposing Attention Glitches with Flip-Flop Language Modeling","created":"2023-06-01","cited_by_count":75,"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":"2308.16898","title":"Transformers as Support Vector Machines","created":"2023-08-31","cited_by_count":74,"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":"2403.01632","title":"SynCode: LLM Generation with Grammar Augmentation","created":"2024-03-03","cited_by_count":69,"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":"2310.03016","title":"Understanding In-Context Learning in Transformers and LLMs by Learning to Learn Discrete Functions","created":"2023-10-04","cited_by_count":63,"area":null},{"id":"2402.08164","title":"On Limitations of the Transformer Architecture","created":"2024-02-13","cited_by_count":63,"area":null},{"id":"2311.17132","title":"TransNeXt: Robust Foveal Visual Perception for Vision Transformers","created":"2023-11-28","cited_by_count":61,"area":null},{"id":"2305.18741","title":"Grokking of Hierarchical Structure in Vanilla Transformers","created":"2023-05-30","cited_by_count":53,"area":null},{"id":"2103.15060","title":"PnG BERT: Augmented BERT on Phonemes and Graphemes for Neural TTS","created":"2021-03-28","cited_by_count":52,"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":"2106.08367","title":"What Context Features Can Transformer Language Models Use?","created":"2021-06-15","cited_by_count":50,"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":"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":"2210.14698","title":"Autoregressive Structured Prediction with Language Models","created":"2022-10-26","cited_by_count":43,"area":null},{"id":"2203.00633","title":"Transformer Grammars: Augmenting Transformer Language Models with Syntactic Inductive Biases at Scale","created":"2022-03-01","cited_by_count":41,"area":null},{"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":"2410.02984","title":"Differentiation and Specialization of Attention Heads via the Refined Local Learning Coefficient","created":"2024-10-03","cited_by_count":40,"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":"2401.06416","title":"Mission: Impossible Language Models","created":"2024-01-12","cited_by_count":32,"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":"2402.03902","title":"A phase transition between positional and semantic learning in a solvable model of dot-product attention","created":"2024-02-06","cited_by_count":30,"area":null},{"id":"2110.02782","title":"How BPE Affects Memorization in Transformers","created":"2021-10-06","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":"2104.10343","title":"Sensitivity as a Complexity Measure for Sequence Classification Tasks","created":"2021-04-21","cited_by_count":28,"area":null},{"id":"2207.07563","title":"QSAN: A Near-term Achievable Quantum Self-Attention Network","created":"2022-07-14","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":"2210.13050","title":"Structural generalization is hard for sequence-to-sequence models","created":"2022-10-24","cited_by_count":24,"area":null},{"id":"2301.13195","title":"Adaptive Computation with Elastic Input Sequence","created":"2023-01-30","cited_by_count":22,"area":null},{"id":"2404.00742","title":"Adapting to Length Shift: FlexiLength Network for Trajectory Prediction","created":"2024-03-31","cited_by_count":22,"area":null},{"id":"2407.13934","title":"Towards Trustworthy AI: A Review of Ethical and Robust Large Language Models","created":"2024-06-01","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":"2305.17026","title":"How Powerful are Decoder-Only Transformer Neural Models?","created":"2023-05-26","cited_by_count":20,"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":"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.12036","title":"Transformers Generalize Linearly","created":"2021-09-24","cited_by_count":19,"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":"2104.07896","title":"Generating Bug-Fixes Using Pretrained Transformers","created":"2021-04-16","cited_by_count":18,"area":null},{"id":"2305.14699","title":"Can Transformers Learn to Solve Problems Recursively?","created":"2023-05-24","cited_by_count":17,"area":null},{"id":"2308.00109","title":"A Sentence is Worth a Thousand Pictures: Can Large Language Models Understand Hum4n L4ngu4ge and the W0rld behind W0rds?","created":"2023-07-26","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":"2401.17426","title":"Superiority of Multi-Head Attention in In-Context Linear Regression","created":"2024-01-30","cited_by_count":17,"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":"2106.06038","title":"Modeling Hierarchical Structures with Continuous Recursive Neural Networks","created":"2021-06-10","cited_by_count":15,"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":"2410.03170","title":"Autoregressive Large Language Models are Computationally Universal","created":"2024-10-04","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":"2505.23623","title":"Characterizing the Expressivity of Fixed-Precision Transformer Language Models","created":"2025-05-29","cited_by_count":14,"area":null},{"id":"2305.03796","title":"Transformer Working Memory Enables Regular Language Reasoning and Natural Language Length Extrapolation","created":"2023-05-05","cited_by_count":13,"area":null},{"id":"2309.03800","title":"Pareto Frontiers in Neural Feature Learning: Data, Compute, Width, and Luck","created":"2023-09-07","cited_by_count":13,"area":null},{"id":"2402.02005","title":"Topology-Informed Graph Transformer","created":"2024-02-03","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":"2310.08661","title":"Counting and Algorithmic Generalization with Transformers","created":"2023-10-12","cited_by_count":12,"area":null},{"id":"2501.19215","title":"Strassen Attention, Split VC Dimension and Compositionality in Transformers","created":"2025-01-31","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":"2309.10371","title":"Generative AI vs. AGI: The Cognitive Strengths and Weaknesses of Modern LLMs","created":"2023-09-19","cited_by_count":11,"area":null},{"id":"2403.02871","title":"Quantum Mixed-State Self-Attention Network","created":"2024-03-05","cited_by_count":11,"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":"2310.11984","title":"From Interpolation to Extrapolation: Complete Length Generalization for Arithmetic Transformers","created":"2023-10-18","cited_by_count":10,"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":"2503.14615","title":"Unique Hard Attention: A Tale of Two Sides","created":"2025-03-18","cited_by_count":10,"area":null},{"id":"2102.10094","title":"Formal Language Theory Meets Modern NLP","created":"2021-02-19","cited_by_count":9,"area":null},{"id":"2204.09148","title":"What Makes Instruction Learning Hard? An Investigation and a New Challenge in a Synthetic Environment","created":"2022-04-19","cited_by_count":9,"area":null},{"id":"2405.15926","title":"Dissecting the Interplay of Attention Paths in a Statistical Mechanics Theory of Transformers","created":"2024-05-24","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":"2601.22950","title":"Perplexity Cannot Always Tell Right from Wrong","created":"2026-01-30","cited_by_count":9,"area":null}],"next_cursor":"100"}