{"total":48,"rows":[{"id":"2106.04254","title":"Coresets for Classification -- Simplified and Strengthened","created":"2021-06-08","cited_by_count":28,"area":null},{"id":"2107.07480","title":"Newton-LESS: Sparsification without Trade-offs for the Sketched Newton Update","created":"2021-07-15","cited_by_count":23,"area":null},{"id":"2202.12793","title":"Towards Optimal Lower Bounds for k-median and k-means Coresets","created":"2022-02-25","cited_by_count":23,"area":null},{"id":"2302.10359","title":"Replicable Clustering","created":"2023-02-20","cited_by_count":19,"area":null},{"id":"2111.03044","title":"A Unified Approach to Coreset Learning","created":"2021-11-04","cited_by_count":18,"area":null},{"id":"2210.03961","title":"Dynamic Tensor Product Regression","created":"2022-10-08","cited_by_count":17,"area":null},{"id":"2104.08604","title":"Lifelong Learning with Sketched Structural Regularization","created":"2021-04-17","cited_by_count":15,"area":null},{"id":"2111.03193","title":"Explainable k-means. Don't be greedy, plant bigger trees!","created":"2021-11-04","cited_by_count":15,"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":"2107.00798","title":"Near-optimal Algorithms for Explainable k-Medians and k-Means","created":"2021-07-02","cited_by_count":13,"area":null},{"id":"2110.08991","title":"Dimensionality Reduction for Wasserstein Barycenter","created":"2021-10-18","cited_by_count":13,"area":null},{"id":"2312.08893","title":"Solving Dense Linear Systems Faster Than via Preconditioning","created":"2023-12-14","cited_by_count":12,"area":null},{"id":"2103.00564","title":"An Introduction to Johnson-Lindenstrauss Transforms","created":"2021-02-28","cited_by_count":11,"area":null},{"id":"2105.08005","title":"Learning a Latent Simplex in Input-Sparsity Time","created":"2021-05-17","cited_by_count":11,"area":null},{"id":"2211.08597","title":"SketchySGD: Reliable Stochastic Optimization via Randomized Curvature Estimates","created":"2022-11-16","cited_by_count":8,"area":null},{"id":"2207.00966","title":"An Empirical Evaluation of $k$-Means Coresets","created":"2022-07-03","cited_by_count":7,"area":null},{"id":"2405.05818","title":"Fine-grained Analysis and Faster Algorithms for Iteratively Solving Linear Systems","created":"2024-05-09","cited_by_count":7,"area":null},{"id":"2107.01804","title":"Randomized Dimensionality Reduction for Facility Location and Single-Linkage Clustering","created":"2021-07-05","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":"2108.05767","title":"Probabilistic methods for approximate archetypal analysis","created":"2021-08-12","cited_by_count":4,"area":null},{"id":"2207.07417","title":"Near-Linear Time and Fixed-Parameter Tractable Algorithms for Tensor Decompositions","created":"2022-07-15","cited_by_count":4,"area":null},{"id":"2310.09127","title":"On Generalization Bounds for Projective Clustering","created":"2023-10-13","cited_by_count":4,"area":null},{"id":"2402.05280","title":"No Dimensional Sampling Coresets for Classification","created":"2024-02-07","cited_by_count":4,"area":null},{"id":"2404.01936","title":"Settling Time vs. Accuracy Tradeoffs for Clustering Big Data","created":"2024-04-02","cited_by_count":4,"area":null},{"id":"2405.05865","title":"Faster Linear Systems and Matrix Norm Approximation via Multi-level Sketched Preconditioning","created":"2024-05-09","cited_by_count":4,"area":null},{"id":"2411.08773","title":"Optimal Oblivious Subspace Embeddings with Near-optimal Sparsity","created":"2024-11-13","cited_by_count":4,"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":"2310.16752","title":"Simple, Scalable and Effective Clustering via One-Dimensional Projections","created":"2023-10-25","cited_by_count":2,"area":null},{"id":"2412.06063","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","created":"2024-12-08","cited_by_count":2,"area":null},{"id":"2504.20982","title":"Provably faster randomized and quantum algorithms for $k$-means clustering via uniform sampling","created":"2025-04-29","cited_by_count":2,"area":null},{"id":"2303.16841","title":"Randomly Projected Convex Clustering Model: Motivation, Realization, and Cluster Recovery Guarantees","created":"2023-03-29","cited_by_count":1,"area":null},{"id":"2402.16326","title":"A Provably Accurate Randomized Sampling Algorithm for Logistic Regression","created":"2024-02-26","cited_by_count":1,"area":null},{"id":"2408.08494","title":"Optimal Sketching for Residual Error Estimation for Matrix and Vector Norms","created":"2024-08-16","cited_by_count":1,"area":null},{"id":"2412.20189","title":"Accurate Coresets for Latent Variable Models and Regularized Regression","created":"2024-12-28","cited_by_count":1,"area":null},{"id":"2102.04282","title":"Communication-efficient k-Means for Edge-based Machine Learning","created":"2021-02-08","cited_by_count":0,"area":null},{"id":"2209.00372","title":"Sample Efficient Learning of Factored Embeddings of Tensor Fields","created":"2022-09-01","cited_by_count":0,"area":null},{"id":"2211.08184","title":"Improved Coresets for Euclidean $k$-Means","created":"2022-11-15","cited_by_count":0,"area":null},{"id":"2212.08186","title":"Learning Sparsity and Randomness for Data-driven Low Rank Approximation","created":"2022-12-15","cited_by_count":0,"area":null},{"id":"2303.11774","title":"Exact Non-Oblivious Performance of Rademacher Random Embeddings","created":"2023-03-21","cited_by_count":0,"area":null},{"id":"2306.06611","title":"Learning the Positions in CountSketch","created":"2023-06-11","cited_by_count":0,"area":null},{"id":"2307.07405","title":"Performance of $\\ell_1$ Regularization for Sparse Convex Optimization","created":"2023-07-14","cited_by_count":0,"area":null},{"id":"2409.09418","title":"Distributed Clustering based on Distributional Kernel","created":"2024-09-14","cited_by_count":0,"area":null},{"id":"2502.18830","title":"Optimal Approximate Matrix Multiplication over Sliding Windows","created":"2025-02-26","cited_by_count":0,"area":null},{"id":"2502.19865","title":"Beyond Worst-Case Dimensionality Reduction for Sparse Vectors","created":"2025-02-27","cited_by_count":0,"area":null},{"id":"2504.20883","title":"Guessing Efficiently for Constrained Subspace Approximation","created":"2025-04-29","cited_by_count":0,"area":null},{"id":"2506.00165","title":"Randomized Dimensionality Reduction for Euclidean Maximization and Diversity Measures","created":"2025-05-30","cited_by_count":0,"area":null},{"id":"2506.08405","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","created":"2025-06-10","cited_by_count":0,"area":null},{"id":"2508.05831","title":"Optimal Linear Baseline Models for Scientific Machine Learning","created":"2025-08-07","cited_by_count":0,"area":null}],"next_cursor":null}