- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper proposes an action-conditioned network world model for LLM-based algorithm design on graph diffusion tasks. And a graph neural model is trained with a process-constrained head to predict subsequent dynamics. A coding agent then refines executable algorithms using rollout rewards, trajectory diagnostics, leave-one-out action credit, and counterfactual probes. The paper provides a conditional selection-regret bound and evaluates eight tasks and five diffusion processes. Independently scored algorithms match or exceed the strongest listed baseline in 118 of 121 settings.
Critical strengths
-
The application is meaningful: designing reusable algorithms for budgeted network interventions is more persistent than selecting an action sequence for one task instance.
-
The paper offers a coherent interface between explicit node/edge interventions, stochastic diffusion rollouts, and a coding agent. Applying immediate edits exactly while exposing intervention-specific trajectory and counterfactual feedback is a potentially valuable extension beyond fixed-seeding diffusion estimators. Its strongest contribution appears to be this integrated algorithm-design environment.
Critical weaknesses
-
The practical benefit of learning the world model. Section 3.2 motivates learning unobserved dynamics parameters, but Appendix I.1.1 keeps transmission weights visible, and Appendix E.1 already provides a vectorized exact Oracle. Figure 4 reports acceleration over NDlib without comparing this Oracle, while Appendix G changes the search loop and feedback alongside the evaluator. A controlled comparison keeping the search loop and feedback fixed, and replacing only the learned evaluator with the exact Oracle, would directly establish whether learning improves final algorithm quality or reduces total cost. This comparison should include data generation and training costs, accounting for reuse across searches.
-
The novelty discussion understates the closest precedents. MONSTOR already learns single-step graph diffusion and stacks it for multi-step evaluation inside IM algorithms, rather than merely predicting a final scalar. Memon et al., which is cited, already refine an LLM intervention policy using world-model rollout feedback. Schmidt et al. also model explicit intervention change points with a graph surrogate. The paper has meaningful distinctions, but should establish these narrower advances rather than implying the broader learned-simulator/feedback paradigm is missing from prior work.
Questions for authors
-
The title suggests broad applicability to complex systems, while the evaluation focuses on network diffusion and influence propagation. Could you justify the broader scope or narrow the title and claims accordingly?
-
Appendix B.2 describes a 50-word search memory and growing attempts/population tables. How are context limits, history truncation, and candidate retention or retrieval handled as the serial search grows beyond the reported 10 rounds?
-
What benefit does learning a world model provide over direct algorithm search with an exact simulator? Please compare the same search loop and feedback using the learned evaluator versus the vectorized exact Oracle (Appendix E.1), reporting final quality and total runtime, including data generation and training, under matched search budgets and hardware.
In all, I see some novelty in this work and would consider raising my score if my concerns are properly addressed.
5 comments
Response to Reviewer 1i1y [2/3]
W2: Positioning against the closest prior work
The novelty discussion understates the closest precedents: MONSTOR already learns single-step graph diffusion and stacks it for multi-step evaluation inside IM algorithms; Memon et al. already refine an LLM intervention policy using world-model rollout feedback; Schmidt et al. also model explicit intervention change points with a graph surrogate.
Our contributions: (1) An action-conditioned world model that applies interventions at any step (seeding, node and edge removal, blocking, weight changes) and rolls the dynamics forward, serving as a learned environment for algorithm design on complex networks. (2) A coding agent that writes and refines reusable, executable algorithms in this environment from step-level feedback, across eight tasks. Each prior work covers only part of this:
- MONSTOR (Ko et al., 2020) uses a GCN to estimate a seed set's influence under IC, replacing Monte Carlo inside greedy influence maximization. It is an estimator within a fixed algorithm.
- Memon et al. (2026) is a perspective on world models for epidemiology. Its case study fine-tunes a language model to forecast state-level hospitalization trends from policy vectors and refines an LLM policy with its rollouts. It has no network and no network interventions, and its output is a policy for one setting.
- Schmidt et al. (2024) build a GNN surrogate of a metapopulation epidemic model for forecasting. Its only intervention is a change in contacts at a fixed number of change points.
The related work section now states these distinctions (lines 112-119).
Q1: Scope of the work
The title suggests broad applicability to complex systems, while the evaluation focuses on network diffusion and influence propagation. Could you justify the broader scope or narrow the title and claims accordingly?
Here, "complex systems" means complex networks, the established framing for dynamical processes on networks (Newman, 2003; Boccaletti et al., 2006; Pastor-Satorras et al., 2015). These are systems whose state evolves through interactions along a network and changes under actions taken on it, as the introduction states. The introduction now states this scope more firmly (lines 71-74).
Our evaluation covers more than just influence propagation, with eight tasks spanning four problem families and five diffusion processes (IC, LT, CLT, SIR, SIS):
-
spreading: influence maximization, static and adaptive;
-
containment:
- critical node detection against an outbreak
- blocking a rumor with a competing cascade
- epidemic control with recovery and reinfection, where actions include vaccination, quarantine, and contact reduction
-
inverse problems: locating the sources of an outbreak, and reconstructing who infected whom from a partial observation
-
forecasting: predicting the growth of real logged cascades, with no simulator
-
The networks span several domains, from to more than nodes:
- social and communication: Digg, Email-EU, Brightkite, Deezer
- collaboration and citation: Network Science, NetHEPT, Cit-HepTh, APS
- human face-to-face contact: Infectious SocioPatterns
- infrastructure: the Power Grid, and the Oregon1 Internet topology
- peer-to-peer and trust: Gnutella, PGP
Response to Reviewer 1i1y [3/3]
Q2: Context limits and candidate retention
Appendix B.2 describes a 50-word search memory and growing attempts/population tables. How are context limits, history truncation, and candidate retention or retrieval handled as the serial search grows beyond the reported 10 rounds?
The context stays bounded: Each call to the coding agent sends the system turn (program contract and rules), the opening turn (task statement and network profile), and the 10 most recent exchanges.
- One exchange is a round's prompt (operator instruction, attempts and population tables, memory and feedback) plus the model's program.
- Once the program is scored, it is shrunk to a diff against its parent.
- Older exchanges are dropped. Past a 10-round search, the model only sees the final 10 rounds. In a 5-round or 10-round search, for example, search drops nothing.
The search memory is rewritten every round at 50 words. The attempts table keeps the first attempt and the most recent. Candidates are kept outside the conversation. The population table lists every scored candidate with its reward, paired strength and mechanism line, ranked by paired strength. It grows by one short line per candidate.
For retrieval:
- Every round's prompt includes the current best program in full as the parent, with its diagnostics, so the best candidate stays in context however many rounds pass.
- Other members are retrieved by paired strength: under refine, the two strongest are shown as alternatives, and under crossover, a partner is drawn by rank.
We have added a more detailed description of context limits with the coding agent algorithm design loop to Appendix B.2.
We thank the reviewer again for the detailed and constructive review, and we hope that the clarifications and additions address the reviewer's concerns. We are glad to answer any further questions.
Response to Reviewer 1i1y [1/3]
We thank the reviewer for the feedback and for recognizing the significance of the application and novelty of our work. We address each point below.
W1 & Q3: Network World Model compared to the exact oracle
Learned edge weights: The Network World Model does not receive the true edge transmission probabilities. Its input weight is wuv=1 on every edge, in both training and rollouts. The true probabilities are used only by the simulator that generates the training data and by the oracle that scores the final programs for a fair comparison. The model therefore observes only which nodes become infected, and learns the transmission probabilities from the network's structure and these observed infections.
Some confusion may have arisen from ambiguous symbols and wording, which we have rewritten at lines 167-169, 189-192, and 2225-2228 to clarify that the model learns the transmission probabilities, which are distinct from the true probabilities used by the oracle simulator. We thank the reviewer for bringing this up.
The oracle simulator is a reference: The oracle is a vectorized simulator of the diffusion process with its true parameters. It exists only when every parameter of the process is known, so it cannot be used in real deployments, where the dynamics may be unknown. In our benchmarks, it plays the role of the real world: the final algorithms of our method, every baseline, and every algorithm-discovery system are scored on it for a fair comparison. Because it knows the exact dynamics, search with the oracle is the best case and essentially bounds what learned dynamics can achieve.
The oracle cannot be used in settings where no exact model exists. For example, the dynamics may be available only as observed cascades, as in our experiments on APS, Taoke, and Digg, where the Network World Model is trained directly on these cascades. Or a simulator may exist, but its dynamics are not given as explicit edge-level transmission probabilities, as in agent-based epidemic simulators, where spread emerges from individual behavior. In that case, no exact vectorized implementation can be built, and a candidate can only be scored by repeated simulation, so Monte Carlo is the fair comparison. Against Monte Carlo, the Network World Model is 4.0× faster per rollout on Power Grid and 14.5× faster on Digg (Figure 4), and breaks even after about five searches.
When the full model of the diffusion process is known, the oracle is fastest, because it uses the true parameters directly. The oracle and the Network World Model are both faster than Monte Carlo simulation. In the same design loop, the Network World Model finds algorithms within 0.13 percentage points of those found with the oracle on both networks (table below), and within a median of 0.05% over all 25 paired cells of our simulated tasks (at most 1.6%).
Setup: IM on Network Science and CND on Power Grid, 10% budget, IC. Only the evaluator changes. All three evaluators get score-only feedback (each candidate's score and its comparison with the current best), because a Monte Carlo search with diagnostics, credit, and probes would take too long. This also motivates our faster Network World Model. Given more time, we will soon add the full-feedback comparison for all three evaluators. The reported training cost includes data generation and model training time.