{"total":24,"rows":[{"id":"2508.12837","title":"Learning In-context n-grams with Transformers: Sub-n-grams Are Near-stationary Points","created":"2025-08-18","cited_by_count":16,"area":null},{"id":"2410.01265","title":"Transformers Handle Endogeneity in In-Context Linear Regression","created":"2024-10-02","cited_by_count":8,"area":null},{"id":"2410.11474","title":"How Transformers Get Rich: Approximation and Dynamics Analysis","created":"2024-10-15","cited_by_count":8,"area":null},{"id":"2411.19574","title":"KV Shifting Attention Enhances Language Modeling","created":"2024-11-29","cited_by_count":8,"area":null},{"id":"2509.08184","title":"Selective Induction Heads: How Transformers Select Causal Structures In Context","created":"2025-09-09","cited_by_count":8,"area":null},{"id":"2506.19351","title":"In-Context Occam's Razor: How Transformers Prefer Simpler Hypotheses on the Fly","created":"2025-06-24","cited_by_count":5,"area":null},{"id":"2502.08136","title":"In-Context Learning of Linear Dynamical Systems with Transformers: Approximation Bounds and Depth-Separation","created":"2025-02-12","cited_by_count":4,"area":null},{"id":"2506.07298","title":"Pre-trained Large Language Models Learn Hidden Markov Models In-context","created":"2025-06-08","cited_by_count":4,"area":null},{"id":"2507.20443","title":"Provable In-Context Learning of Nonlinear Regression with Transformers","created":"2025-07-28","cited_by_count":4,"area":null},{"id":"2410.05493","title":"An Information-Theoretic Approach to Understanding Transformers' In-Context Learning of Variable-Order Markov Chains","created":"2024-10-07","cited_by_count":3,"area":null},{"id":"2506.16975","title":"Latent Concept Disentanglement in Transformer-based Language Models","created":"2025-06-20","cited_by_count":3,"area":null},{"id":"2510.16096","title":"Facts in Stats: Impacts of Pretraining Diversity on Language Model Generalization","created":"2025-10-17","cited_by_count":3,"area":null},{"id":"2502.13953","title":"Benchmarking graph construction by large language models for coherence-driven inference","created":"2025-02-19","cited_by_count":2,"area":null},{"id":"2510.25542","title":"Transformers Provably Learn Directed Acyclic Graphs via Kernel-Guided Mutual Information","created":"2025-10-29","cited_by_count":2,"area":null},{"id":"2604.10848","title":"Transformers Learn Latent Mixture Models In-Context via Mirror Descent","created":"2026-04-12","cited_by_count":1,"area":null},{"id":"2605.13485","title":"Effective Context in Transformers: An Analysis of Fragmentation and Tokenization","created":"2026-05-13","cited_by_count":1,"area":null},{"id":"2607.02800","title":"Induction Heads Interpolate N-Grams","created":"2026-07-02","cited_by_count":1,"area":null},{"id":"2507.01414","title":"Decomposing Prediction Mechanisms for In-Context Recall","created":"2025-07-02","cited_by_count":0,"area":null},{"id":"2509.18520","title":"Coherence-driven inference for cybersecurity","created":"2025-09-23","cited_by_count":0,"area":null},{"id":"2510.03784","title":"Performance-Efficiency Tradeoffs in Transformers: An Approximation Theory Perspective","created":"2025-10-04","cited_by_count":0,"area":null},{"id":"2510.18638","title":"Optimality and NP-Hardness of Transformers in Learning Markovian Dynamical Functions","created":"2025-10-21","cited_by_count":0,"area":null},{"id":"2602.07562","title":"Gaussian Match-and-Copy: A Minimalist Benchmark for Studying Transformer Induction","created":"2026-02-07","cited_by_count":0,"area":null},{"id":"2605.18801","title":"Position: Let's Develop Data Probes to Fundamentally Understand How Data Affects LLM Performance","created":"2026-05-11","cited_by_count":0,"area":null},{"id":"2610.18725","title":"Learning Source Structure: Bayesian Prediction with Transformers","created":"2026-10-13","cited_by_count":0,"area":null}],"next_cursor":null}