{"total":33,"rows":[{"id":"2401.08092","title":"A Survey of Resource-efficient LLM and Multimodal Foundation Models","created":"2024-01-16","cited_by_count":86,"area":null},{"id":"2402.09268","title":"Transformers, parallel computation, and logarithmic depth","created":"2024-02-14","cited_by_count":79,"area":null},{"id":"2512.24695","title":"Nested Learning: The Illusion of Deep Learning Architectures","created":"2025-12-31","cited_by_count":72,"area":null},{"id":"2505.23735","title":"ATLAS: Learning to Optimally Memorize the Context at Test Time","created":"2025-05-29","cited_by_count":66,"area":null},{"id":"2506.04761","title":"Log-Linear Attention","created":"2025-06-05","cited_by_count":40,"area":null},{"id":"2410.20399","title":"ThunderKittens: Simple, Fast, and Adorable AI Kernels","created":"2024-10-27","cited_by_count":36,"area":null},{"id":"2405.05219","title":"Conv-Basis: A New Paradigm for Efficient Attention Inference and Gradient Computation in Transformers","created":"2024-05-08","cited_by_count":32,"area":null},{"id":"2501.15061","title":"PolaFormer: Polarity-aware Linear Attention for Vision Transformers","created":"2025-01-25","cited_by_count":32,"area":null},{"id":"2410.07265","title":"A Survey: Collaborative Hardware and Software Design in the Era of Large Language Models","created":"2024-10-08","cited_by_count":23,"area":null},{"id":"2408.13233","title":"Multi-Layer Transformers Gradient Can be Approximated in Almost Linear Time","created":"2024-08-23","cited_by_count":22,"area":null},{"id":"2504.05646","title":"Lattice: Learning to Efficiently Compress the Memory","created":"2025-04-08","cited_by_count":19,"area":null},{"id":"2602.23361","title":"VGG-T$^3$: Offline Feed-Forward 3D Reconstruction at Scale","created":"2026-02-26","cited_by_count":18,"area":null},{"id":"2310.12462","title":"Unmasking Transformers: A Theoretical Approach to Data Recovery via Attention Weights","created":"2023-10-19","cited_by_count":12,"area":null},{"id":"2406.14036","title":"Towards Infinite-Long Prefix in Transformer","created":"2024-06-20","cited_by_count":10,"area":null},{"id":"2511.17388","title":"Selective Rotary Position Embedding","created":"2025-11-21","cited_by_count":9,"area":null},{"id":"2311.13624","title":"A Theoretical Insight into Attack and Defense of Gradient Leakage in Transformer","created":"2023-11-22","cited_by_count":6,"area":null},{"id":"2411.15671","title":"Best of Both Worlds: Advantages of Hybrid Graph Sequence Models","created":"2024-11-23","cited_by_count":6,"area":null},{"id":"2505.14840","title":"Subquadratic Algorithms and Hardness for Attention with Any Temperature","created":"2025-05-20","cited_by_count":5,"area":null},{"id":"2512.23852","title":"Trellis: Learning to Compress Key-Value Memory in Attention Models","created":"2025-12-29","cited_by_count":5,"area":null},{"id":"2411.01663","title":"Unlocking the Theory Behind Scaling 1-Bit Neural Networks","created":"2024-11-03","cited_by_count":4,"area":null},{"id":"2410.05462","title":"LevAttention: Time, Space, and Streaming Efficient Algorithm for Heavy Attentions","created":"2024-10-07","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":"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":"2602.00874","title":"Sublinear Time Quantum Algorithm for Attention Approximation","created":"2026-01-31","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":"2609.36062","title":"SMat-Attention: Structured Long-Context Sequence Modeling","created":"2026-09-28","cited_by_count":1,"area":null},{"id":"2603.04127","title":"Data-Aware Random Feature Kernel for Transformers","created":"2026-03-04","cited_by_count":0,"area":null},{"id":"2603.11332","title":"On the Computational Hardness of Transformers","created":"2026-03-11","cited_by_count":0,"area":null},{"id":"2607.03652","title":"ELiTeFormer: An Efficient Transformer for FPGAs","created":"2026-07-04","cited_by_count":0,"area":null},{"id":"2607.15271","title":"Online Neural Space Time Memory for Dynamic Novel View Synthesis","created":"2026-07-16","cited_by_count":0,"area":null},{"id":"2610.13568","title":"Rationally Linearized MLPs","created":"2026-10-09","cited_by_count":0,"area":null},{"id":"2610.13674","title":"Not All Dimensions Are Equal: Outlier-Aware Attention Linearization with Grouped Quadratic Kernels","created":"2026-10-09","cited_by_count":0,"area":null},{"id":"2610.14219","title":"Learnable Low-Rank Polynomial Sketch for Effective Linear Attention","created":"2026-10-09","cited_by_count":0,"area":null}],"next_cursor":null}