{"total":24,"rows":[{"id":"2505.16381","title":"PaTH Attention: Position Encoding via Accumulating Householder Transformations","created":"2025-05-22","cited_by_count":34,"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":"2602.03655","title":"Sequential Group Composition: A Window into the Mechanics of Deep Learning","created":"2026-02-03","cited_by_count":10,"area":null},{"id":"2505.21024","title":"Pause Tokens Strictly Increase the Expressivity of Constant-Depth Transformers","created":"2025-05-27","cited_by_count":8,"area":null},{"id":"2505.21785","title":"Born a Transformer -- Always a Transformer? On the Effect of Pretraining on Architectural Abilities","created":"2025-05-27","cited_by_count":6,"area":null},{"id":"2510.00368","title":"The Transformer Cookbook","created":"2025-10-01","cited_by_count":6,"area":null},{"id":"2407.16153","title":"On the Benefits of Rank in Attention Layers","created":"2024-07-23","cited_by_count":5,"area":null},{"id":"2412.20195","title":"Lower bounds on transformers with infinite precision","created":"2024-12-28","cited_by_count":3,"area":null},{"id":"2501.02535","title":"A completely uniform transformer for parity","created":"2025-01-05","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":"2503.11272","title":"When Do Transformers Outperform Feedforward and Recurrent Networks? A Statistical Perspective","created":"2025-03-14","cited_by_count":3,"area":null},{"id":"2509.09001","title":"Fast attention mechanisms: a tale of parallelism","created":"2025-09-10","cited_by_count":3,"area":null},{"id":"2602.11175","title":"Barriers to Discrete Reasoning with Transformers: A Survey Across Depth, Exactness, and Bandwidth","created":"2026-01-19","cited_by_count":3,"area":null},{"id":"2506.12220","title":"Two Heads Are Better than One: Simulating Large Transformers with Small Ones","created":"2025-06-13","cited_by_count":2,"area":null},{"id":"2510.25557","title":"Hybrid Quantum-Classical Recurrent Neural Networks","created":"2025-10-29","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":"2602.01763","title":"A Provable Expressiveness Hierarchy in Hybrid Linear-Full Attention","created":"2026-02-02","cited_by_count":1,"area":null},{"id":"2602.02707","title":"Every Bit Counts: A Theoretical Study of Precision-Expressivity Tradeoffs in Quantized Transformers","created":"2026-02-02","cited_by_count":1,"area":null},{"id":"2605.31558","title":"Positional versus Symbolic Attention Heads: Learning Dynamics, RoPE Geometry, and Length Generalization","created":"2026-05-29","cited_by_count":1,"area":null},{"id":"2604.02201","title":"On the Role of Depth in the Expressivity of RNNs","created":"2026-04-02","cited_by_count":0,"area":null},{"id":"2605.09365","title":"Position: Avoid Overstretching LLMs for every Enterprise Task","created":"2026-05-10","cited_by_count":0,"area":null},{"id":"2605.24168","title":"Inference Time Context Sparsity: Illusion or Opportunity?","created":"2026-05-22","cited_by_count":0,"area":null},{"id":"2607.11760","title":"From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP","created":"2026-07-13","cited_by_count":0,"area":null},{"id":"2608.11427","title":"Three Tokens Force Exponential Feature Rank in Nonnegative Kernel Attention","created":"2026-08-11","cited_by_count":0,"area":null}],"next_cursor":null}