Search arXivSearch

arXiv · 2512.08029

CLARITY: Medical World Model for Guiding Treatment Decisions by Simulating Context-Aware Disease Trajectories

Abstract

Clinical decision-making in oncology requires forecasting how disease evolves under treatment, yet most AI systems remain static predictors that cannot model longitudinal, treatment-conditioned progression. Although generative and world models have demonstrated strong capabilities in general domains, their adaptation to medicine remains limited and insufficient for capturing complex, treatment-induced physiological dynamics across temporal scales. To address these gaps, we introduce CLARITY, a medical world model that enables counterfactual simulation of treatment-conditioned disease trajectories for clinical decision-making. By jointly encoding imaging-derived latent states, temporal intervals that capture irregular follow-ups, and patient-specific clinical context, CLARITY learns smooth and interpretable representations of disease progression, allowing the model to simulate how alternative treatments reshape future disease dynamics. Because treatment optimization is inherently sequential and uncertain, requiring evaluation of long-term outcomes across multiple possible interventions, we further propose an entropy-regularized, computationally efficient long-horizon prediction-to-decision framework that plans treatment strategies over imagined disease trajectories and iteratively refines therapy proposals through survival-aware feedback, forming a closed-loop simulation-to-decision framework for treatment planning. CLARITY achieves state-of-the-art performance in treatment planning and survival prediction across three cancer datasets, including two brain tumor cohorts (MU-Glioma-Post and zero-shot on UCSF-ALPTDG) and one breast cancer dataset (ISPY-2), demonstrating strong generalization across cancer types while consistently outperforming prior generative methods and medical-domain large language model baselines.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tianxingjian Ding, Yuanhao Zou, Chen Chen, Mubarak Shah, Yu Tian. 2026-09-19. CLARITY: Medical World Model for Guiding Treatment Decisions by Simulating Context-Aware Disease Trajectories. https://arxiv.org/abs/2512.08029

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Online Regularized Statistical Learning in Reproducing Kernel Hilbert Space With Non-Stationary Data

We study recursive regularized learning algorithms in the reproducing kernel Hilbert space (RKHS) with non-stationary online data streams. We introduce the concept of a random Tikhonov regularization path and decompose the tracking error of the algorithm's output for the regularization path into random difference equations in RKHS. We show that the tracking error vanishes in mean square and almost surely if the regularization path is slowly time-varying. Then, leveraging the monotonicity of inverse operators and the spectral decomposition of compact operators, and introducing the RKHS persistence of excitation condition, we develop a dominated convergence method to prove the mean square and almost sure consistency between the regularization path and the unknown function to be learned. Especially, for independent and non-identically distributed data streams, the mean square and almost sure consistency between the algorithm's output and the unknown function is achieved if the input data's marginal probability measures are slowly time-varying and the average measure over each fixed-length time period is uniformly above a strictly positive finite Borel measure.

cs.LG

Reflective Policy Optimization

On-policy reinforcement learning methods, like Trust Region Policy Optimization (TRPO) and Proximal Policy Optimization (PPO), often demand extensive data per update, leading to sample inefficiency. This paper introduces Reflective Policy Optimization (RPO), a novel on-policy extension that amalgamates past and future state-action information for policy optimization. This approach empowers the agent for introspection, allowing modifications to its actions within the current state. Theoretical analysis confirms that policy performance is monotonically improved and contracts the solution space, consequently expediting the convergence procedure. Empirical results demonstrate RPO's feasibility and efficacy in two reinforcement learning benchmarks, culminating in superior sample efficiency. The source code of this work is available at https://github.com/Edgargan/RPO.

cs.LG

Transductive Off-policy Proximal Policy Optimization

Proximal Policy Optimization (PPO) is a popular model-free reinforcement learning algorithm, esteemed for its simplicity and efficacy. However, due to its inherent on-policy nature, its proficiency in harnessing data from disparate policies is constrained. This paper introduces a novel off-policy extension to the original PPO method, christened Transductive Off-policy PPO (ToPPO). Herein, we provide theoretical justification for incorporating off-policy data in PPO training and prudent guidelines for its safe application. Our contribution includes a novel formulation of the policy improvement lower bound for prospective policies derived from off-policy data, accompanied by a computationally efficient mechanism to optimize this bound, underpinned by assurances of monotonic improvement. Comprehensive experimental results across six representative tasks underscore ToPPO's promising performance.

cs.LG