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

Simple and Optimal Greedy Online Contention Resolution Schemes NIPS 2022
Simple Mechanisms for Welfare Maximization in Rich Advertising Auctions NIPS 2022
Achieving Minimax Rates in Pool-Based Batch Active Learning ICML 2022
Partial Wasserstein Covering AAAI 2022
Robust Subset Selection by Greedy and Evolutionary Pareto Optimization IJCAI 2022
Budgeted Sequence Submodular Maximization IJCAI 2022
Equilibrium Finding in Normal-Form Games via Greedy Regret Minimization AAAI 2022
Adaptive Greedy Algorithm for Moderately Large Dimensions in Kernel Conditional Density Estimation JMLR 2022
Gerrymandering under Uncertain Preferences (Student Abstract) AAAI 2022
Clustering Approach to Solve Hierarchical Classification Problem Complexity AAAI 2022
A Divide and Conquer Algorithm for Predict+Optimize with Non-convex Problems AAAI 2022
Fast Pareto Optimization for Subset Selection with Dynamic Cost Constraints IJCAI 2021
Additive Error Guarantees for Weighted Low Rank Approximation ICML 2021
Instance Specific Approximations for Submodular Maximization ICML 2021
Greedy Approximation Algorithms for Active Sequential Hypothesis Testing NIPS 2021
RETRIEVE: Coreset Selection for Efficient and Robust Semi-Supervised Learning NIPS 2021
Batch greedy maximization of non-submodular functions: Guarantees and applications to experimental design JMLR 2021
A Greedy Algorithm for Quantizing Neural Networks JMLR 2021
Rationales for Sequential Predictions EMNLP 2021
Structure learning in polynomial time: Greedy algorithms, Bregman information, and exponential families NIPS 2021
Near-Optimal Data Source Selection for Bayesian Learning L4DC 2021
Differentiable Greedy Algorithm for Monotone Submodular Maximization: Guarantees, Gradient Estimators, and Applications AISTATS 2021
Online Matching in Sparse Random Graphs: Non-Asymptotic Performances of Greedy Algorithm NIPS 2021
Combining Preference Elicitation with Local Search and Greedy Search for Matroid Optimization AAAI 2021
Maximization of Monotone $k$-Submodular Functions with Bounded Curvature and Non-$k$-Submodular Functions ACML 2021