On Query-efficient Planning in MDPs under Linear Realizability of the Optimal State-value Function.
Gellért WeiszPhilip AmortilaBarnabás JanzerYasin Abbasi-YadkoriNan JiangCsaba SzepesváriPublished in: COLT (2021)
Keyphrases
- piecewise linear
- state space
- semi infinite programming
- database
- dynamic programming
- initial state
- reinforcement learning
- stochastic domains
- closed form
- heuristic search
- markov decision processes
- response time
- query evaluation
- control policy
- optimal solution
- query processing
- optimal planning
- data sources
- range queries
- partially observable
- finite horizon
- transition probabilities
- linear space
- relevance feedback
- markov decision problems
- optimal plans
- decision theoretic planning
- planning problems
- discounted reward