{"total":62,"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":"2310.04564","title":"ReLU Strikes Back: Exploiting Activation Sparsity in Large Language Models","created":"2023-10-06","cited_by_count":94,"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.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":"2211.14227","title":"Bypass Exponential Time Preprocessing: Fast Neural Network Training via Weight-Data Correlation Preprocessing","created":"2022-11-25","cited_by_count":29,"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":"2308.12247","title":"How to Protect Copyright Data in Optimization of Large Language Models?","created":"2023-08-23","cited_by_count":26,"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":"2210.08371","title":"Sketching for First Order Method: Efficient Algorithm for Low-Bandwidth Channel and Vulnerability","created":"2022-10-15","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.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":"2408.12151","title":"A Tighter Complexity Analysis of SparseGPT","created":"2024-08-22","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":"2208.03635","title":"Federated Adversarial Learning: A Framework with Convergence Analysis","created":"2022-08-07","cited_by_count":17,"area":null},{"id":"2210.03961","title":"Dynamic Tensor Product Regression","created":"2022-10-08","cited_by_count":17,"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":"2310.11685","title":"Why Softmax Attention Outperforms Linear Attention","created":"2023-10-18","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":"2302.00248","title":"A Nearly-Optimal Bound for Fast Regression with $\\ell_\\infty$ Guarantee","created":"2023-02-01","cited_by_count":14,"area":null},{"id":"2407.13621","title":"Differential Privacy Mechanisms in Neural Tangent Kernel Regression","created":"2024-07-18","cited_by_count":14,"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":"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":"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":"2502.00500","title":"Video Latent Flow Matching: Optimal Polynomial Projections for Video Interpolation and Extrapolation","created":"2025-02-01","cited_by_count":11,"area":"diffusion"},{"id":"2503.09069","title":"Theoretical Guarantees for High Order Trajectory Refinement in Generative Flows","created":"2025-03-12","cited_by_count":10,"area":"diffusion"},{"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":"2310.11291","title":"An Automatic Learning Rate Schedule Algorithm for Achieving Faster Convergence and Steeper Descent","created":"2023-10-17","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":"2309.07452","title":"Is Solving Graph Neural Tangent Kernel Equivalent to Training Graph Neural Network?","created":"2023-09-14","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":"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":"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":"2303.04555","title":"Streaming Kernel PCA Algorithm With Small Space","created":"2023-03-08","cited_by_count":5,"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":"2404.13785","title":"How to Inverting the Leverage Score Distribution?","created":"2024-04-21","cited_by_count":5,"area":null},{"id":"2211.15118","title":"A Faster $k$-means++ Algorithm","created":"2022-11-28","cited_by_count":4,"area":null},{"id":"2410.11279","title":"Advancing the Understanding of Fixed Point Iterations in Deep Neural Networks: A Detailed Analytical Study","created":"2024-10-15","cited_by_count":4,"area":null},{"id":"2501.10688","title":"Neural Algorithmic Reasoning for Hypergraphs with Looped Transformers","created":"2025-01-18","cited_by_count":4,"area":"lr"},{"id":"2408.11267","title":"Inverting the Leverage Score Gradient: An Efficient Approximate Newton Method","created":"2024-08-21","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":"2301.00327","title":"Neural Networks with Sparse Activation Induced by Large Bias: Tighter Analysis with Bias-Generalized NTK","created":"2023-01-01","cited_by_count":2,"area":null},{"id":"2503.14076","title":"Theoretical Foundation of Flow-Based Time Series Generation: Provable Approximation, Generalization, and Efficiency","created":"2025-03-18","cited_by_count":2,"area":"diffusion"},{"id":"2402.07027","title":"Quantum Speedup for Spectral Approximation of Kronecker Products","created":"2024-02-10","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":"2309.01030","title":"Online Adaptive Mahalanobis Distance Estimation","created":"2023-09-02","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":"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}