greedy algorithm

Divide and Conquer Dynamic Programming: An Almost Linear Time Change Point Detection Methodology in High Dimensions ICML 2023 Fast Feature Selection with Fairness Constraints AISTATS 2023 Harnessing the power of choices in decision tree learning NeurIPS 2023 How Do You Want Your Greedy: Simultaneous or Repeated? JMLR 2023 Maximizing submodular functions under submodular constraints UAI 2023 Minimum-Entropy Coupling Approximation Guarantees Beyond the Majorization Barrier AISTATS 2023 Now We’re Talking: Better Deliberation Groups through Submodular Optimization AAAI 2023 On the Consistency Rate of Decision Tree Learning Algorithms AISTATS 2023 Optimizing the Placement of Roadside LiDARs for Autonomous Driving ICCV 2023 Randomized Greedy Learning for Non-monotone Stochastic Submodular Maximization Under Full-bandit Feedback AISTATS 2023 Robust Sequence Networked Submodular Maximization AAAI 2023 Sequential Attention for Feature Selection ICLR 2023 Submodular Maximization under the Intersection of Matroid and Knapsack Constraints AAAI 2023 Walkability Optimization: Formulations, Algorithms, and a Case Study of Toronto AAAI 2023 Achieving Minimax Rates in Pool-Based Batch Active Learning ICML 2022 Adaptive Greedy Algorithm for Moderately Large Dimensions in Kernel Conditional Density Estimation JMLR 2022 A Divide and Conquer Algorithm for Predict+Optimize with Non-convex Problems AAAI 2022 Budgeted Sequence Submodular Maximization IJCAI 2022 Clustering Approach to Solve Hierarchical Classification Problem Complexity AAAI 2022 Equilibrium Finding in Normal-Form Games via Greedy Regret Minimization AAAI 2022 Gerrymandering under Uncertain Preferences (Student Abstract) AAAI 2022 Lazy and Fast Greedy MAP Inference for Determinantal Point Process NeurIPS 2022 Partial Wasserstein Covering AAAI 2022 Robust Subset Selection by Greedy and Evolutionary Pareto Optimization IJCAI 2022 Simple and Optimal Greedy Online Contention Resolution Schemes NeurIPS 2022