Deep Reinforcement Learning for Controlled Traversing of the Attractor Landscape of Boolean Models in the Context of Cellular Reprogramming
Not on the map. Why?
Abstract (arXiv)
Cellular reprogramming can be used for both the prevention and cure of different diseases. However, the efficiency of discovering reprogramming strategies with classical wet-lab experiments is hindered by lengthy time commitments and high costs. In this study, we develop a novel computational framework based on deep reinforcement learning that facilitates the identification of reprogramming strategies. For this aim, we formulate a control problem in the context of cellular reprogramming for the frameworks of BNs and PBNs under the asynchronous update mode. Furthermore, we introduce the notion of a pseudo-attractor and a procedure for identification of pseudo-attractor state during training. Finally, we devise a computational framework for solving the control problem, which we test on a number of different models.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 9 of its 32 references that are in the map. First posted on arXiv 13 Feb 2024.
Builds on
9 of 32 references.
References · 9
- 2018Addressing Function Approximation Error in Actor-Critic Methodscited by 2,302
- 2015Deep Reinforcement Learning with Double Q-learningcited by 1,704
- 2015Dueling Network Architectures for Deep Reinforcement Learningcited by 769
- 2017Action Branching Architectures for Deep Reinforcement Learningcited by 90
- 2020A Survey of Reinforcement Learning Algorithms for Dynamically Varying Environmentscited by 62
- 2015Control of complex networks requires both structure and dynamicscited by 2
- 2022Marker and source-marker reprogramming of Most Permissive Boolean networks and ensembles with BoNesiscited by 2
- 2022Deep Reinforcement Learning for Stabilization of Large-scale Probabilistic Boolean Networkscited by 2
- 2020A Dynamics-based Approach for the Target Control of Boolean Networkscited by 1
Built on by
Citing papers per year: 2025: 1.
1 paper.