{"total":22,"rows":[{"id":"2210.10749","title":"Transformers Learn Shortcuts to Automata","created":"2022-10-19","cited_by_count":268,"area":null},{"id":"2302.11055","title":"SGD learning on neural networks: leap complexity and saddle-to-saddle dynamics","created":"2023-02-21","cited_by_count":143,"area":null},{"id":"2112.00826","title":"Inducing Causal Structure for Interpretable Neural Networks","created":"2021-12-01","cited_by_count":110,"area":null},{"id":"2206.04301","title":"Unveiling Transformers with LEGO: a synthetic reasoning task","created":"2022-06-09","cited_by_count":106,"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":"2301.13105","title":"Generalization on the Unseen, Logic Reasoning and Degree Curriculum","created":"2023-01-30","cited_by_count":73,"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":"2211.00692","title":"Towards Better Out-of-Distribution Generalization of Neural Algorithmic Reasoning Tasks","created":"2022-11-01","cited_by_count":30,"area":null},{"id":"2310.09753","title":"When can transformers reason with abstract symbols?","created":"2023-10-15","cited_by_count":24,"area":null},{"id":"2304.07235","title":"Mapping of attention mechanisms to a generalized Potts model","created":"2023-04-14","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":"2205.13647","title":"Learning to Reason with Neural Networks: Generalization, Unseen Data and Boolean Measures","created":"2022-05-26","cited_by_count":17,"area":null},{"id":"2305.14699","title":"Can Transformers Learn to Solve Problems Recursively?","created":"2023-05-24","cited_by_count":17,"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":"2402.05785","title":"Limits of Transformer Language Models on Learning to Compose Algorithms","created":"2024-02-08","cited_by_count":13,"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":"2310.08866","title":"Adaptivity and Modularity for Efficient Generalization Over Task Complexity","created":"2023-10-13","cited_by_count":7,"area":null},{"id":"2307.03762","title":"Brain in a Vat: On Missing Pieces Towards Artificial General Intelligence in Large Language Models","created":"2023-07-07","cited_by_count":6,"area":null},{"id":"2309.12207","title":"Boolformer: Symbolic Regression of Logic Functions with Transformers","created":"2023-09-21","cited_by_count":5,"area":null},{"id":"2406.06354","title":"On the Minimal Degree Bias in Generalization on the Unseen for non-Boolean Functions","created":"2024-06-10","cited_by_count":1,"area":null},{"id":"2407.21049","title":"Evaluating Long Range Dependency Handling in Code Generation LLMs","created":"2024-07-23","cited_by_count":0,"area":null},{"id":"2609.32247","title":"Certifying Interventional Agreement Among Observationally Equivalent Causal Models","created":"2026-09-26","cited_by_count":0,"area":null}],"next_cursor":null}