Back to Search
Start Over
Fast and Highly Scalable Bayesian MDP on a GPU Platform
- Source :
- BCB
- Publication Year :
- 2017
- Publisher :
- ACM, 2017.
-
Abstract
- By employing the Optimal Bayesian Robust (OBR) policy, Bayesian Markov Decision Process (BMDP) can be used to solve the Gene Regulatory Network (GRN) control problem. However, due to the "curse of dimensionality", the data storage limitation hinders the practical applicability of the BMDP. To overcome this impediment, we propose a novel Duplex Sparse Storage (DSS) scheme in this paper, and develop a BMDP solver with the DSS scheme on a heterogeneous GPU-based platform. The simulation results demonstrate that our approach achieves a 5x reduction in memory utilization with a 2.4% "decision difference" and an average speedup of 4.1x compared to the full matrix based storage scheme. Additionally, we present the tradeoff between the runtime and result accuracy for our DSS techniques versus the full matrix approach. We also compare our results with the well known Compressed Sparse Row (CSR) approach for reducing memory utilization, and discuss the benefits of DSS over CSR.
- Subjects :
- 0301 basic medicine
050208 finance
Speedup
Computer science
business.industry
05 social sciences
Bayesian probability
Duplex (telecommunications)
Parallel computing
Solver
Machine learning
computer.software_genre
03 medical and health sciences
030104 developmental biology
0502 economics and business
Computer data storage
Scalability
Markov decision process
Artificial intelligence
business
computer
Curse of dimensionality
Subjects
Details
- Database :
- OpenAIRE
- Journal :
- Proceedings of the 8th ACM International Conference on Bioinformatics, Computational Biology,and Health Informatics
- Accession number :
- edsair.doi...........ce8ba1fa760f4e2cd716722a45e9c06c
- Full Text :
- https://doi.org/10.1145/3107411.3107440