greedy algorithm

Simple Mechanisms for Welfare Maximization in Rich Advertising Auctions NeurIPS 2022 Towards Understanding the Robustness Against Evasion Attack on Categorical Data ICLR 2022 Two-Sided Weak Submodularity for Matroid Constrained Optimization and Regression COLT 2022 Adaptivity in Adaptive Submodularity COLT 2021 Additive Error Guarantees for Weighted Low Rank Approximation ICML 2021 A Greedy Algorithm for Quantizing Neural Networks JMLR 2021 Batch greedy maximization of non-submodular functions: Guarantees and applications to experimental design JMLR 2021 Combining Preference Elicitation with Local Search and Greedy Search for Matroid Optimization AAAI 2021 Differentiable Greedy Algorithm for Monotone Submodular Maximization: Guarantees, Gradient Estimators, and Applications AISTATS 2021 Efficient greedy coordinate descent via variable partitioning UAI 2021 Fast Pareto Optimization for Subset Selection with Dynamic Cost Constraints IJCAI 2021 Greedy Approximation Algorithms for Active Sequential Hypothesis Testing NeurIPS 2021 Instance Specific Approximations for Submodular Maximization ICML 2021 Local Search Algorithms for Rank-Constrained Convex Optimization ICLR 2021 Maximization of Monotone k-Submodular Functions with Bounded Curvature and Non-k-Submodular Functions ACML 2021 Near-Optimal Data Source Selection for Bayesian Learning L4DC 2021 Online Matching in Sparse Random Graphs: Non-Asymptotic Performances of Greedy Algorithm NeurIPS 2021 Online Selection of Diverse Committees IJCAI 2021 Rationales for Sequential Predictions EMNLP 2021 RETRIEVE: Coreset Selection for Efficient and Robust Semi-Supervised Learning NeurIPS 2021 Streaming and Distributed Algorithms for Robust Column Subset Selection ICML 2021 Structure learning in polynomial time: Greedy algorithms, Bregman information, and exponential families NeurIPS 2021 Unsupervised Extractive Summarization using Pointwise Mutual Information EACL 2021 Adaptive Greedy versus Non-Adaptive Greedy for Influence Maximization AAAI 2020 A Greedy Anytime Algorithm for Sparse PCA COLT 2020