Bootstrapping simulation-based algorithms with a suboptimal policy
Finding optimal policies for Markov Decision Processes with large state spaces is in general intractable. Nonetheless, simulation-based algorithms inspired by Sparse Sampling (SS) such as Upper Confidence Bound applied in Trees (UCT) and Forward Search Sparse Sampling (FSSS) have been shown to perfo...
Saved in:
Main Authors: | Nguyen T., Silander T., Lee W., Tze-Yun LEONG |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2014
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/3000 https://ink.library.smu.edu.sg/context/sis_research/article/4000/viewcontent/7934_37003_2_PB.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
A Fast Bandwidth Minimization Algorithm
by: LIM, Andrew, et al.
Published: (2007) -
A sparse sampling model for 3D face recognition
by: Yuan, J., et al.
Published: (2014) -
Respondent-driven sampling and sparse graph convergence
by: Athreya, S., et al.
Published: (2022) -
Sparse Sequential Generalization of K-means for dictionary training on noisy signals
by: Sahoo, Sujit Kumar, et al.
Published: (2017) -
Achieving higher resolution ISAR imaging with limited pulses via compressed sampling
by: Zhang, L., et al.
Published: (2014)