{"total":43,"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":"2108.09420","title":"Fast Sketching of Polynomial Kernels of Polynomial Degree","created":"2021-08-21","cited_by_count":33,"area":null},{"id":"2110.04622","title":"Does Preprocessing Help Training Over-parameterized Neural Networks?","created":"2021-10-09","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":"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":"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":"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":"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":"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":"2212.11408","title":"Adaptive and Dynamic Multi-Resolution Hashing for Pairwise Summations","created":"2022-12-21","cited_by_count":14,"area":null},{"id":"2202.00916","title":"Scalable Decision-Focused Learning in Restless Multi-Armed Bandits with Application to Maternal and Child Health","created":"2022-02-02","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":"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":"2305.17482","title":"Federated Empirical Risk Minimization via Second-Order Method","created":"2023-05-27","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":"2103.04730","title":"Efficient Algorithms for Finite Horizon and Streaming Restless Multi-Armed Bandit Problems","created":"2021-03-08","cited_by_count":6,"area":null},{"id":"2107.12673","title":"COPS: Controlled Pruning Before Training Starts","created":"2021-07-27","cited_by_count":6,"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":"2308.09726","title":"Equitable Restless Multi-Armed Bandits: A General Framework Inspired By Digital Health","created":"2023-08-17","cited_by_count":6,"area":null},{"id":"2107.08090","title":"Near-Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time","created":"2021-07-16","cited_by_count":4,"area":null},{"id":"2211.15118","title":"A Faster $k$-means++ Algorithm","created":"2022-11-28","cited_by_count":4,"area":null},{"id":"2409.07794","title":"Efficient Learning of Balanced Signed Graphs via Iterative Linear Programming","created":"2024-09-12","cited_by_count":4,"area":null},{"id":"2306.10050","title":"Interpolating Item and User Fairness in Multi-Sided Recommendations","created":"2023-06-12","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":"2112.02446","title":"Fast Graph Neural Tangent Kernel via Kronecker Sketching","created":"2021-12-04","cited_by_count":2,"area":null},{"id":"2507.04438","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","created":"2025-07-06","cited_by_count":2,"area":null},{"id":"2110.08260","title":"Abstract Interpretation of Fixpoint Iterators with Applications to Neural Networks","created":"2021-10-14","cited_by_count":1,"area":null},{"id":"2401.01813","title":"Signal Processing in the Retina: Interpretable Graph Classifier to Predict Ganglion Cell Responses","created":"2024-01-03","cited_by_count":1,"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":"2510.03678","title":"Towards Sampling Data Structures for Tensor Products in Turnstile Streams","created":"2025-10-04","cited_by_count":1,"area":null},{"id":"2307.08706","title":"Efficient Strongly Polynomial Algorithms for Quantile Regression","created":"2023-07-14","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}],"next_cursor":null}