{"total":29,"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":"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":"2108.09420","title":"Fast Sketching of Polynomial Kernels of Polynomial Degree","created":"2021-08-21","cited_by_count":33,"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":"2302.11068","title":"Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time","created":"2023-02-21","cited_by_count":31,"area":null},{"id":"2406.03136","title":"Computational Limits of Low-Rank Adaptation (LoRA) Fine-Tuning for Transformer Models","created":"2024-06-05","cited_by_count":31,"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":"2308.10502","title":"GradientCoin: A Peer-to-Peer Decentralized Large Language Models","created":"2023-08-21","cited_by_count":23,"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":"2210.03961","title":"Dynamic Tensor Product Regression","created":"2022-10-08","cited_by_count":17,"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":"2307.06565","title":"Efficient SGD Neural Network Training via Sublinear Activated Neuron Identification","created":"2023-07-13","cited_by_count":11,"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":"2304.06594","title":"Solving Tensor Low Cycle Rank Approximation","created":"2023-04-13","cited_by_count":8,"area":null},{"id":"2110.07631","title":"More Efficient Sampling for Tensor Decomposition With Worst-Case Guarantees","created":"2021-10-14","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":"2209.04876","title":"Subquadratic Kronecker Regression with Applications to Tensor Decomposition","created":"2022-09-11","cited_by_count":6,"area":null},{"id":"2107.10654","title":"Fast Low-Rank Tensor Decomposition by Ridge Leverage Score Sampling","created":"2021-07-22","cited_by_count":5,"area":null},{"id":"2207.07417","title":"Near-Linear Time and Fixed-Parameter Tractable Algorithms for Tensor Decompositions","created":"2022-07-15","cited_by_count":4,"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":"2112.02446","title":"Fast Graph Neural Tangent Kernel via Kronecker Sketching","created":"2021-12-04","cited_by_count":2,"area":null},{"id":"2410.05700","title":"Log-concave Sampling from a Convex Body with a Barrier: a Robust and Unified Dikin Walk","created":"2024-10-08","cited_by_count":2,"area":null},{"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":"2106.13062","title":"Efficient Tensor Contraction via Fast Count Sketch","created":"2021-06-24","cited_by_count":0,"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":"2502.09534","title":"Fast Tensor Completion via Approximate Richardson Iteration","created":"2025-02-13","cited_by_count":0,"area":null}],"next_cursor":null}