{"total":19,"rows":[{"id":"2407.14245","title":"Dataset Distillation by Automatic Training Trajectories","created":"2024-07-19","cited_by_count":26,"area":null},{"id":"2201.13128","title":"Deletion Robust Submodular Maximization over Matroids","created":"2022-01-31","cited_by_count":7,"area":null},{"id":"2111.03198","title":"On the Complexity of Dynamic Submodular Maximization","created":"2021-11-05","cited_by_count":5,"area":null},{"id":"2111.07917","title":"Best of Both Worlds: Practical and Theoretically Optimal Submodular Maximization in Parallel","created":"2021-11-15","cited_by_count":5,"area":null},{"id":"2310.08122","title":"Core-sets for Fair and Diverse Data Summarization","created":"2023-10-12","cited_by_count":4,"area":null},{"id":"2102.11911","title":"Instance Specific Approximations for Submodular Maximization","created":"2021-02-23","cited_by_count":2,"area":null},{"id":"2208.07582","title":"Deletion Robust Non-Monotone Submodular Maximization over Matroids","created":"2022-08-16","cited_by_count":2,"area":null},{"id":"2206.09563","title":"Scalable Distributed Algorithms for Size-Constrained Submodular Maximization in the MapReduce and Adaptive Complexity Models","created":"2022-06-20","cited_by_count":1,"area":null},{"id":"2301.02814","title":"Randomized Greedy Algorithms and Composable Coreset for k-Center Clustering with Outliers","created":"2023-01-07","cited_by_count":1,"area":null},{"id":"2306.11986","title":"Sequential Recommendation with Controllable Diversification: Representation Degeneration and Diversity","created":"2023-06-21","cited_by_count":1,"area":null},{"id":"2402.16442","title":"On Distributed Larger-Than-Memory Subset Selection With Pairwise Submodular Functions","created":"2024-02-26","cited_by_count":1,"area":null},{"id":"2405.18754","title":"GIST: Greedy Independent Set Thresholding for Max-Min Diversification with Submodular Utility","created":"2024-05-29","cited_by_count":1,"area":null},{"id":"2201.10547","title":"Optimal Data Selection: An Online Distributed View","created":"2022-01-25","cited_by_count":0,"area":null},{"id":"2309.15286","title":"Composable Coresets for Determinant Maximization: Greedy is Almost Optimal","created":"2023-09-26","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":"2407.10003","title":"A Dynamic Algorithm for Weighted Submodular Cover Problem","created":"2024-07-13","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":"2605.06900","title":"Accelerated Relax-and-Round for Concave Coverage Problems","created":"2026-05-07","cited_by_count":0,"area":null},{"id":"2609.09986","title":"A Sharp Barrier for Consistent Submodular Maximization: Any Improvement over $2-\\sqrt{2}$ Entails Exponential Queries or Linear Recourse","created":"2026-09-09","cited_by_count":0,"area":null}],"next_cursor":null}