{"total":28,"rows":[{"id":"2402.09668","title":"How to Train Data-Efficient LLMs","created":"2024-02-15","cited_by_count":93,"area":null},{"id":"2209.08554","title":"Pruning Neural Networks via Coresets and Convex Geometry: Towards No Assumptions","created":"2022-09-18","cited_by_count":20,"area":null},{"id":"2207.08268","title":"Online Lewis Weight Sampling","created":"2022-07-17","cited_by_count":15,"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":"2203.13568","title":"$p$-Generalized Probit Regression and Scalable Maximum Likelihood Estimation via Sketching and Coresets","created":"2022-03-25","cited_by_count":11,"area":null},{"id":"2405.09312","title":"Agnostic Active Learning of Single Index Models with Linear Sample Complexity","created":"2024-05-15","cited_by_count":11,"area":null},{"id":"2207.00966","title":"An Empirical Evaluation of $k$-Means Coresets","created":"2022-07-03","cited_by_count":7,"area":null},{"id":"2304.02261","title":"Optimal Sketching Bounds for Sparse Linear Regression","created":"2023-04-05","cited_by_count":6,"area":null},{"id":"2310.04966","title":"Improved Active Learning via Dependent Leverage Score Sampling","created":"2023-10-08","cited_by_count":6,"area":null},{"id":"2403.00680","title":"Scalable Learning of Item Response Theory Models","created":"2024-03-01","cited_by_count":6,"area":null},{"id":"2301.06163","title":"A Coreset Learning Reality Check","created":"2023-01-15","cited_by_count":5,"area":null},{"id":"2407.06120","title":"Sketchy Moment Matching: Toward Fast and Provable Data Selection for Finetuning","created":"2024-07-08","cited_by_count":5,"area":null},{"id":"2301.12052","title":"Leveraging Importance Weights in Subset Selection","created":"2023-01-28","cited_by_count":4,"area":null},{"id":"2303.14284","title":"Feature Space Sketching for Logistic Regression","created":"2023-03-24","cited_by_count":4,"area":null},{"id":"2406.00328","title":"Optimal bounds for $\\ell_p$ sensitivity sampling via $\\ell_2$ augmentation","created":"2024-06-01","cited_by_count":3,"area":null},{"id":"2406.00339","title":"Turnstile $\\ell_p$ leverage score sampling with applications","created":"2024-06-01","cited_by_count":3,"area":null},{"id":"2312.09885","title":"Simple Weak Coresets for Non-Decomposable Classification Measures","created":"2023-12-15","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":"2412.20189","title":"Accurate Coresets for Latent Variable Models and Regularized Regression","created":"2024-12-28","cited_by_count":1,"area":null},{"id":"2210.04807","title":"Efficient NTK using Dimensionality Reduction","created":"2022-10-10","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":"2311.04158","title":"Computing Approximate $\\ell_p$ Sensitivities","created":"2023-11-07","cited_by_count":0,"area":null},{"id":"2412.02639","title":"The Space Complexity of Approximating Logistic Loss","created":"2024-12-03","cited_by_count":0,"area":null},{"id":"2503.05981","title":"Near-Polynomially Competitive Active Logistic Regression","created":"2025-03-07","cited_by_count":0,"area":null},{"id":"2505.12353","title":"Importance Sampling for Nonlinear Models","created":"2025-05-18","cited_by_count":0,"area":null},{"id":"2506.10775","title":"Monotone Classification with Relative Approximations","created":"2025-06-12","cited_by_count":0,"area":null},{"id":"2601.00361","title":"Deterministic Coreset for Lp Subspace","created":"2026-01-01","cited_by_count":0,"area":null},{"id":"2609.06394","title":"Beyond Worst-Case Coreset Bounds for $k$-Clustering via Determinantal Sampling","created":"2026-09-06","cited_by_count":0,"area":null}],"next_cursor":null}