{"total":28,"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":"2112.07628","title":"Training Multi-Layer Over-Parametrized Neural Network in Subquadratic Time","created":"2021-12-14","cited_by_count":62,"area":null},{"id":"2304.10411","title":"Attention Scheme Inspired Softmax Regression","created":"2023-04-20","cited_by_count":49,"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":"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":"2306.04933","title":"InfoPrompt: Information-Theoretic Soft Prompt Tuning for Natural Language Understanding","created":"2023-06-08","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":"2208.04508","title":"Training Overparametrized Neural Networks in Sublinear Time","created":"2022-08-09","cited_by_count":22,"area":null},{"id":"2208.05395","title":"A Sublinear Adversarial Training Algorithm","created":"2022-08-10","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":"2111.15139","title":"Breaking the Linear Iteration Cost Barrier for Some Well-known Conditional Gradient Methods Using MaxIP Data-structures","created":"2021-11-30","cited_by_count":19,"area":null},{"id":"2105.08285","title":"Sublinear Least-Squares Value Iteration via Locality Sensitive Hashing","created":"2021-05-18","cited_by_count":15,"area":null},{"id":"2106.09207","title":"On the Power of Preconditioning in Sparse Linear Regression","created":"2021-06-17","cited_by_count":15,"area":null},{"id":"2303.12298","title":"A General Algorithm for Solving Rank-one Matrix Sensing","created":"2023-03-22","cited_by_count":15,"area":null},{"id":"2212.11408","title":"Adaptive and Dynamic Multi-Resolution Hashing for Pairwise Summations","created":"2022-12-21","cited_by_count":14,"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":"2306.04169","title":"Efficient Alternating Minimization with Applications to Weighted Low Rank Approximation","created":"2023-06-07","cited_by_count":9,"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":"2305.08353","title":"Fast and Efficient Matching Algorithm with Deadline Instances","created":"2023-05-15","cited_by_count":7,"area":null},{"id":"2408.06395","title":"Fast John Ellipsoid Computation with Differential Privacy Optimization","created":"2024-08-12","cited_by_count":7,"area":null},{"id":"2112.02446","title":"Fast Graph Neural Tangent Kernel via Kronecker Sketching","created":"2021-12-04","cited_by_count":2,"area":null},{"id":"2208.03811","title":"Decomposable Non-Smooth Convex Optimization with Nearly-Linear Gradient Oracle Complexity","created":"2022-08-07","cited_by_count":0,"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":"2508.12627","title":"On computing and the complexity of computing higher-order $U$-statistics, exactly","created":"2025-08-18","cited_by_count":0,"area":null},{"id":"2512.17950","title":"Which Coauthor Should I Nominate in My 99 ICLR Submissions? A Mathematical Analysis of the ICLR 2026 Reciprocal Reviewer Nomination Policy","created":"2025-12-17","cited_by_count":0,"area":null}],"next_cursor":null}