conftrace_

optimal policy

93 papers

Explore in graph

Co-occurring keywords

reinforcement learning (4352) markov decision process (790) sample complexity (1169) regret bound (1926) generative model (2892) reward function (291) policy learning (702) online learning (1777) policy optimization (657) value function (295)

Papers

Recursive Reinforcement Learning NIPS 2022
Planning with Participation Constraints AAAI 2022
X-MEN: guaranteed XOR-maximum entropy constrained inverse reinforcement learning UAI 2022
Beyond No Regret: Instance-Dependent PAC Reinforcement Learning COLT 2022
Reward-Free RL is No Harder Than Reward-Aware RL in Linear Markov Decision Processes ICML 2022
Challenging Common Assumptions in Convex Reinforcement Learning NIPS 2022
On the (In)Tractability of Reinforcement Learning for LTL Objectives IJCAI 2022
Reinforcement Learning with Stochastic Reward Machines AAAI 2022
Maximum-Likelihood Inverse Reinforcement Learning with Finite-Time Guarantees NIPS 2022
DeepTOP: Deep Threshold-Optimal Policy for MDPs and RMABs NIPS 2022
Bellman Eluder Dimension: New Rich Classes of RL Problems, and Sample-Efficient Algorithms NIPS 2021
Proper Value Equivalence NIPS 2021
On the Expressivity of Markov Reward NIPS 2021
Optimal Policies Tend To Seek Power NIPS 2021
Sample Complexity Bounds for Stochastic Shortest Path with a Generative Model ALT 2021
Explicable Reward Design for Reinforcement Learning Agents NIPS 2021
On Query-efficient Planning in MDPs under Linear Realizability of the Optimal State-value Function COLT 2021
Uniform-PAC Bounds for Reinforcement Learning with Linear Function Approximation NIPS 2021
Which Mutual-Information Representation Learning Objectives are Sufficient for Control? NIPS 2021
Reinforcement Learning in Reward-Mixing MDPs NIPS 2021
Near Optimal Policy Optimization via REPS NIPS 2021
A Lower Bound for the Sample Complexity of Inverse Reinforcement Learning ICML 2021
Dynamic Planning and Learning under Recovering Rewards ICML 2021
Minimax Regret for Stochastic Shortest Path NIPS 2021
Near-Optimal Provable Uniform Convergence in Offline Policy Evaluation for Reinforcement Learning AISTATS 2021