{"total":41,"rows":[{"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":"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":"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":"2104.11434","title":"Graph Neural Network Reinforcement Learning for Autonomous Mobility-on-Demand Systems","created":"2021-04-23","cited_by_count":28,"area":null},{"id":"2305.04701","title":"Differentially Private Attention Computation","created":"2023-05-08","cited_by_count":25,"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":"2408.12151","title":"A Tighter Complexity Analysis of SparseGPT","created":"2024-08-22","cited_by_count":19,"area":null},{"id":"2103.07780","title":"Online Double Oracle","created":"2021-03-13","cited_by_count":18,"area":null},{"id":"2111.10723","title":"End-to-end Learning for Fair Ranking Systems","created":"2021-11-21","cited_by_count":18,"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":"2303.12298","title":"A General Algorithm for Solving Rank-one Matrix Sensing","created":"2023-03-22","cited_by_count":15,"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":"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":"2305.17482","title":"Federated Empirical Risk Minimization via Second-Order Method","created":"2023-05-27","cited_by_count":9,"area":null},{"id":"2202.00633","title":"Efficient Policy Space Response Oracles","created":"2022-01-28","cited_by_count":8,"area":null},{"id":"2209.03487","title":"A simple approach for quantizing neural networks","created":"2022-09-07","cited_by_count":8,"area":null},{"id":"2304.06594","title":"Solving Tensor Low Cycle Rank Approximation","created":"2023-04-13","cited_by_count":8,"area":null},{"id":"2405.12952","title":"Truncated Variance Reduced Value Iteration","created":"2024-05-21","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":"2310.17645","title":"PubDef: Defending Against Transfer Attacks From Public Models","created":"2023-10-26","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":"2308.08358","title":"Convergence of Two-Layer Regression with Nonlinear Units","created":"2023-08-16","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":"2205.02771","title":"Finding Bipartite Components in Hypergraphs","created":"2022-05-05","cited_by_count":4,"area":null},{"id":"2306.11121","title":"Projection-Free Online Convex Optimization via Efficient Newton Iterations","created":"2023-06-19","cited_by_count":4,"area":null},{"id":"2502.21240","title":"The Structural Complexity of Matrix-Vector Multiplication","created":"2025-02-28","cited_by_count":4,"area":null},{"id":"2112.11413","title":"Offloading Algorithms for Maximizing Inference Accuracy on Edge Device Under a Time Constraint","created":"2021-12-21","cited_by_count":3,"area":null},{"id":"2201.00228","title":"The Complexity of Dynamic Least-Squares Regression","created":"2022-01-01","cited_by_count":3,"area":null},{"id":"2311.10886","title":"A Whole New Ball Game: A Primal Accelerated Method for Matrix Games and Minimizing the Maximum of Smooth Functions","created":"2023-11-17","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":"2103.07020","title":"Max-Linear Regression by Convex Programming","created":"2021-03-12","cited_by_count":2,"area":null},{"id":"2106.02745","title":"Neural Auto-Curricula","created":"2021-06-04","cited_by_count":2,"area":null},{"id":"2506.20141","title":"Accept More, Reject Less: Reducing up to 19% Unnecessary Desk-Rejections over 11 Years of ICLR Data","created":"2025-06-25","cited_by_count":1,"area":null},{"id":"2404.16131","title":"Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Better","created":"2024-04-24","cited_by_count":0,"area":null},{"id":"2509.21497","title":"Functional Encryption in Secure Neural Network Training: Data Leakage and Practical Mitigations","created":"2025-09-25","cited_by_count":0,"area":null},{"id":"2605.06900","title":"Accelerated Relax-and-Round for Concave Coverage Problems","created":"2026-05-07","cited_by_count":0,"area":null}],"next_cursor":null}