Graph World Models for Constrained Epidemic Policy Planning introduces EpiMind, a graph-factored recurrent state-space model that generates joint policy-conditioned rollouts from regional latent beliefs. The framework uses graph-temporal ADMM to optimize regional interventions, enforce shared-resource feasibility, and evaluate temporal specifications under the learned model. EpiMind achieves a 29% reduction in admission RMSE compared to graph-free dynamics, plans within 1–5% of the best feasible constant policy while guaranteeing shared-budget feasibility, and outperforms all deployable baselines across three resource budgets in real-context evaluation.
arXiv:2610.02744v1 Announce Type: new Abstract: Epidemic intervention policies are textual artefacts that human decision-makers interpret, justify, and revise through natural language, making large l...
arXiv:2608.29535v1 Announce Type: cross Abstract: Infectious disease transmission is shaped by patterns of human interaction, which adapt as epidemic conditions change. Capturing these context-depend...
arXiv:2606. 04562v1 Announce Type: new Abstract: Purpose The WHO's COVID-19 non-pharmaceutical interventions (e.
Purpose The WHO's COVID-19 non-pharmaceutical interventions (e. g.
The paper introduces an action‑conditioned Network World Model that learns how a network’s diffusion dynamics evolve under interventions over time. This model can quickly predict the outcomes of actions, enabling a coding agent to design and refine algorithms that select actions to maximize expected performance on complex network tasks. Experiments on eight network tasks and five diffusion models show that the resulting algorithms match or surpass the best existing baselines in 138 of 141 settings while achieving up to 14.5× faster rollouts than traditional Monte Carlo simulation.
arXiv:2606. 05692v1 Announce Type: new Abstract: Deep learning has enabled significant advances in time-series causal inference, yet progress remains constrained by the lack of realistic benchmarks with observable counterfactual outcomes.
Deep learning has enabled significant advances in time-series causal inference, yet progress remains constrained by the lack of realistic benchmarks with observable counterfactual outcomes. Existing datasets either rely on real-world observations without ground-truth counterfactuals or on simplified simulations that fail to capture complex causal dynamics.
arXiv:2606. 05413v1 Announce Type: new Abstract: As urban environments continue to evolve rapidly, accurately modeling the dynamic behaviour of Points of Interest is essential for supporting data-driven urban planning and commercial decision-making.
arXiv:2511. 13103v2 Announce Type: replace Abstract: Multi-agent reinforcement learning (MARL) has shown promise for large-scale network control, yet existing methods face two major limitations.
arXiv:2603. 07108v2 Announce Type: replace-cross Abstract: Accurate and reliable forecasting of epidemic incidences is critical for public health preparedness, yet it remains a challenging task due to complex nonlinear temporal dependencies and heterogeneous spatial interactions.
arXiv:2605. 26704v2 Announce Type: replace-cross Abstract: Epidemic forecasting faces a fundamental challenge: human behavior dynamically responds to disease spread, creating feedback loops that induce distribution shifts at policy intervention points.
The paper introduces the Graph Dynamics Model (GDM), a world model that learns stochastic latent dynamics over evolving graph topologies. GDM employs a sparse recurrent adjacency matrix for topology updates and a recurrent state‑space architecture for stochastic transitions, enabling it to handle partially observable, stochastic environments. The authors also propose the Graph Distribution Distance (GDD) metric, using maximum mean discrepancy with a graph kernel, to compare predicted and true joint graph state distributions, and demonstrate GDM’s superior performance and zero‑shot generalisation on large graphs.