{"total":14,"rows":[{"id":"2106.01420","title":"Parallelizing Thompson Sampling","created":"2021-06-02","cited_by_count":20,"area":null},{"id":"2209.14881","title":"Sequential Attention for Feature Selection","created":"2022-09-29","cited_by_count":9,"area":null},{"id":"2102.08327","title":"Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity","created":"2021-02-16","cited_by_count":8,"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":"2202.13718","title":"Fast Feature Selection with Fairness Constraints","created":"2022-02-28","cited_by_count":4,"area":null},{"id":"2102.06486","title":"Adaptive Sampling for Fast Constrained Maximization of Submodular Function","created":"2021-02-12","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":"2308.10656","title":"Practical Parallel Algorithms for Non-Monotone Submodular Maximization","created":"2023-08-21","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":"2511.15507","title":"Sample-Adaptivity Tradeoff in On-Demand Sampling","created":"2025-11-19","cited_by_count":1,"area":null},{"id":"2311.06192","title":"Greedy PIG: Adaptive Integrated Gradients","created":"2023-11-10","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":"2606.07954","title":"Minibatch Selection for Language Models via Partition Matroid Constrained Gradient Matching","created":"2026-06-06","cited_by_count":0,"area":null}],"next_cursor":null}