optimal policy

Explicable Reward Design for Reinforcement Learning Agents NeurIPS 2021 Exponential Lower Bounds for Planning in MDPs With Linearly-Realizable Optimal Action-Value Functions ALT 2021 First-Order Methods for Wasserstein Distributionally Robust MDP ICML 2021 Inverse Reinforcement Learning From Like-Minded Teachers AAAI 2021 Lipschitz Lifelong Reinforcement Learning AAAI 2021 Minimax Regret for Stochastic Shortest Path NeurIPS 2021 Near Optimal Policy Optimization via REPS NeurIPS 2021 Near-Optimal Provable Uniform Convergence in Offline Policy Evaluation for Reinforcement Learning AISTATS 2021 On Query-efficient Planning in MDPs under Linear Realizability of the Optimal State-value Function COLT 2021 On the Expressivity of Markov Reward NeurIPS 2021 Optimal Policies Tend To Seek Power NeurIPS 2021 Primal-dual Learning for the Model-free Risk-constrained Linear Quadratic Regulator L4DC 2021 Proper Value Equivalence NeurIPS 2021 Reinforcement Learning in Reward-Mixing MDPs NeurIPS 2021 Sample Complexity Bounds for Stochastic Shortest Path with a Generative Model ALT 2021 Towards Tight Bounds on the Sample Complexity of Average-reward MDPs ICML 2021 Uniform-PAC Bounds for Reinforcement Learning with Linear Function Approximation NeurIPS 2021 Which Mutual-Information Representation Learning Objectives are Sufficient for Control? NeurIPS 2021 Estimating Q(s,s’) with Deep Deterministic Dynamics Gradients ICML 2020 Is Long Horizon RL More Difficult Than Short Horizon RL? NeurIPS 2020 Logarithmic Regret for Learning Linear Quadratic Regulators Efficiently ICML 2020 Near-optimal Regret Bounds for Stochastic Shortest Path ICML 2020 Reinforcement Learning with Non-Markovian Rewards AAAI 2020 Sublinear Optimal Policy Value Estimation in Contextual Bandits AISTATS 2020 Task Scoping for Efficient Planning in Open Worlds (Student Abstract) AAAI 2020