{"total":23,"rows":[{"id":"2304.10411","title":"Attention Scheme Inspired Softmax Regression","created":"2023-04-20","cited_by_count":49,"area":null},{"id":"2207.05836","title":"Contextual Bandits with Large Action Spaces: Made Practical","created":"2022-07-12","cited_by_count":33,"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":"2308.10502","title":"GradientCoin: A Peer-to-Peer Decentralized Large Language Models","created":"2023-08-21","cited_by_count":23,"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":"2310.02023","title":"Nash Regret Guarantees for Linear Bandits","created":"2023-10-03","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":"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":"2308.08358","title":"Convergence of Two-Layer Regression with Nonlinear Units","created":"2023-08-16","cited_by_count":6,"area":null},{"id":"2211.15118","title":"A Faster $k$-means++ Algorithm","created":"2022-11-28","cited_by_count":4,"area":null},{"id":"2310.00175","title":"Tight Bounds for Volumetric Spanners and Applications","created":"2023-09-29","cited_by_count":4,"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":"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":"2512.16875","title":"Learning Confidence Ellipsoids and Applications to Robust Subspace Recovery","created":"2025-12-18","cited_by_count":2,"area":null},{"id":"2601.22969","title":"Improved Algorithms for Nash Welfare in Linear Bandits","created":"2026-01-30","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":"2405.06003","title":"Binary Hypothesis Testing for Softmax Models and Leverage Score Models","created":"2024-05-09","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":"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}