analiza aiqbench
This paper introduces EpiMind, a graph world model framework designed to optimize epidemic policy planning across interconnected regions while strictly adhering to resource constraints. By combining graph-factored recurrent state-space models with graph-temporal ADMM, the system achieves significant improvements in prediction accuracy and feasibility compared to existing baselines. The work demonstrates that structured policy imagination can effectively coordinate interventions under limited budgets, offering a robust approach for managing mobility-driven spillovers.
Graph World Models for Constrained Epidemic Policy Planning
arXiv:2609.35545v1 Announce Type: new Abstract: Epidemic policy planning often requires coordination between geographical regions, taking into account mobility-driven spillovers and how to make use of limited resources. Existing methods either lack action-conditioned models of coupled dynamics or cannot guarantee per-period feasibility. We present EpiMind, a graph world model framework for constrained epidemic policy planning across regions. A graph-factored recurrent state-space model generates joint policy-conditioned rollouts from regional latent beliefs, while graph-temporal ADMM optimizes regional interventions, enforces shared-resource feasibility through projection, and evaluates temporal specifications under the learned model. EpiMind reduces admission RMSE by 29% relative to graph-free dynamics modeling, plans within 1-5% of the best feasible constant policy with guaranteed shared-budget feasibility, and outperforms all deployable baselines across three resource budgets in real-context evaluation. These results demonstrate that graph-structured policy imagination with explicit constrained coordination supports effective epidemic interventions from learned dynamics.
Abstract:Epidemic policy planning often requires coordination between geographical regions, taking into account mobility-driven spillovers and how to make use of limited resources. Existing methods either lack action-conditioned models of coupled dynamics or cannot guarantee per-period feasibility. We present EpiMind, a graph world model framework for constrained epidemic policy planning across regions. A graph-factored recurrent state-space model generates joint policy-conditioned rollouts from regional latent beliefs, while graph-temporal ADMM optimizes regional interventions, enforces shared-resource feasibility through projection, and evaluates temporal specifications under the learned model. EpiMind reduces admission RMSE by 29% relative to graph-free dynamics modeling, plans within 1-5% of the best feasible constant policy with guaranteed shared-budget feasibility, and outperforms all deployable baselines across three resource budgets in real-context evaluation. These results demonstrate that graph-structured policy imagination with explicit constrained coordination supports effective epidemic interventions from learned dynamics.
Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
arXiv:2609.35545 [cs.LG]
(or arXiv:2609.35545v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2609.35545 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 234 cuvinte
Subiecte conexe

Beyond LLMs: Why Scalable Enterprise AI Adoption Depends on Agent Logic
Hugging Face · 1 iun. 2026

Presentation: From Copy-Paste to Composition: Building Agents Like Real Software
InfoQ · 22 iul. 2026
The J-Space Debate, Agent Swarms, and Pacing Frontier AI - Digital Minds Newsletter #4
LessWrong · 18 sept. 2026

Three perspectives on corrigibility - shards, simulators, singular learning
LessWrong · 16 oct. 2026