conftrace_

greedy algorithm

242 papers

Explore in graph

Co-occurring keywords

submodular optimization (261) submodular maximization (143) approximation algorithm (630) combinatorial optimization (1039) submodular function (121) approximation guarantee (65) cardinality constraint (71) regret bound (1926) feature selection (649) matroid constraint (50)

Papers

Efficient greedy coordinate descent via variable partitioning UAI 2021
Combining Preference Elicitation with Local Search and Greedy Search for Matroid Optimization AAAI 2021
Online Selection of Diverse Committees IJCAI 2021
Fast Pareto Optimization for Subset Selection with Dynamic Cost Constraints IJCAI 2021
Streaming and Distributed Algorithms for Robust Column Subset Selection ICML 2021
Decisions, Counterfactual Explanations and Strategic Behavior NIPS 2020
Unreasonable Effectiveness of Greedy Algorithms in Multi-Armed Bandit with Many Arms NIPS 2020
Deterministic Approximation for Submodular Maximization over a Matroid in Nearly Linear Time NIPS 2020
On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness ICML 2020
Graph-based Nearest Neighbor Search: From Practice to Theory ICML 2020
Structured Linear Contextual Bandits: A Sharp and Geometric Smoothed Analysis ICML 2020
Greed Meets Sparsity: Understanding and Improving Greedy Coordinate Descent for Sparse Optimization AISTATS 2020
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint NIPS 2020
“Bring Your Own Greedy”+Max: Near-Optimal 1/2-Approximations for Submodular Knapsack AISTATS 2020
An Efficient Adversarial Attack for Tree Ensembles NIPS 2020
Robust Sequence Submodular Maximization NIPS 2020
Co-exposure Maximization in Online Social Networks NIPS 2020
Greedy Convex Ensemble IJCAI 2020
Optimization of Chance-Constrained Submodular Functions AAAI 2020
Regression under Human Assistance AAAI 2020
SGAS: Sequential Greedy Architecture Search CVPR 2020
Towards Alleviating Traffic Congestion: Optimal Route Planning for Massive-Scale Trips IJCAI 2020
A Greedy Anytime Algorithm for Sparse PCA COLT 2020
Multi-Objective Multi-Agent Planning for Jointly Discovering and Tracking Mobile Objects AAAI 2020
Fast Noise Removal for k-Means Clustering AISTATS 2020