← Methods
Reinforcement Learning › Methods ›

Policy Learning

2068 directly classified papers

Papers per year

Papers

Local policy search with Bayesian optimization NIPS 2021
Interesting Object, Curious Agent: Learning Task-Agnostic Exploration NIPS 2021
The best of both worlds: stochastic and adversarial episodic MDPs with unknown transition NIPS 2021
A Sample-Efficient Algorithm for Episodic Finite-Horizon MDP with Constraints AAAI 2021
Uncertainty-Aware Policy Optimization: A Robust, Adaptive Trust Region Approach AAAI 2021
Inverse Reinforcement Learning with Explicit Policy Estimates AAAI 2021
Regularized Policies are Reward Robust AISTATS 2021
Adaptive Approximate Policy Iteration AISTATS 2021
Sample Complexity Bounds for Two Timescale Value-based Reinforcement Learning Algorithms AISTATS 2021
Provable Hierarchical Imitation Learning via EM AISTATS 2021
Optimizing Percentile Criterion using Robust MDPs AISTATS 2021
Algorithms for Fairness in Sequential Decision Making AISTATS 2021
Abstract Value Iteration for Hierarchical Reinforcement Learning AISTATS 2021
Provably Safe PAC-MDP Exploration Using Analogies AISTATS 2021
Q-learning with Logarithmic Regret AISTATS 2021
Minimax Model Learning AISTATS 2021
Reinforcement Learning in Parametric MDPs with Exponential Families AISTATS 2021
Reinforcement Learning for Constrained Markov Decision Processes AISTATS 2021
Provably Efficient Safe Exploration via Primal-Dual Policy Optimization AISTATS 2021
A Kernel-Based Approach to Non-Stationary Reinforcement Learning in Metric Spaces AISTATS 2021
Logistic Q-Learning AISTATS 2021
Iterative Bounding MDPs: Learning Interpretable Policies via Non-Interpretable Methods AAAI 2021
Expected Eligibility Traces AAAI 2021
On Convergence of Gradient Expected Sarsa(λ) AAAI 2021
Sample Complexity of Policy Gradient Finding Second-Order Stationary Points AAAI 2021