Value Iteration
383 papers
Papers per year
3
3
2
5
1
2
5
7
10
11
4
8
12
9
22
37
52
42
38
48
36
23
3
'5
'10
'15
'20
'25
Papers
Sketch-Based Linear Value Function Approximation
NeurIPS 2012
Symbolic Dynamic Programming for Continuous State and Observation POMDPs
NeurIPS 2012
Trajectory-Based Short-Sighted Probabilistic Planning
NeurIPS 2012
Transfer in Reinforcement Learning via Shared Features
JMLR 2012
Value Pursuit Iteration
NeurIPS 2012
Action-Gap Phenomenon in Reinforcement Learning
NeurIPS 2011
A Non-Parametric Approach to Dynamic Programming
NeurIPS 2011
Continuous Rapid Action Value Estimates
ACML 2011
Convergent Fitted Value Iteration with Linear Function Approximation
NeurIPS 2011
Exploiting Best-Match Equations for Efficient Reinforcement Learning
JMLR 2011
Monte Carlo Value Iteration with Macro-Actions
NeurIPS 2011
Periodic Finite State Controllers for Efficient POMDP and DEC-POMDP Planning
NeurIPS 2011
Basis Construction from Power Series Expansions of Value Functions
NeurIPS 2010
Error Propagation for Approximate Policy and Value Iteration
NeurIPS 2010
Finite-sample Analysis of Bellman Residual Minimization
ACML 2010
LSTD with Random Projections
NeurIPS 2010
Monte-Carlo Planning in Large POMDPs
NeurIPS 2010
A Smoothed Approximate Linear Program
NeurIPS 2009
Robust Value Function Approximation Using Bilinear Programming
NeurIPS 2009
Value Function Based Reinforcement Learning in Changing Markovian Environments
JMLR 2008
Optimistic Linear Programming gives Logarithmic Regret for Irreducible MDPs
NeurIPS 2007
Proto-value Functions: A Laplacian Framework for Learning Representation and Control in Markov Decision Processes
JMLR 2007
Random Sampling of States in Dynamic Programming
NeurIPS 2007
Stable Dual Dynamic Programming
NeurIPS 2007
Theoretical Analysis of Heuristic Search Methods for Online POMDPs
NeurIPS 2007