{"total":14,"rows":[{"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":"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.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":"2206.05947","title":"Lazy and Fast Greedy MAP Inference for Determinantal Point Process","created":"2022-06-13","cited_by_count":5,"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":"2311.03685","title":"Dynamic Non-monotone Submodular Maximization","created":"2023-11-07","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":"2304.06048","title":"RELS-DQN: A Robust and Efficient Local Search Framework for Combinatorial Optimization","created":"2023-04-11","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":"2409.04415","title":"Improved Parallel Algorithm for Non-Monotone Submodular Maximization under Knapsack Constraint","created":"2024-09-06","cited_by_count":0,"area":null},{"id":"2510.21431","title":"Oracle-Efficient Combinatorial Semi-Bandits","created":"2025-10-24","cited_by_count":0,"area":null}],"next_cursor":null}