← Methods
Reinforcement Learning › Methods ›

Value Iteration

79 directly classified papers

Papers per year

Papers

Aggregating Optimistic Planning Trees for Solving Markov Decision Processes NIPS 2013
Bellman Error Based Feature Generation using Random Projections on Sparse Spaces NIPS 2013
Symbolic Opportunistic Policy Iteration for Factored-Action MDPs NIPS 2013
Variational Planning for Graph-based MDPs NIPS 2013
Efficient Exploration and Value Function Generalization in Deterministic Systems NIPS 2013
Point Based Value Iteration with Optimal Belief Compression for Dec-POMDPs NIPS 2013
Robust Data-Driven Dynamic Programming NIPS 2013
Symbolic Dynamic Programming for Continuous State and Observation POMDPs NIPS 2012
Optimistic planning for Markov decision processes AISTATS 2012
Trajectory-Based Short-Sighted Probabilistic Planning NIPS 2012
Sketch-Based Linear Value Function Approximation NIPS 2012
Value Pursuit Iteration NIPS 2012
Risk Aversion in Markov Decision Processes via Near Optimal Chernoff Bounds NIPS 2012
Periodic Finite State Controllers for Efficient POMDP and DEC-POMDP Planning NIPS 2011
Convergent Fitted Value Iteration with Linear Function Approximation NIPS 2011
Monte Carlo Value Iteration with Macro-Actions NIPS 2011
Continuous Rapid Action Value Estimates ACML 2011
A Non-Parametric Approach to Dynamic Programming NIPS 2011
Error Propagation for Approximate Policy and Value Iteration NIPS 2010
Basis Construction from Power Series Expansions of Value Functions NIPS 2010
Finite-sample Analysis of Bellman Residual Minimization ACML 2010
LSTD with Random Projections NIPS 2010
Robust Value Function Approximation Using Bilinear Programming NIPS 2009
A Smoothed Approximate Linear Program NIPS 2009
Random Sampling of States in Dynamic Programming NIPS 2007