{"total":50,"rows":[{"id":"2410.16179","title":"MagicPIG: LSH Sampling for Efficient LLM Generation","created":"2024-10-21","cited_by_count":111,"area":null},{"id":"2302.13214","title":"Fast Attention Requires Bounded Entries","created":"2023-02-26","cited_by_count":102,"area":null},{"id":"2310.05869","title":"HyperAttention: Long-context Attention in Near-Linear Time","created":"2023-10-09","cited_by_count":85,"area":null},{"id":"2304.10411","title":"Attention Scheme Inspired Softmax Regression","created":"2023-04-20","cited_by_count":49,"area":null},{"id":"2303.16504","title":"An Over-parameterized Exponential Regression","created":"2023-03-29","cited_by_count":45,"area":null},{"id":"2303.15725","title":"Solving Regularized Exp, Cosh and Sinh Regression Problems","created":"2023-03-28","cited_by_count":44,"area":null},{"id":"2310.04064","title":"How to Capture Higher-order Correlations? Generalizing Matrix Softmax Attention to Kronecker Computation","created":"2023-10-06","cited_by_count":44,"area":null},{"id":"2304.13276","title":"The Closeness of In-Context Learning and Weight Shifting for Softmax Regression","created":"2023-04-26","cited_by_count":41,"area":null},{"id":"2304.04397","title":"Randomized and Deterministic Attention Sparsification Algorithms for Over-parameterized Feature Dimension","created":"2023-04-10","cited_by_count":37,"area":null},{"id":"2305.00660","title":"An Iterative Algorithm for Rescaled Hyperbolic Functions Regression","created":"2023-05-01","cited_by_count":35,"area":null},{"id":"2307.02419","title":"In-Context Learning for Attention Scheme: from Single Softmax Regression to Multiple Softmax Regression via a Tensor Trick","created":"2023-07-05","cited_by_count":32,"area":null},{"id":"2306.04933","title":"InfoPrompt: Information-Theoretic Soft Prompt Tuning for Natural Language Understanding","created":"2023-06-08","cited_by_count":30,"area":null},{"id":"2309.07418","title":"A Fast Optimization View: Reformulating Single Layer Attention in LLM Based on Tensor and SVM Trick, and Solving It in Matrix Multiplication Time","created":"2023-09-14","cited_by_count":30,"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":"2306.02295","title":"A Mathematical Abstraction for Balancing the Trade-off Between Creativity and Reality in Large Language Models","created":"2023-06-04","cited_by_count":29,"area":null},{"id":"2305.04701","title":"Differentially Private Attention Computation","created":"2023-05-08","cited_by_count":25,"area":null},{"id":"2308.10502","title":"GradientCoin: A Peer-to-Peer Decentralized Large Language Models","created":"2023-08-21","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":"2308.14304","title":"Solving Attention Kernel Regression Problem via Pre-conditioner","created":"2023-08-28","cited_by_count":20,"area":null},{"id":"2408.12151","title":"A Tighter Complexity Analysis of SparseGPT","created":"2024-08-22","cited_by_count":19,"area":null},{"id":"2307.08045","title":"Beyond Classical Attention: Quantum Attention for Scalable Computation","created":"2023-07-16","cited_by_count":18,"area":null},{"id":"2307.08352","title":"Zero-th Order Algorithm for Softmax Attention Optimization","created":"2023-07-17","cited_by_count":16,"area":null},{"id":"2310.11685","title":"Why Softmax Attention Outperforms Linear Attention","created":"2023-10-18","cited_by_count":15,"area":null},{"id":"2406.05815","title":"What Can We Learn from State Space Models for Machine Learning on Graphs?","created":"2024-06-09","cited_by_count":13,"area":null},{"id":"2309.13482","title":"A Unified Scheme of ResNet and Softmax","created":"2023-09-23","cited_by_count":12,"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":"2410.06441","title":"Addax: Utilizing Zeroth-Order Gradients to Improve Memory Efficiency and Performance of SGD for Fine-Tuning Language Models","created":"2024-10-09","cited_by_count":11,"area":null},{"id":"2502.07861","title":"Streaming Attention Approximation via Discrepancy Theory","created":"2025-02-11","cited_by_count":11,"area":null},{"id":"2311.15390","title":"Local Convergence of Approximate Newton Method for Two Layer Nonlinear Regression","created":"2023-11-26","cited_by_count":9,"area":null},{"id":"2304.06594","title":"Solving Tensor Low Cycle Rank Approximation","created":"2023-04-13","cited_by_count":8,"area":null},{"id":"2310.20051","title":"The Expressibility of Polynomial based Attention Scheme","created":"2023-10-30","cited_by_count":7,"area":null},{"id":"2308.08358","title":"Convergence of Two-Layer Regression with Nonlinear Units","created":"2023-08-16","cited_by_count":6,"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":"2505.17810","title":"VIBE: Vector Index Benchmark for Embeddings","created":"2025-05-23","cited_by_count":6,"area":null},{"id":"2602.10056","title":"WildCat: Near-Linear Attention in Theory and Practice","created":"2026-02-10","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":"2507.23539","title":"Improved Algorithms for Kernel Matrix-Vector Multiplication Under Sparsity Assumptions","created":"2025-07-31","cited_by_count":4,"area":null},{"id":"2605.05602","title":"Nearly Optimal Attention Coresets","created":"2026-05-07","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":"2411.04013","title":"$k$NN Attention Demystified: A Theoretical Exploration for Scalable Transformers","created":"2024-11-06","cited_by_count":1,"area":null},{"id":"2510.02540","title":"Even Faster Kernel Matrix Linear Algebra via Density Estimation","created":"2025-10-02","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":"2602.12851","title":"Chimera: Neuro-Symbolic Attention Primitives for Trustworthy Dataplane Intelligence","created":"2026-02-13","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":"2606.10944","title":"Express Language Modeling","created":"2026-06-09","cited_by_count":0,"area":null},{"id":"2609.37261","title":"Efficiently Approximating Attention Is Hard","created":"2026-09-29","cited_by_count":0,"area":null}],"next_cursor":null}