{"total":32,"rows":[{"id":"2310.17157","title":"Deja Vu: Contextual Sparsity for Efficient LLMs at Inference Time","created":"2023-10-26","cited_by_count":252,"area":null},{"id":"2304.10411","title":"Attention Scheme Inspired Softmax Regression","created":"2023-04-20","cited_by_count":49,"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":"2305.00660","title":"An Iterative Algorithm for Rescaled Hyperbolic Functions Regression","created":"2023-05-01","cited_by_count":35,"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":"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":"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":"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.11268","title":"Bypassing the Exponential Dependency: Looped Transformers Efficiently Learn In-context by Multi-step Gradient Descent","created":"2024-10-15","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":"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":"2305.08367","title":"Toward Highly Efficient and Private Submodular Maximization via Matrix-Based Acceleration","created":"2023-05-15","cited_by_count":11,"area":null},{"id":"2307.06565","title":"Efficient SGD Neural Network Training via Sublinear Activated Neuron Identification","created":"2023-07-13","cited_by_count":11,"area":null},{"id":"2305.17482","title":"Federated Empirical Risk Minimization via Second-Order Method","created":"2023-05-27","cited_by_count":9,"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":"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":"2304.06594","title":"Solving Tensor Low Cycle Rank Approximation","created":"2023-04-13","cited_by_count":8,"area":null},{"id":"2306.00406","title":"Faster Robust Tensor Power Method for Arbitrary Order","created":"2023-06-01","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":"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":"2305.08001","title":"Structured and Fast Optimization: The Kronecker SGD Algorithm","created":"2023-05-13","cited_by_count":5,"area":null},{"id":"2306.03356","title":"Query Complexity of Active Learning for Function Family With Nearly Orthogonal Basis","created":"2023-06-06","cited_by_count":4,"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":"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":"2405.06003","title":"Binary Hypothesis Testing for Softmax Models and Leverage Score Models","created":"2024-05-09","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":"2402.01515","title":"Enhancing Stochastic Gradient Descent: A Unified Framework and Novel Acceleration Methods for Faster Convergence","created":"2024-02-02","cited_by_count":0,"area":null}],"next_cursor":null}