{"total":37,"rows":[{"id":"2106.10860","title":"Multiplying Matrices Without Multiplying","created":"2021-06-21","cited_by_count":30,"area":null},{"id":"2102.06622","title":"MetaGrad: Adaptation using Multiple Learning Rates in Online Learning","created":"2021-02-12","cited_by_count":26,"area":null},{"id":"2109.09703","title":"Learning to Forecast Dynamical Systems from Streaming Data","created":"2021-09-20","cited_by_count":17,"area":null},{"id":"2302.03764","title":"Sketchy: Memory-efficient Adaptive Regularization with Frequent Directions","created":"2023-02-07","cited_by_count":17,"area":null},{"id":"2308.09543","title":"Latent State Models of Training Dynamics","created":"2023-08-18","cited_by_count":16,"area":null},{"id":"2102.04152","title":"EigenGame Unloaded: When playing games is better than optimizing","created":"2021-02-08","cited_by_count":13,"area":null},{"id":"2106.14952","title":"Adversarial Robustness of Streaming Algorithms through Importance Sampling","created":"2021-06-28","cited_by_count":13,"area":null},{"id":"2502.07861","title":"Streaming Attention Approximation via Discrepancy Theory","created":"2025-02-11","cited_by_count":11,"area":null},{"id":"2302.04859","title":"Projection-free Online Exp-concave Optimization","created":"2023-02-09","cited_by_count":10,"area":null},{"id":"2505.11816","title":"Continuous Subspace Optimization for Continual Learning","created":"2025-05-17","cited_by_count":9,"area":null},{"id":"2410.10258","title":"Revisiting Matrix Sketching in Linear Bandits: Achieving Sublinear Regret via Dyadic Block Sketching","created":"2024-10-14","cited_by_count":4,"area":null},{"id":"2605.05602","title":"Nearly Optimal Attention Coresets","created":"2026-05-07","cited_by_count":4,"area":null},{"id":"2311.03393","title":"Sketching Multidimensional Time Series for Fast Discord Mining","created":"2023-11-05","cited_by_count":3,"area":null},{"id":"2405.07792","title":"Optimal Matrix Sketching over Sliding Windows","created":"2024-05-13","cited_by_count":3,"area":null},{"id":"2512.23190","title":"A Simple, Optimal and Efficient Algorithm for Online Exp-Concave Optimization","created":"2025-12-29","cited_by_count":3,"area":null},{"id":"2101.03196","title":"Sketching Merge Trees for Scientific Data Visualization","created":"2021-01-08","cited_by_count":2,"area":null},{"id":"2110.09163","title":"A Dimensionality Reduction Approach for Convolutional Neural Networks","created":"2021-10-18","cited_by_count":2,"area":null},{"id":"2408.10332","title":"Spectral Guarantees for Adversarial Streaming PCA","created":"2024-08-19","cited_by_count":2,"area":null},{"id":"2503.00937","title":"Learning-Augmented Frequent Directions","created":"2025-03-02","cited_by_count":2,"area":null},{"id":"2604.20078","title":"Improved large-scale graph learning through ridge spectral sparsification","created":"2026-04-22","cited_by_count":2,"area":null},{"id":"2108.10129","title":"Effective Streaming Low-tubal-rank Tensor Approximation via Frequent Directions","created":"2021-08-23","cited_by_count":1,"area":null},{"id":"2109.11703","title":"An Improved Frequent Directions Algorithm for Low-Rank Approximation via Block Krylov Iteration","created":"2021-09-24","cited_by_count":1,"area":null},{"id":"2204.12073","title":"One-pass additive-error subset selection for $\\ell_{p}$ subspace approximation","created":"2022-04-26","cited_by_count":1,"area":null},{"id":"2406.02431","title":"Reweighted Solutions for Weighted Low Rank Approximation","created":"2024-06-04","cited_by_count":1,"area":null},{"id":"2509.16959","title":"Graph Coloring for Multi-Task Learning","created":"2025-09-21","cited_by_count":1,"area":null},{"id":"2103.11107","title":"On Subspace Approximation and Subset Selection in Fewer Passes by MCMC Sampling","created":"2021-03-20","cited_by_count":0,"area":null},{"id":"2109.03709","title":"Speeding up PCA with priming","created":"2021-09-08","cited_by_count":0,"area":null},{"id":"2109.04206","title":"QUINT: Node embedding using network hashing","created":"2021-09-09","cited_by_count":0,"area":null},{"id":"2202.07992","title":"Improved analysis of randomized SVD for top-eigenvector approximation","created":"2022-02-16","cited_by_count":0,"area":null},{"id":"2202.11518","title":"Non-Volatile Memory Accelerated Geometric Multi-Scale Resolution Analysis","created":"2022-02-21","cited_by_count":0,"area":null},{"id":"2205.03194","title":"Scalable computation of prediction intervals for neural networks via matrix sketching","created":"2022-05-06","cited_by_count":0,"area":null},{"id":"2409.04994","title":"Learning nonnegative matrix factorizations from compressed data","created":"2024-09-08","cited_by_count":0,"area":null},{"id":"2510.02470","title":"SAGE: Streaming Agreement-Driven Gradient Sketches for Representative Subset Selection","created":"2025-10-02","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},{"id":"2606.11480","title":"Accurate and Resource-Efficient Federated Continual Learning","created":"2026-06-09","cited_by_count":0,"area":null},{"id":"2606.11968","title":"Efficient Multinomial Logistic Bandit via Frequent Directions","created":"2026-06-10","cited_by_count":0,"area":null},{"id":"2609.27594","title":"Efficient Linear Bandits via Cluster-Aware Sketching","created":"2026-09-23","cited_by_count":0,"area":null}],"next_cursor":null}