{"total":70,"rows":[{"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":"2311.12424","title":"Looped Transformers are Better at Learning Learning Algorithms","created":"2023-11-21","cited_by_count":149,"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":"2306.04891","title":"In-Context Learning through the Bayesian Prism","created":"2023-06-08","cited_by_count":83,"area":null},{"id":"2311.18817","title":"Dichotomy of Early and Late Phase Implicit Biases Can Provably Induce Grokking","created":"2023-11-30","cited_by_count":80,"area":null},{"id":"2402.09963","title":"Why are Sensitive Functions Hard for Transformers?","created":"2024-02-15","cited_by_count":74,"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":"2403.02241","title":"Neural Redshift: Random Networks are not Random Functions","created":"2024-03-04","cited_by_count":43,"area":null},{"id":"2404.01266","title":"IsoBench: Benchmarking Multimodal Foundation Models on Isomorphic Representations","created":"2024-04-01","cited_by_count":38,"area":null},{"id":"2407.12332","title":"Why Do You Grok? A Theoretical Analysis of Grokking Modular Addition","created":"2024-07-17","cited_by_count":36,"area":null},{"id":"2311.07230","title":"How are Prompts Different in Terms of Sensitivity?","created":"2023-11-13","cited_by_count":35,"area":null},{"id":"2402.18377","title":"Out-of-Domain Generalization in Dynamical Systems Reconstruction","created":"2024-02-28","cited_by_count":33,"area":null},{"id":"2304.06670","title":"Deep neural networks have an inbuilt Occam's razor","created":"2023-04-13","cited_by_count":28,"area":null},{"id":"2402.00522","title":"Understanding the Expressive Power and Mechanisms of Transformer for Sequence Modeling","created":"2024-02-01","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":"2404.16367","title":"Learning Syntax Without Planting Trees: Understanding Hierarchical Generalization in Transformers","created":"2024-04-25","cited_by_count":24,"area":null},{"id":"2410.19637","title":"A distributional simplicity bias in the learning dynamics of transformers","created":"2024-10-25","cited_by_count":24,"area":null},{"id":"2411.07107","title":"Training Neural Networks as Recognizers of Formal Languages","created":"2024-11-11","cited_by_count":24,"area":"lr"},{"id":"2510.22980","title":"How Muon's Spectral Design Benefits Generalization: A Study on Imbalanced Data","created":"2025-10-27","cited_by_count":19,"area":null},{"id":"2410.05464","title":"Progressive distillation induces an implicit curriculum","created":"2024-10-07","cited_by_count":15,"area":null},{"id":"2512.20607","title":"Saddle-to-Saddle Dynamics Explains A Simplicity Bias Across Neural Network Architectures","created":"2025-12-23","cited_by_count":15,"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":"2402.05173","title":"Towards Understanding Inductive Bias in Transformers: A View From Infinity","created":"2024-02-07","cited_by_count":13,"area":null},{"id":"2503.10065","title":"Do We Always Need the Simplicity Bias? Looking for Optimal Inductive Biases in the Wild","created":"2025-03-13","cited_by_count":13,"area":null},{"id":"2510.05184","title":"Representation Potentials of Foundation Models for Multimodal Alignment: A Survey","created":"2025-10-05","cited_by_count":11,"area":null},{"id":"2409.17677","title":"On the Optimal Memorization Capacity of Transformers","created":"2024-09-26","cited_by_count":10,"area":null},{"id":"2502.00472","title":"Binned Spectral Power Loss for Improved Prediction of Chaotic Systems","created":"2025-02-01","cited_by_count":10,"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.09297","title":"When Do Neural Networks Learn World Models?","created":"2025-02-13","cited_by_count":8,"area":"wm"},{"id":"2304.07687","title":"MLRegTest: A Benchmark for the Machine Learning of Regular Languages","created":"2023-04-16","cited_by_count":7,"area":null},{"id":"2405.18202","title":"IM-Context: In-Context Learning for Imbalanced Regression Tasks","created":"2024-05-28","cited_by_count":7,"area":null},{"id":"2410.18077","title":"ALTA: Compiler-Based Analysis of Transformers","created":"2024-10-23","cited_by_count":7,"area":null},{"id":"2509.22445","title":"Bridging Kolmogorov Complexity and Deep Learning: Asymptotically Optimal Description Length Objectives for Transformers","created":"2025-09-26","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":"2504.13558","title":"Transformers Can Overcome the Curse of Dimensionality: A Theoretical Study from an Approximation Perspective","created":"2025-04-18","cited_by_count":5,"area":null},{"id":"2602.16201","title":"Long-Tail Knowledge in Large Language Models: Taxonomy, Mechanisms, Interventions and Implications","created":"2026-02-18","cited_by_count":5,"area":null},{"id":"2510.14826","title":"To Infinity and Beyond: Tool-Use Unlocks Length Generalization in State Space Models","created":"2025-10-16","cited_by_count":4,"area":null},{"id":"2405.17479","title":"A rationale from frequency perspective for grokking in training neural network","created":"2024-05-24","cited_by_count":3,"area":null},{"id":"2406.17467","title":"Early learning of the optimal constant solution in neural networks and humans","created":"2024-06-25","cited_by_count":3,"area":null},{"id":"2407.04371","title":"Exploiting the equivalence between quantum neural networks and perceptrons","created":"2024-07-05","cited_by_count":3,"area":null},{"id":"2409.12446","title":"Neural Networks Generalize on Low Complexity Data","created":"2024-09-19","cited_by_count":3,"area":null},{"id":"2502.07553","title":"Transformers Provably Learn Sparse XOR with Polylogarithmic Parameters","created":"2025-02-11","cited_by_count":3,"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":"2510.00034","title":"Review of Hallucination Understanding in Large Language and Vision Models","created":"2025-09-26","cited_by_count":2,"area":null},{"id":"2510.13680","title":"Adam or Gauss-Newton? A Comparative Study In Terms of Basis Alignment and SGD Noise","created":"2025-10-15","cited_by_count":2,"area":null},{"id":"2511.17852","title":"Transformers with RL or SFT Provably Learn Sparse Boolean Functions, But Differently","created":"2025-11-22","cited_by_count":2,"area":"lr"},{"id":"2602.02103","title":"How Far Ahead Do LLMs Plan? Uncovering the Latent Horizon in Chain-of-Thought Reasoning","created":"2026-02-02","cited_by_count":2,"area":"lr"},{"id":"2603.20274","title":"Solomonoff induction","created":"2026-03-17","cited_by_count":2,"area":null},{"id":"2606.00605","title":"Looped Transformers with Layer Normalization Provably Learn the Power Method","created":"2026-05-30","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":"2505.13055","title":"Simplicity is Key: An Unsupervised Pretraining Approach for Sparse Radio Channels","created":"2025-05-19","cited_by_count":1,"area":null},{"id":"2505.24060","title":"Characterising the Inductive Biases of Neural Networks on Boolean Data","created":"2025-05-29","cited_by_count":1,"area":null},{"id":"2508.07395","title":"Parity Requires Unified Input Dependence and Negative Eigenvalues in SSMs","created":"2025-08-10","cited_by_count":1,"area":"ssm"},{"id":"2601.03162","title":"On the Convergence Behavior of Preconditioned Gradient Descent Toward the Rich Learning Regime","created":"2026-01-06","cited_by_count":1,"area":null},{"id":"2602.04548","title":"Gradient Flow Through Diagram Expansions: Learning Regimes and Explicit Solutions","created":"2026-02-04","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":"2606.08768","title":"Understanding the Parameter Space Geometry of Transformers Encoding Boolean Functions","created":"2026-06-07","cited_by_count":1,"area":null},{"id":"2608.03425","title":"State Propagation Also Satisfies: A Complex-Valued State-Space Model for Deterministic State Tracking","created":"2026-08-04","cited_by_count":1,"area":null},{"id":"2401.00593","title":"Simplicity bias, algorithmic probability, and the random logistic map","created":"2023-12-31","cited_by_count":0,"area":null},{"id":"2404.10200","title":"TEL'M: Test and Evaluation of Language Models","created":"2024-04-16","cited_by_count":0,"area":null},{"id":"2412.10898","title":"Exploring Grokking: Experimental and Mechanistic Investigations","created":"2024-12-14","cited_by_count":0,"area":null},{"id":"2502.00197","title":"Learning Model Successors","created":"2025-01-31","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":"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.11673","title":"Higher-Order Token Interactions via Quantum Attention","created":"2026-06-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},{"id":"2610.03378","title":"Operator-informed initialization for Fourier features physics-informed neural networks","created":"2026-10-02","cited_by_count":0,"area":null}],"next_cursor":null}