greedy algorithm

An Efficient Adversarial Attack for Tree Ensembles NeurIPS 2020 “Bring Your Own Greedy”+Max: Near-Optimal 1/2-Approximations for Submodular Knapsack AISTATS 2020 Co-exposure Maximization in Online Social Networks NeurIPS 2020 Decisions, Counterfactual Explanations and Strategic Behavior NeurIPS 2020 Deterministic Approximation for Submodular Maximization over a Matroid in Nearly Linear Time NeurIPS 2020 Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint NeurIPS 2020 Fast Noise Removal for k-Means Clustering AISTATS 2020 Graph-based Nearest Neighbor Search: From Practice to Theory ICML 2020 Greed Meets Sparsity: Understanding and Improving Greedy Coordinate Descent for Sparse Optimization AISTATS 2020 Greedy Convex Ensemble IJCAI 2020 Multi-Objective Multi-Agent Planning for Jointly Discovering and Tracking Mobile Objects AAAI 2020 On Maximization of Weakly Modular Functions: Guarantees of Multi-stage Algorithms, Tractability, and Hardness AISTATS 2020 On the Problem of Covering a 3-D Terrain AAAI 2020 On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness ICML 2020 Optimization of Chance-Constrained Submodular Functions AAAI 2020 Regression under Human Assistance AAAI 2020 Robust Sequence Submodular Maximization NeurIPS 2020 SGAS: Sequential Greedy Architecture Search CVPR 2020 Structured Linear Contextual Bandits: A Sharp and Geometric Smoothed Analysis ICML 2020 Towards Alleviating Traffic Congestion: Optimal Route Planning for Massive-Scale Trips IJCAI 2020 Trading Plan Cost for Timeliness in Situated Temporal Planning IJCAI 2020 Unreasonable Effectiveness of Greedy Algorithms in Multi-Armed Bandit with Many Arms NeurIPS 2020 Adaptive Influence Maximization with Myopic Feedback NeurIPS 2019 A Parameterized Perspective on Protecting Elections IJCAI 2019 BatchBALD: Efficient and Diverse Batch Acquisition for Deep Bayesian Active Learning NeurIPS 2019