{"total":30,"rows":[{"id":"2105.05842","title":"Kernel Thinning","created":"2021-05-12","cited_by_count":47,"area":null},{"id":"2110.01593","title":"Generalized Kernel Thinning","created":"2021-10-04","cited_by_count":29,"area":null},{"id":"2106.04254","title":"Coresets for Classification -- Simplified and Strengthened","created":"2021-06-08","cited_by_count":28,"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":"2111.07941","title":"Distribution Compression in Near-linear Time","created":"2021-11-15","cited_by_count":19,"area":null},{"id":"2210.03647","title":"Learnware: Small Models Do Big","created":"2022-10-07","cited_by_count":16,"area":null},{"id":"2502.07861","title":"Streaming Attention Approximation via Discrepancy Theory","created":"2025-02-11","cited_by_count":11,"area":null},{"id":"2307.01877","title":"Fast Private Kernel Density Estimation via Locality Sensitive Quantization","created":"2023-07-04","cited_by_count":9,"area":null},{"id":"2403.08917","title":"Efficiently Computing Similarities to Private Datasets","created":"2024-03-13","cited_by_count":9,"area":null},{"id":"2102.08341","title":"Faster Kernel Matrix Algebra via Density Estimation","created":"2021-02-16","cited_by_count":8,"area":null},{"id":"2107.02736","title":"DEANN: Speeding up Kernel-Density Estimation using Approximate Nearest Neighbor Search","created":"2021-07-06","cited_by_count":8,"area":null},{"id":"2502.12063","title":"Low-Rank Thinning","created":"2025-02-17","cited_by_count":7,"area":null},{"id":"2208.03915","title":"Dynamic Maintenance of Kernel Density Estimation Data Structure: From Practice to Theory","created":"2022-08-08","cited_by_count":6,"area":null},{"id":"2111.03046","title":"Introduction to Coresets: Approximated Mean","created":"2021-11-04","cited_by_count":5,"area":null},{"id":"2302.11075","title":"Deep Active Learning in the Presence of Label Noise: A Survey","created":"2023-02-22","cited_by_count":5,"area":null},{"id":"2402.05280","title":"No Dimensional Sampling Coresets for Classification","created":"2024-02-07","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":"2212.00642","title":"Sub-quadratic Algorithms for Kernel Matrices via Kernel Density Estimation","created":"2022-12-01","cited_by_count":2,"area":null},{"id":"2305.18755","title":"Dimensionality Reduction for General KDE Mode Finding","created":"2023-05-30","cited_by_count":2,"area":null},{"id":"2204.08847","title":"Compressed Empirical Measures (in finite dimensions)","created":"2022-04-19","cited_by_count":1,"area":null},{"id":"2306.13211","title":"Differentially Private Synthetic Data Using KD-Trees","created":"2023-06-19","cited_by_count":1,"area":null},{"id":"2310.08548","title":"Stronger Coreset Bounds for Kernel Density Estimators via Chaining","created":"2023-10-12","cited_by_count":1,"area":null},{"id":"2605.01263","title":"New Bounds for Kernel Sums via Fast Spherical Embeddings","created":"2026-05-02","cited_by_count":1,"area":null},{"id":"2102.12301","title":"Density Sketches for Sampling and Estimation","created":"2021-02-24","cited_by_count":0,"area":null},{"id":"2209.01147","title":"Algorithms for Discrepancy, Matchings, and Approximations: Fast, Simple, and Practical","created":"2022-09-02","cited_by_count":0,"area":null},{"id":"2306.16516","title":"Dimension-Independent Kernel {\\epsilon}-Covers","created":"2023-06-28","cited_by_count":0,"area":null},{"id":"2603.19792","title":"Scalable Learning of Multivariate Distributions via Coresets","created":"2026-03-20","cited_by_count":0,"area":null},{"id":"2605.17642","title":"TabKDE: Simple and Scalable Tabular Data Generation with Kernel Density Estimates","created":"2026-05-17","cited_by_count":0,"area":null},{"id":"2606.15871","title":"Amortized quadrature for posterior expectations in inverse problems","created":"2026-06-14","cited_by_count":0,"area":null},{"id":"2609.06327","title":"Query-Oblivious Coresets for Softmax Attention: Improved Bounds and Efficient Constructions","created":"2026-09-06","cited_by_count":0,"area":null}],"next_cursor":null}