Amortized Network Intervention to Steer the Excitatory Point Processes
Zitao Song, Wendi Ren, Shuang Li

TL;DR
This paper introduces an Amortized Network Intervention framework using neural ODEs and mean-field approximation to efficiently steer event flows in dynamic graphs, with applications in epidemic control and traffic management.
Contribution
It proposes a novel ANI framework that enables efficient policy transfer across diverse contexts for controlling excitatory point processes on dynamic graphs.
Findings
Enhances policy learning for unseen network dynamics.
Demonstrates effectiveness on synthetic and real COVID datasets.
Improves efficiency of online planning through analytical mean-field approximation.
Abstract
Excitatory point processes (i.e., event flows) occurring over dynamic graphs (i.e., evolving topologies) provide a fine-grained model to capture how discrete events may spread over time and space. How to effectively steer the event flows by modifying the dynamic graph structures presents an interesting problem, motivated by curbing the spread of infectious diseases through strategically locking down cities to mitigating traffic congestion via traffic light optimization. To address the intricacies of planning and overcome the high dimensionality inherent to such decision-making problems, we design an Amortized Network Interventions (ANI) framework, allowing for the pooling of optimal policies from history and other contexts while ensuring a permutation equivalent property. This property enables efficient knowledge transfer and sharing across diverse contexts. Each task is solved by an…
Peer Reviews
Decision·ICLR 2024 poster
The authors' contributions include: 1) Formulate the problem as a RL problem. 2) Propose to decompose the problem into subproblems of smaller scale and learn a policy that can generalize to the full-scale problem via ensuring permutation equivalence. 3) Test and compare the methods to previous methods on several settings of practical interest. Also, the authors show concrete evidence of the out-of-distribution generalization power of the proposed method.
In my point of view, the authors did not clarify their contributions. In terms of problem formulation, modeling the discrete events by counting the occurrences in a time window should not be counted as the novelty. In terms of model learning, the authors are basically using the MLE method, which is standard in model-based RL. Policy learning within the permutation equivalence class through learning embedding $p^t, m^t$ via contrastive method is an interesting idea. However, the authors do not
The paper is well written, the presentation is clear and the idea is sound.
More details are needed in some components of the proposed model, including the mean field approximation for the rewarding model and the construction of the amortized policy.
The paper is well-motivated and the proposed model is technically sound and can notably handle large-scale systems. The overall writing is easy to follow. The experiment section is comprehensive though missing some baselines.
In the experiment section, why baseline comparison is only limited on one synthetic dataset? Also, can the author explains why the NHPI baseline almost have a constant intensity cost in Figure 1?
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGene Regulatory Network Analysis · Mental Health Research Topics · Opinion Dynamics and Social Influence
