{"total":54,"rows":[{"id":"2205.10625","title":"Least-to-Most Prompting Enables Complex Reasoning in Large Language Models","created":"2022-05-21","cited_by_count":1407,"area":"lr"},{"id":"2201.02177","title":"Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets","created":"2022-01-06","cited_by_count":629,"area":null},{"id":"2207.02098","title":"Neural Networks and the Chomsky Hierarchy","created":"2022-07-05","cited_by_count":217,"area":null},{"id":"2207.06881","title":"Recurrent Memory Transformer","created":"2022-07-14","cited_by_count":203,"area":null},{"id":"2304.11062","title":"Scaling Transformer to 1M tokens and beyond with RMT","created":"2023-04-19","cited_by_count":98,"area":null},{"id":"2111.09360","title":"Personalized Federated Learning through Local Memorization","created":"2021-11-17","cited_by_count":57,"area":null},{"id":"2103.16775","title":"Attention, please! A survey of Neural Attention Models in Deep Learning","created":"2021-03-31","cited_by_count":51,"area":null},{"id":"2110.02488","title":"ABC: Attention with Bounded-memory Control","created":"2021-10-06","cited_by_count":36,"area":null},{"id":"2106.03993","title":"Lexicon Learning for Few-Shot Neural Sequence Modeling","created":"2021-06-07","cited_by_count":28,"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":"2310.19089","title":"Pushdown Layers: Encoding Recursive Structure in Transformer Language Models","created":"2023-10-29","cited_by_count":19,"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":"2109.01982","title":"Learning Hierarchical Structures with Differentiable Nondeterministic Stacks","created":"2021-09-05","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":"2410.03170","title":"Autoregressive Large Language Models are Computationally Universal","created":"2024-10-04","cited_by_count":15,"area":null},{"id":"2112.10194","title":"UnweaveNet: Unweaving Activity Stories","created":"2021-12-19","cited_by_count":14,"area":null},{"id":"2204.05424","title":"A Call for Clarity in Beam Search: How It Works and When It Stops","created":"2022-04-11","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":"2104.02899","title":"Recognizing and Verifying Mathematical Equations using Multiplicative Differential Neural Units","created":"2021-04-07","cited_by_count":8,"area":null},{"id":"2109.06783","title":"Learning to Navigate Intersections with Unsupervised Driver Trait Inference","created":"2021-09-14","cited_by_count":8,"area":null},{"id":"2210.13569","title":"Characterizing Verbatim Short-Term Memory in Neural Language Models","created":"2022-10-24","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":"2109.00301","title":"$\\infty$-former: Infinite Memory Transformer","created":"2021-09-01","cited_by_count":7,"area":null},{"id":"2307.09660","title":"Neural Priority Queues for Graph Neural Networks","created":"2023-07-18","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":"2305.19999","title":"Beam Tree Recursive Cells","created":"2023-05-31","cited_by_count":6,"area":null},{"id":"2101.04921","title":"Neural Sequence-to-grid Module for Learning Symbolic Rules","created":"2021-01-13","cited_by_count":5,"area":null},{"id":"2105.07957","title":"Evolutionary Training and Abstraction Yields Algorithmic Generalization of Neural Computers","created":"2021-05-17","cited_by_count":5,"area":null},{"id":"2306.00751","title":"Differentiable Tree Operations Promote Compositional Generalization","created":"2023-06-01","cited_by_count":5,"area":null},{"id":"2412.14076","title":"Compositional Generalization Across Distributional Shifts with Sparse Tree Operations","created":"2024-12-18","cited_by_count":5,"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":"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":"2302.09422","title":"Neural Attention Memory","created":"2023-02-18","cited_by_count":2,"area":null},{"id":"2310.09297","title":"A Framework for Inference Inspired by Human Memory Mechanisms","created":"2023-10-01","cited_by_count":2,"area":null},{"id":"2405.04515","title":"A Transformer with Stack Attention","created":"2024-05-07","cited_by_count":2,"area":null},{"id":"2104.00755","title":"Reconciling the Discrete-Continuous Divide: Towards a Mathematical Theory of Sparse Communication","created":"2021-04-01","cited_by_count":1,"area":null},{"id":"2107.01529","title":"Learning Complex Users' Preferences for Recommender Systems","created":"2021-07-04","cited_by_count":1,"area":null},{"id":"2307.15679","title":"Dynamic Analysis and an Eigen Initializer for Recurrent Neural Networks","created":"2023-07-28","cited_by_count":1,"area":null},{"id":"2307.15694","title":"Universal Recurrent Event Memories for Streaming Data","created":"2023-07-28","cited_by_count":1,"area":null},{"id":"2502.16389","title":"An Expert Ensemble for Detecting Anomalous Scenes, Interactions, and Behaviors in Autonomous Driving","created":"2025-02-23","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":"2601.08061","title":"Universal computation is intrinsic to language model decoding","created":"2026-01-12","cited_by_count":1,"area":null},{"id":"2108.09164","title":"A Neural Conversation Generation Model via Equivalent Shared Memory Investigation","created":"2021-08-20","cited_by_count":0,"area":null},{"id":"2110.14350","title":"Enhancing Reinforcement Learning with discrete interfaces to learn the Dyck Language","created":"2021-10-27","cited_by_count":0,"area":null},{"id":"2211.04507","title":"Differentiable Quantum Programming with Unbounded Loops","created":"2022-11-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":"2311.00475","title":"Style Locality for Controllable Generation with kNN Language Models","created":"2023-11-01","cited_by_count":0,"area":null},{"id":"2404.11870","title":"Enhancing Length Extrapolation in Sequential Models with Pointer-Augmented Neural Memory","created":"2024-04-18","cited_by_count":0,"area":null},{"id":"2410.03154","title":"Exploring Learnability in Memory-Augmented Recurrent Neural Networks: Precision, Stability, and Empirical Insights","created":"2024-10-04","cited_by_count":0,"area":null},{"id":"2506.22366","title":"Why Are Parsing Actions for Understanding Message Hierarchies Not Random?","created":"2025-06-27","cited_by_count":0,"area":null},{"id":"2507.15343","title":"StackTrans: From Large Language Model to Large Pushdown Automata Model","created":"2025-07-21","cited_by_count":0,"area":null},{"id":"2508.07969","title":"Understanding Syntactic Generalization in Structure-inducing Language Models","created":"2025-08-11","cited_by_count":0,"area":null},{"id":"2601.07868","title":"RewriteNets: End-to-End Trainable String-Rewriting for Generative Sequence Modeling","created":"2026-01-10","cited_by_count":0,"area":null},{"id":"2607.29496","title":"Transcript-Managed Transformers: Monotone Multi-Agent Collapse and Universality with Two Pop-Enabled Transcripts","created":"2026-07-31","cited_by_count":0,"area":null}],"next_cursor":null}