{"total":24,"rows":[{"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":"2211.14227","title":"Bypass Exponential Time Preprocessing: Fast Neural Network Training via Weight-Data Correlation Preprocessing","created":"2022-11-25","cited_by_count":29,"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":"2407.13621","title":"Differential Privacy Mechanisms in Neural Tangent Kernel Regression","created":"2024-07-18","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":"2306.04169","title":"Efficient Alternating Minimization with Applications to Weighted Low Rank Approximation","created":"2023-06-07","cited_by_count":9,"area":null},{"id":"2310.20051","title":"The Expressibility of Polynomial based Attention Scheme","created":"2023-10-30","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":"2306.12625","title":"Adaptive Compression in Federated Learning via Side Information","created":"2023-06-22","cited_by_count":6,"area":null},{"id":"2311.13624","title":"A Theoretical Insight into Attack and Defense of Gradient Leakage in Transformer","created":"2023-11-22","cited_by_count":6,"area":null},{"id":"2405.17529","title":"Clip Body and Tail Separately: High Probability Guarantees for DPSGD with Heavy Tails","created":"2024-05-27","cited_by_count":5,"area":null},{"id":"2211.01588","title":"A Convergence Theory for Federated Average: Beyond Smoothness","created":"2022-11-03","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":"2408.13787","title":"Mask-Encoded Sparsification: Mitigating Biased Gradients in Communication-Efficient Split Learning","created":"2024-08-25","cited_by_count":2,"area":null},{"id":"2302.10755","title":"Federated Gradient Matching Pursuit","created":"2023-02-20","cited_by_count":1,"area":null},{"id":"2411.06770","title":"Sketched Adaptive Federated Deep Learning: A Sharp Convergence Analysis","created":"2024-11-11","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":"2509.16915","title":"Differential Privacy for Euclidean Jordan Algebra with Applications to Private Symmetric Cone Programming","created":"2025-09-21","cited_by_count":0,"area":null},{"id":"2605.00500","title":"Scaling Federated Linear Contextual Bandits via Sketching","created":"2026-05-01","cited_by_count":0,"area":null}],"next_cursor":null}