- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper introduces SIMBA, an influence-maximization framework combining a two-layer GraphSAGE surrogate with seed-set search. The surrogate learns from the graph and pairs of initial seed sets and final diffusion outcomes. Seed sets are subsequently optimized through batched multi-swap simulated annealing. The authors report the highest influence spread in 62 of 72 settings. They also report lower combined training and search time than DeepIM and DeepSN, while maintaining comparable performance with fewer training observations.
Critical strengths
The reported results are strong against the main-table baselines.
The simple architecture provides useful empirical evidence that greater model complexity is not always necessary.
The paper includes ablations on the node anchoring strategy and extra experiments which are informative.
Critical weaknesses
The method is not tested on large scale data (such as Orkut, FB, YT or Weibo), which is the main test for influence maximiation methods.
The paper provides no theoretical findings, which is vital for this literature and for the level of ICLR.
The code is not provided for validation.
The novelty is not substantial, as similar methods based on learning node embeddings and optimizing the search have been published in the past.
To my understanding, there is no ablation on the GraphSAGE weights initialization, which is standard for NN-based techniques.
Questions for authors
Can the authors provide results on additional large real-world networks, particularly million-edge graphs, including runtime and memory requirements?
Can they derive any theoretical evidence for the correctness of the method?
Will the authors release SIMBA’s code together with results across independent training and search runs?
Can they add ablation studies on the initialization of the GraphSAGE?
2 comments
Answer to authors
Thank you for your answer.
- Comparing with datasets that agree only with learning-based methods does not suffice, as IM techniques are tested in larger networks (such as the ones I mention above).
- Theoretical findings would substantially improve the paper, as many IM algorithms are followed with theoretical guarantees.
- The code was not included in the original submission.
- A standard initialisation of GNN layers is random, hence an ablation only on these weights is needed.
For these reasons I will retain my score.
We would like to clarify the contributions and novelty of our work. The proposed framework demonstrates that a lightweight surrogate combined with direct discrete search can achieve stronger influence spread in benchmark settings while substantially reducing the combined training and search cost. This establishes that the additional architectural and optimization complexity of previous frameworks is not necessary for strong performance under the evaluated conditions. Our work provides a concrete alternative design and empirical evidence about the complexity of learning-based influence maximization. We respectfully ask the reviewer to reassess their recommendation.