approximation guarantee

Improved Maximin Guarantees for Subadditive and Fractionally Subadditive Fair Allocation Problem AAAI 2022 On the Approximation of Cooperative Heterogeneous Multi-Agent Reinforcement Learning (MARL) using Mean Field Control (MFC) JMLR 2022 Adaptivity in Adaptive Submodularity COLT 2021 Differentially Private Densest Subgraph Detection ICML 2021 Expressive Power of Invariant and Equivariant Graph Neural Networks ICLR 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 Submodular + Concave NeurIPS 2021 Adaptive Submodular Maximization under Stochastic Item Costs COLT 2020 An Efficient Evolutionary Algorithm for Subset Selection with General Cost Constraints AAAI 2020 Bayesian experimental design using regularized determinantal point processes AISTATS 2020 Co-exposure Maximization in Online Social Networks NeurIPS 2020 k-means++: few more steps yield constant approximation ICML 2020 More Accurate Learning of k-DNF Reference Classes AAAI 2020 On Maximization of Weakly Modular Functions: Guarantees of Multi-stage Algorithms, Tractability, and Hardness AISTATS 2020 On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness ICML 2020 Provable guarantees for decision tree induction: the agnostic setting ICML 2020 Streaming k-Submodular Maximization under Noise subject to Size Constraint ICML 2020 The FAST Algorithm for Submodular Maximization ICML 2020 Universal Simulation of Stable Dynamical Systems by Recurrent Neural Nets L4DC 2020 A Better k-means++ Algorithm via Local Search ICML 2019 Beyond Adaptive Submodularity: Approximation Guarantees of Greedy Policy with Adaptive Submodularity Ratio ICML 2019 Categorical Feature Compression via Submodular Optimization ICML 2019 Combinatorial Algorithms for Optimal Design COLT 2019