conftrace_

value iteration

162 papers

Explore in graph

Also known as

VI

Co-occurring keywords

reinforcement learning (4352) markov decision process (790) regret bound (1926) offline reinforcement learning (492) function approximation (319) dynamic programming (274) policy iteration (99) sample complexity (1169) model-based reinforcement learning (415) policy learning (702)

Papers

Non-delusional Q-learning and value-iteration NIPS 2018
Computational Approaches for Stochastic Shortest Path on Succinct MDPs IJCAI 2018
On Oracle-Efficient PAC RL with Rich Observations NIPS 2018
Planning and Learning with Stochastic Action Sets IJCAI 2018
Gated Path Planning Networks ICML 2018
Value Iteration Networks IJCAI 2017
Minimax Regret Bounds for Reinforcement Learning ICML 2017
Reinforcement Learning under Model Mismatch NIPS 2017
Boosted Fitted Q-Iteration ICML 2017
Value Iteration Networks NIPS 2016
On the Analysis of Complex Backup Strategies in Monte Carlo Tree Search ICML 2016
Generalization and Exploration via Randomized Value Functions ICML 2016
Risk-Sensitive and Robust Decision-Making: a CVaR Optimization Approach NIPS 2015
A Deeper Look at Planning as Learning from Replay ICML 2015
Approximate Modified Policy Iteration and its Application to the Game of Tetris JMLR 2015
Non-Stationary Approximate Modified Policy Iteration ICML 2015
Approximate Dynamic Programming for Two-Player Zero-Sum Markov Games ICML 2015
Covering Number for Efficient Heuristic-based POMDP Planning ICML 2014
Solving Continuous POMDPs: Value Iteration with Incremental Learning of an Efficient Space Representation ICML 2013
Point Based Value Iteration with Optimal Belief Compression for Dec-POMDPs NIPS 2013
Aggregating Optimistic Planning Trees for Solving Markov Decision Processes NIPS 2013
Symbolic Opportunistic Policy Iteration for Factored-Action MDPs NIPS 2013
Variational Planning for Graph-based MDPs NIPS 2013
Value Pursuit Iteration NIPS 2012
Symbolic Dynamic Programming for Continuous State and Observation POMDPs NIPS 2012