Josiah Kratz, Jacob Adamczyk
We lifted 1 functions out of this paper's own repositories and ran 1 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| JacobHA/RL4Dosing | canonical | 1 of 1 |
| Function | Status | Where it lives |
|---|---|---|
| get_exp_fn | Ran | JacobHA/RL4Dosing/ddqn.py pointer only (licence: NONE) · get_code("46e35457124c6ee1") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Many organisms and cell types, from bacteria to cancer cells, exhibit a remarkable ability to adapt to fluctuating environments. Additionally, cells can leverage a memory of past environments to better survive previously-encountered stressors. From a control perspective, this adaptability poses significant challenges in driving cell populations toward extinction, and thus poses an open question with great clinical significance. In this work, we focus on drug dosing in cell populations exhibiting phenotypic plasticity. For specific dynamical models switching between resistant and susceptible states, exact solutions are known. However, when the underlying system parameters are unknown, and for complex memorybased systems, obtaining the optimal solution is currently intractable. To address this challenge, we apply reinforcement learning (RL) to identify informed dosing strategies to control cell populations evolving under novel non-Markovian dynamics. We find that model-free deep RL is able to recover exact solutions and control cell populations even in the presence of long-range temporal dynamics. To further test our approach in more realistic settings, we demonstrate robust RL-based control strategies in environments with measurement noise and dynamic memory strength.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2410.08439")
get_code_for_paper("2410.08439")
have("2410.08439")
Connect an agent — have() is free.