{"total":32,"rows":[{"id":"2404.03827","title":"Uniform Memory Retrieval with Larger Capacity for Modern Hopfield Models","created":"2024-04-04","cited_by_count":38,"area":null},{"id":"2404.03828","title":"Outlier-Efficient Hopfield Layers for Large Transformer-Based Models","created":"2024-04-04","cited_by_count":38,"area":null},{"id":"2406.03136","title":"Computational Limits of Low-Rank Adaptation (LoRA) Fine-Tuning for Transformer Models","created":"2024-06-05","cited_by_count":31,"area":null},{"id":"2402.04497","title":"The Fine-Grained Complexity of Gradient Computation for Training Large Language Models","created":"2024-02-07","cited_by_count":30,"area":null},{"id":"2405.16411","title":"Training Tensor Attention Efficiently: From Cubic to Almost Linear Time","created":"2024-05-26","cited_by_count":30,"area":null},{"id":"2411.07602","title":"Circuit Complexity Bounds for RoPE-based Transformer Architecture","created":"2024-11-12","cited_by_count":26,"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":"2410.09375","title":"Looped ReLU MLPs May Be All You Need as Practical Programmable Computers","created":"2024-10-12","cited_by_count":19,"area":null},{"id":"2410.10165","title":"HSR-Enhanced Sparse Attention Acceleration","created":"2024-10-14","cited_by_count":19,"area":null},{"id":"2507.18107","title":"T2VWorldBench: A Benchmark for Evaluating World Knowledge in Text-to-Video Generation","created":"2025-07-24","cited_by_count":19,"area":null},{"id":"2310.11685","title":"Why Softmax Attention Outperforms Linear Attention","created":"2023-10-18","cited_by_count":15,"area":null},{"id":"2412.17316","title":"RoPE Attention Can Be Trained in Almost Linear Time","created":"2024-12-23","cited_by_count":13,"area":null},{"id":"2412.18040","title":"Theoretical Constraints on the Expressive Power of $\\mathsf{RoPE}$-based Tensor Attention Transformers","created":"2024-12-23","cited_by_count":12,"area":null},{"id":"2502.16490","title":"On Computational Limits of FlowAR Models: Expressivity and Efficiency","created":"2025-02-23","cited_by_count":10,"area":null},{"id":"2412.05562","title":"Modern Hopfield Networks Require Chain-of-Thought to Solve $\\mathsf{NC}^1$-Hard Problems","created":"2024-12-07","cited_by_count":9,"area":null},{"id":"2505.11892","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","created":"2025-05-17","cited_by_count":9,"area":null},{"id":"2310.20051","title":"The Expressibility of Polynomial based Attention Scheme","created":"2023-10-30","cited_by_count":7,"area":null},{"id":"2505.16284","title":"Only Large Weights (And Not Skip Connections) Can Prevent the Perils of Rank Collapse","created":"2025-05-22","cited_by_count":7,"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":"2311.14652","title":"One Pass Streaming Algorithm for Super Long Token Attention Approximation in Sublinear Space","created":"2023-11-24","cited_by_count":6,"area":null},{"id":"2503.01314","title":"Scaling Law Phenomena Across Regression Paradigms: Multiple and Kernel Approaches","created":"2025-03-03","cited_by_count":4,"area":null},{"id":"2505.19531","title":"Minimalist Softmax Attention Provably Learns Constrained Boolean Functions","created":"2025-05-26","cited_by_count":4,"area":null},{"id":"2407.03250","title":"When big data actually are low-rank, or entrywise approximation of certain function-generated matrices","created":"2024-07-03","cited_by_count":3,"area":null},{"id":"2409.01688","title":"Differentially Private Kernel Density Estimation","created":"2024-09-03","cited_by_count":3,"area":null},{"id":"2502.16912","title":"When Can We Solve the Weighted Low Rank Approximation Problem in Truly Subquadratic Time?","created":"2025-02-24","cited_by_count":3,"area":null},{"id":"2512.22088","title":"Unifying Learning Dynamics and Generalization in Transformers Scaling Law","created":"2025-12-26","cited_by_count":2,"area":null},{"id":"2405.06003","title":"Binary Hypothesis Testing for Softmax Models and Leverage Score Models","created":"2024-05-09","cited_by_count":1,"area":null},{"id":"2410.20926","title":"Long Sequence Modeling with Attention Tensorization: From Sequence to Tensor Learning","created":"2024-10-28","cited_by_count":1,"area":null},{"id":"2510.03678","title":"Towards Sampling Data Structures for Tensor Products in Turnstile Streams","created":"2025-10-04","cited_by_count":1,"area":null},{"id":"2311.11429","title":"Fast Heavy Inner Product Identification Between Weights and Inputs in Neural Network Training","created":"2023-11-19","cited_by_count":0,"area":null},{"id":"2510.05494","title":"Fundamental Limits of Crystalline Equivariant Graph Neural Networks: A Circuit Complexity Perspective","created":"2025-10-07","cited_by_count":0,"area":null},{"id":"2512.15600","title":"How Smoothing is N-simplicial Attention?","created":"2025-12-17","cited_by_count":0,"area":null}],"next_cursor":null}