POLAR: A Pessimistic Model-based Policy Learning Algorithm for Dynamic Treatment Regimes
원문 초록
Dynamic treatment regimes (DTRs) provide a principled framework for optimizing sequential decision-making in domains where decisions must adapt over time in response to individual trajectories, such as healthcare, education, and digital interventions. However, existing statistical methods often rely on strong positivity assumptions and lack robustness under partial data coverage, while offline reinforcement learning approaches typically focus on average training performance, lack statistical guarantees, and require solving complex optimization problems. To address these challenges, we propose POLAR, a novel pessimistic model-based policy learning algorithm for offline DTR optimization. POLAR estimates the transition dynamics from offline data and quantifies uncertainty for each history-action pair. A pessimistic penalty is then incorporated into the reward function to discourage actions with high uncertainty. Unlike many existing methods that focus on average training performance, POLAR directly targets the suboptimality of the final learned policy and offers theoretical guarantees, without relying on computationally intensive minimax or constrained optimization procedures. To the best of our knowledge, POLAR is the first model-based DTR method to provide both statistical and computational guarantees, including finite-sample bounds on policy suboptimality. Empirical results on both synthetic data and the MIMIC-III dataset demonstrate that POLAR outperforms state-of-the-art methods and yields near-optimal, history-aware treatment strategies.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Preserving the Privacy of Reward Functions in MDPs through Deception
LLINBO: Trustworthy LLM-in-the-Loop Bayesian Optimization
UProp: Investigating the Uncertainty Propagation of LLMs in Multi-Step Agentic Decision-Making
Common Benchmarks Undervalue the Generalization Power of Programmatic Policies
Adaptive Action Duration with Contextual Bandits for Deep Reinforcement Learning in Dynamic Environments
TextAtari: 100K Frames Game Playing with Language Agents
토론
이 논문과 연결된 포럼 글이 아직 없습니다.