Co-occurring keywords · papers mentioning both
Papers
Learning ε-Nash equilibrium stationary policies in stochastic games with unknown independent chains using online mirror descent
L4DC 2024
Horizon-Free Reinforcement Learning in Polynomial Time: the Power of Stationary Policies
COLT 2022
Regret Bounds for Stochastic Shortest Path Problems with Linear Function Approximation
ICML 2022
Reinforcement Learning with Almost Sure Constraints
L4DC 2022
Q* Approximation Schemes for Batch Reinforcement Learning: A Theoretical Comparison
UAI 2020
On the Use of Non-Stationary Policies for Stationary Infinite-Horizon Markov Decision Processes
NeurIPS 2012
A Reduction of Imitation Learning and Structured Prediction to No-Regret Online Learning
AISTATS 2011
Online Markov Decision Processes under Bandit Feedback
NeurIPS 2010