{"total":34,"rows":[{"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":"2408.12151","title":"A Tighter Complexity Analysis of SparseGPT","created":"2024-08-22","cited_by_count":19,"area":null},{"id":"2410.13780","title":"Optimal Quantization for Matrix Multiplication","created":"2024-10-17","cited_by_count":14,"area":null},{"id":"2312.08893","title":"Solving Dense Linear Systems Faster Than via Preconditioning","created":"2023-12-14","cited_by_count":12,"area":null},{"id":"2402.13187","title":"Testing Calibration in Nearly-Linear Time","created":"2024-02-20","cited_by_count":10,"area":null},{"id":"2405.12952","title":"Truncated Variance Reduced Value Iteration","created":"2024-05-21","cited_by_count":8,"area":null},{"id":"2311.14823","title":"Revisiting Quantum Algorithms for Linear Regressions: Quadratic Speedups without Data-Dependent Parameters","created":"2023-11-24","cited_by_count":7,"area":null},{"id":"2405.05818","title":"Fine-grained Analysis and Faster Algorithms for Iteratively Solving Linear Systems","created":"2024-05-09","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":"2402.07443","title":"The I/O Complexity of Attention, or How Optimal is Flash Attention?","created":"2024-02-12","cited_by_count":6,"area":null},{"id":"2310.18265","title":"Structured Semidefinite Programming for Recovering Structured Preconditioners","created":"2023-10-27","cited_by_count":5,"area":null},{"id":"2410.09568","title":"Second-Order Min-Max Optimization with Lazy Hessians","created":"2024-10-12","cited_by_count":5,"area":null},{"id":"2405.05865","title":"Faster Linear Systems and Matrix Norm Approximation via Multi-level Sketched Preconditioning","created":"2024-05-09","cited_by_count":4,"area":null},{"id":"2409.04411","title":"Approximating Metric Magnitude of Point Sets","created":"2024-09-06","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":"2406.07373","title":"Closing the Computational-Query Depth Gap in Parallel Stochastic Convex Optimization","created":"2024-06-11","cited_by_count":3,"area":null},{"id":"2308.03096","title":"Gradient Coding with Iterative Block Leverage Score Sampling","created":"2023-08-06","cited_by_count":2,"area":null},{"id":"2409.08660","title":"Online Learning Of Expanding Graphs","created":"2024-09-13","cited_by_count":2,"area":null},{"id":"2507.11724","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","created":"2025-07-15","cited_by_count":2,"area":null},{"id":"2608.16884","title":"Improving the matrix multiplication exponent with modern optimization and AlphaEvolve","created":"2026-08-17","cited_by_count":2,"area":null},{"id":"2311.02557","title":"Fast Minimization of Expected Logarithmic Loss via Stochastic Dual Averaging","created":"2023-11-05","cited_by_count":1,"area":null},{"id":"2312.07753","title":"Polynomial-based Self-Attention for Table Representation learning","created":"2023-12-12","cited_by_count":1,"area":null},{"id":"2510.05102","title":"TopInG: Topologically Interpretable Graph Learning via Persistent Rationale Filtration","created":"2025-10-06","cited_by_count":1,"area":null},{"id":"2602.00874","title":"Sublinear Time Quantum Algorithm for Attention Approximation","created":"2026-01-31","cited_by_count":1,"area":null},{"id":"2603.10139","title":"The Generation-Recognition Asymmetry: Six Dimensions of a Fundamental Divide in Formal Language Theory","created":"2026-03-10","cited_by_count":1,"area":null},{"id":"2308.04185","title":"Iterative Sketching for Secure Coded Regression","created":"2023-08-08","cited_by_count":0,"area":null},{"id":"2310.15334","title":"ADMM Algorithms for Residual Network Training: Convergence Analysis and Parallel Implementation","created":"2023-10-23","cited_by_count":0,"area":null},{"id":"2312.03218","title":"Accelerated Gradient Algorithms with Adaptive Subspace Search for Instance-Faster Optimization","created":"2023-12-06","cited_by_count":0,"area":null},{"id":"2503.11037","title":"Resource Constrained Pathfinding with A* and Negative Weights","created":"2025-03-14","cited_by_count":0,"area":null},{"id":"2505.02347","title":"Temporal Robustness in Discrete Time Linear Dynamical Systems","created":"2025-05-05","cited_by_count":0,"area":null},{"id":"2508.18338","title":"Linear cost mutual information estimation and independence test of similar performance as HSIC","created":"2025-08-25","cited_by_count":0,"area":null},{"id":"2509.16627","title":"Conditional Multidimensional Scaling with Incomplete Conditioning Data","created":"2025-09-20","cited_by_count":0,"area":null},{"id":"2602.05541","title":"Reducing the Complexity of Matrix Multiplication by Quantum Computing","created":"2026-02-05","cited_by_count":0,"area":null},{"id":"2606.20082","title":"Beyond Averaging in John Ellipsoid Approximation: High-Accuracy Algorithms in the Leverage-Score Model","created":"2026-06-18","cited_by_count":0,"area":null}],"next_cursor":null}