{"total":52,"rows":[{"id":"2103.00123","title":"GRAD-MATCH: Gradient Matching based Data Subset Selection for Efficient Deep Model Training","created":"2021-02-27","cited_by_count":274,"area":null},{"id":"2207.13887","title":"Adaptive Second Order Coresets for Data-efficient Machine Learning","created":"2022-07-28","cited_by_count":60,"area":null},{"id":"2301.00557","title":"Learning to Maximize Mutual Information for Dynamic Feature Selection","created":"2023-01-02","cited_by_count":56,"area":null},{"id":"2303.04449","title":"Loss-Curvature Matching for Dataset Selection and Condensation","created":"2023-03-08","cited_by_count":33,"area":null},{"id":"2407.15235","title":"TAGCOS: Task-agnostic Gradient Clustered Coreset Selection for Instruction Tuning Data","created":"2024-07-21","cited_by_count":30,"area":null},{"id":"2505.17799","title":"A Coreset Selection of Coreset Selection Literature: Introduction and Recent Advances","created":"2025-05-23","cited_by_count":28,"area":null},{"id":"2203.04940","title":"Data-Efficient Structured Pruning via Submodular Optimization","created":"2022-03-09","cited_by_count":23,"area":null},{"id":"2201.00703","title":"Stochastic Continuous Submodular Maximization: Boosting via Non-oblivious Function","created":"2022-01-03","cited_by_count":21,"area":null},{"id":"2210.05846","title":"FasterRisk: Fast and Accurate Interpretable Risk Scores","created":"2022-10-12","cited_by_count":21,"area":null},{"id":"2306.03301","title":"Estimating Conditional Mutual Information for Dynamic Feature Selection","created":"2023-06-05","cited_by_count":21,"area":null},{"id":"2202.11389","title":"Fast Sparse Classification for Generalized Linear and Additive Models","created":"2022-02-23","cited_by_count":19,"area":null},{"id":"2302.01324","title":"Randomized Greedy Learning for Non-monotone Stochastic Submodular Maximization Under Full-bandit Feedback","created":"2023-02-02","cited_by_count":19,"area":null},{"id":"2106.09207","title":"On the Power of Preconditioning in Sparse Linear Regression","created":"2021-06-17","cited_by_count":15,"area":null},{"id":"2103.10159","title":"SPOT: A framework for selection of prototypes using optimal transport","created":"2021-03-18","cited_by_count":13,"area":null},{"id":"2106.04769","title":"Submodular + Concave","created":"2021-06-09","cited_by_count":13,"area":null},{"id":"2112.00378","title":"$\\ell_\\infty$-Robustness and Beyond: Unleashing Efficient Adversarial Training","created":"2021-12-01","cited_by_count":11,"area":null},{"id":"2209.05785","title":"Adversarial Coreset Selection for Efficient Robust Training","created":"2022-09-13","cited_by_count":9,"area":null},{"id":"2209.14881","title":"Sequential Attention for Feature Selection","created":"2022-09-29","cited_by_count":9,"area":null},{"id":"2410.24222","title":"Robust Gaussian Processes via Relevance Pursuit","created":"2024-10-31","cited_by_count":8,"area":null},{"id":"2304.06686","title":"OKRidge: Scalable Optimal k-Sparse Ridge Regression","created":"2023-04-13","cited_by_count":7,"area":null},{"id":"2106.06095","title":"Sparse Bayesian Learning via Stepwise Regression","created":"2021-06-11","cited_by_count":6,"area":null},{"id":"2210.11033","title":"Neural Estimation of Submodular Functions with Applications to Differentiable Subset Selection","created":"2022-10-20","cited_by_count":6,"area":null},{"id":"2210.11717","title":"A Survey of Dataset Refinement for Problems in Computer Vision Datasets","created":"2022-10-21","cited_by_count":5,"area":null},{"id":"2406.04914","title":"Submodular Framework for Structured-Sparse Optimal Transport","created":"2024-06-07","cited_by_count":5,"area":null},{"id":"2202.13718","title":"Fast Feature Selection with Fairness Constraints","created":"2022-02-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":"2502.18955","title":"Fewer May Be Better: Enhancing Offline Reinforcement Learning with Reduced Dataset","created":"2025-02-26","cited_by_count":4,"area":"offlinerl"},{"id":"2107.02139","title":"Feature Cross Search via Submodular Optimization","created":"2021-07-05","cited_by_count":3,"area":null},{"id":"2212.06836","title":"Towards Efficient and Domain-Agnostic Evasion Attack with High-dimensional Categorical Inputs","created":"2022-12-13","cited_by_count":3,"area":null},{"id":"2102.11911","title":"Instance Specific Approximations for Submodular Maximization","created":"2021-02-23","cited_by_count":2,"area":null},{"id":"2106.15360","title":"Attack Transferability Characterization for Adversarially Robust Multi-label Classification","created":"2021-06-29","cited_by_count":2,"area":null},{"id":"2212.13989","title":"AdvCat: Domain-Agnostic Robustness Assessment for Cybersecurity-Critical Applications with Categorical Inputs","created":"2022-12-13","cited_by_count":2,"area":null},{"id":"2312.12574","title":"Generator Assisted Mixture of Experts For Feature Acquisition in Batch","created":"2023-12-19","cited_by_count":2,"area":"moe"},{"id":"2407.10382","title":"Communication- and Computation-Efficient Distributed Submodular Optimization in Robot Mesh Networks","created":"2024-07-15","cited_by_count":2,"area":null},{"id":"2604.10952","title":"UniPROT: Uniform Prototype Selection via Partial Optimal Transport with Submodular Guarantees","created":"2026-04-13","cited_by_count":2,"area":null},{"id":"2102.09029","title":"Joint Continuous and Discrete Model Selection via Submodularity","created":"2021-02-17","cited_by_count":1,"area":null},{"id":"2205.07217","title":"Online Nonsubmodular Minimization with Delayed Costs: From Full Information to Bandit Feedback","created":"2022-05-15","cited_by_count":1,"area":null},{"id":"2210.16892","title":"Partitioned Gradient Matching-based Data Subset Selection for Compute-Efficient Robust ASR Training","created":"2022-10-30","cited_by_count":1,"area":null},{"id":"2311.03685","title":"Dynamic Non-monotone Submodular Maximization","created":"2023-11-07","cited_by_count":1,"area":null},{"id":"2403.08199","title":"Deep Submodular Peripteral Networks","created":"2024-03-13","cited_by_count":1,"area":null},{"id":"2410.08432","title":"MYCROFT: Towards Effective and Efficient External Data Augmentation","created":"2024-10-11","cited_by_count":1,"area":null},{"id":"2410.19081","title":"FastSurvival: Hidden Computational Blessings in Training Cox Proportional Hazards Models","created":"2024-10-24","cited_by_count":1,"area":null},{"id":"2606.05883","title":"Geometry-Aware Dataset Condensation for Diffusion Model Training","created":"2026-06-04","cited_by_count":1,"area":"diffusion"},{"id":"2307.07405","title":"Performance of $\\ell_1$ Regularization for Sparse Convex Optimization","created":"2023-07-14","cited_by_count":0,"area":null},{"id":"2311.06192","title":"Greedy PIG: Adaptive Integrated Gradients","created":"2023-11-10","cited_by_count":0,"area":null},{"id":"2402.17902","title":"SequentialAttention++ for Block Sparsification: Differentiable Pruning Meets Combinatorial Optimization","created":"2024-02-27","cited_by_count":0,"area":null},{"id":"2410.17945","title":"Theoretically Grounded Pruning of Large Ground Sets for Constrained, Discrete Optimization","created":"2024-10-23","cited_by_count":0,"area":null},{"id":"2511.17399","title":"Stable Coresets via Posterior Sampling: Aligning Induced and Full Loss Landscapes","created":"2025-11-21","cited_by_count":0,"area":null},{"id":"2511.22944","title":"Bandit Guided Submodular Curriculum for Adaptive Subset Selection","created":"2025-11-28","cited_by_count":0,"area":null},{"id":"2606.07954","title":"Minibatch Selection for Language Models via Partition Matroid Constrained Gradient Matching","created":"2026-06-06","cited_by_count":0,"area":null},{"id":"2610.00436","title":"Every Batch Is Its Own Validation Set: Leave-One-Out Gradient Matching for Online Data Selection in LLM Fine-Tuning","created":"2026-09-30","cited_by_count":0,"area":null},{"id":"2610.14942","title":"Probabilistic Multi-Source Data Selection via Learnable Categorical Priors: Variance Reduction and Guaranteed Derandomization","created":"2026-10-10","cited_by_count":0,"area":null}],"next_cursor":null}