greedy policy

Training Greedy Policy for Proposal Batch Selection in Expensive Multi-Objective Combinatorial Optimization ICML 2024 Learning to Maximize Mutual Information for Dynamic Feature Selection ICML 2023 Adaptivity in Adaptive Submodularity COLT 2021 An Efficient Algorithm for Deep Stochastic Contextual Bandits AAAI 2021 Rebounding Bandits for Modeling Satiation Effects NeurIPS 2021 Adaptive Submodular Maximization under Stochastic Item Costs COLT 2020 Beyond Adaptive Submodularity: Approximation Guarantees of Greedy Policy with Adaptive Submodularity Ratio ICML 2019 Tight Regret Bounds for Model-Based Reinforcement Learning with Greedy Policies NeurIPS 2019 Multiple-Step Greedy Policies in Approximate and Online Reinforcement Learning NeurIPS 2018 Adaptive Submodularity with Varying Query Sets: An Application to Active Multi-label Learning ALT 2017 Global Multi-armed Bandits with Hölder Continuity AISTATS 2015 Sequential Information Maximization: When is Greedy Near-optimal? COLT 2015 Action-Gap Phenomenon in Reinforcement Learning NeurIPS 2011 On the Convergence of Optimistic Policy Iteration JMLR 2002