Methods

Coco-Q: Learning in Stochastic Games with Side Payments ICML 2013 Competing with an Infinite Set of Models in Reinforcement Learning AISTATS 2013 Concurrent Reinforcement Learning from Customer Interactions ICML 2013 Convergence of Monte Carlo Tree Search in Simultaneous Move Games NeurIPS 2013 DESPOT: Online POMDP Planning with Regularization NeurIPS 2013 Efficient Exploration and Value Function Generalization in Deterministic Systems NeurIPS 2013 EPMC: Every Visit Preference Monte Carlo for Reinforcement Learning ACML 2013 Estimation Bias in Multi-Armed Bandit Algorithms for Search Advertising NeurIPS 2013 Further Optimal Regret Bounds for Thompson Sampling AISTATS 2013 Guided Policy Search ICML 2013 Improved and Generalized Upper Bounds on the Complexity of Policy Iteration NeurIPS 2013 Integrated Perception and Planning in the Continuous Space: A POMDP Approach RSS 2013 Learning an Internal Dynamics Model from Control Demonstration ICML 2013 Learning from Limited Demonstrations NeurIPS 2013 (More) Efficient Reinforcement Learning via Posterior Sampling NeurIPS 2013 Online Feature Selection for Model-based Reinforcement Learning ICML 2013 Online learning in episodic Markovian decision processes by relative entropy policy search NeurIPS 2013 Online Learning in Markov Decision Processes with Adversarially Chosen Transition Probability Distributions NeurIPS 2013 Optimal Regret Bounds for Selecting the State Representation in Reinforcement Learning ICML 2013 Optimistic policy iteration and natural actor-critic: A unifying view and a non-optimality result NeurIPS 2013 Performance Bounds for λ Policy Iteration and Application to the Game of Tetris JMLR 2013 Point Based Value Iteration with Optimal Belief Compression for Dec-POMDPs NeurIPS 2013 Policy Shaping: Integrating Human Feedback with Reinforcement Learning NeurIPS 2013 Probabilistic Movement Primitives NeurIPS 2013 Projected Natural Actor-Critic NeurIPS 2013