{"total":30,"rows":[{"id":"2106.04254","title":"Coresets for Classification -- Simplified and Strengthened","created":"2021-06-08","cited_by_count":28,"area":null},{"id":"2410.01917","title":"Provably Accurate Shapley Value Estimation via Leverage Score Sampling","created":"2024-10-02","cited_by_count":23,"area":null},{"id":"2510.11686","title":"Representation-Based Exploration for Language Models: From Test-Time to Post-Training","created":"2025-10-13","cited_by_count":16,"area":null},{"id":"2207.08268","title":"Online Lewis Weight Sampling","created":"2022-07-17","cited_by_count":15,"area":null},{"id":"2210.14664","title":"Coresets for Vertical Federated Learning: Regularized Linear Regression and $K$-Means Clustering","created":"2022-10-26","cited_by_count":14,"area":null},{"id":"2210.13601","title":"Active Learning for Single Neuron Models with Lipschitz Non-Linearities","created":"2022-10-24","cited_by_count":12,"area":null},{"id":"2110.03195","title":"Coresets for Decision Trees of Signals","created":"2021-10-07","cited_by_count":10,"area":null},{"id":"2202.04515","title":"Leverage Score Sampling for Tensor Product Matrices in Input Sparsity Time","created":"2022-02-09","cited_by_count":6,"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":"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":"2505.14083","title":"Computational Efficiency under Covariate Shift in Kernel Ridge Regression","created":"2025-05-20","cited_by_count":4,"area":null},{"id":"2201.00228","title":"The Complexity of Dynamic Least-Squares Regression","created":"2022-01-01","cited_by_count":3,"area":null},{"id":"2201.07289","title":"Sparsification of Decomposable Submodular Functions","created":"2022-01-18","cited_by_count":3,"area":null},{"id":"2105.11004","title":"Estimating leverage scores via rank revealing methods and randomization","created":"2021-05-23","cited_by_count":2,"area":null},{"id":"2212.12737","title":"Reconstructing Kernel-based Machine Learning Force Fields with Super-linear Convergence","created":"2022-12-24","cited_by_count":2,"area":null},{"id":"2308.03096","title":"Gradient Coding with Iterative Block Leverage Score Sampling","created":"2023-08-06","cited_by_count":2,"area":null},{"id":"2407.03262","title":"Ridge Leverage Score Sampling for $\\ell_p$ Subspace Approximation","created":"2024-07-03","cited_by_count":2,"area":null},{"id":"2507.11724","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","created":"2025-07-15","cited_by_count":2,"area":null},{"id":"2112.12994","title":"Toeplitz Least Squares Problems, Fast Algorithms and Big Data","created":"2021-12-24","cited_by_count":1,"area":null},{"id":"2208.14797","title":"Sparsification of the regularized magnetic Laplacian with multi-type spanning forests","created":"2022-08-31","cited_by_count":1,"area":null},{"id":"2401.00122","title":"SALSA: Sequential Approximate Leverage-Score Algorithm with Application in Analyzing Big Time Series Data","created":"2023-12-30","cited_by_count":1,"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.12669","title":"Structure-Aware Spectral Sparsification via Uniform Edge Sampling","created":"2025-10-14","cited_by_count":1,"area":null},{"id":"2106.08544","title":"Non-PSD Matrix Sketching with Applications to Regression and Optimization","created":"2021-06-16","cited_by_count":0,"area":null},{"id":"2311.04158","title":"Computing Approximate $\\ell_p$ Sensitivities","created":"2023-11-07","cited_by_count":0,"area":null},{"id":"2408.05431","title":"Simple and Nearly-Optimal Sampling for Rank-1 Tensor Completion via Gauss-Jordan","created":"2024-08-10","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},{"id":"2507.02215","title":"Hybrid least squares for learning functions from highly noisy data","created":"2025-07-03","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}