Human Immunodeficiency Virus (HIV) remains a pressing public health challenge worldwide. Targeting limited HIV prevention and treatment resources effectively with network-based algorithms is a long-standing problem with a rich history at AAMAS and other computational venues. However, optimizing targeted biomedical interventions for minimizing spread of HIV often requires observability of the contact network of HIV transmission risk behavior among individuals, which is prohibitively expensive to collect at scale. Peer referral networks, i.e., networks collected through a recursive peer referral process, are an alternative network class often used to study HIV in hidden populations that can be collected digitally at scale, but they deviate from the underlying contact network: referrals can follow non-risk social ties and participants accept only one referral, hiding contacts among already-recruited individuals. In this work, we first formalize the novel problem of planning network-based interventions to minimize HIV spread in the hidden contact network while observing only the peer referral network. Second, we implement R2C-Agent, a decision making agent for interventions that is designed around our new conditional graph diffusion model called Referral-to-Contact Diffusion (R2C-Diff). R2C-Diff positions the peer referral process as incremental corruption of the underlying contact network and learns to reverse it. R2C-Agent plans its interventions over contact networks sampled from R2C-Diff, so its decisions account for uncertainty about the hidden contact network. Finally, we conduct simulated experiments using real-world HIV network data that demonstrate that R2C-Agent empirically plans more effective interventions than baselines from interdisciplinary literature and highlight key tradeoffs and assumptions driving performance.
Figures & tables
Figure 1: Our collaborators’ HIV fieldwork in South Africa.
Figure 2: Examples of deviation between the hidden contact network Gc and the observable peer referral network Gr . Gc is a subgraph of the hidden joint contact and social network G through which peer referrals are conducted. In Case 1, a social edge from Es appears in Gr but not in Gc . In Case 2, the contact edge between the two recruits of the seed node S is never recorded in Gr because recruits can only accept one referral to join Gr .
Figure 3: R2C-Agent overview. R2C-Agent uses R2C-Diff to sample possible contact networks conditioned on the observations, then plugs them into an intervention algorithm (e.g., CAST [ 19 ] or SandIMIN [ 39 ] ) represented abstractly as ALG. R2C-Agent then outputs ALG’s aggregated decision S⊆Velig , which respects uncertainty in the hidden contact network.
Figure 4: Overview of R2C-Diff. In the forward process, R2C-Diff starts with the true contact network with adjacency matrix M(0)=Mc , then incrementally plays out the recorded peer referral process until it reaches the observed peer referral network with adjacency matrix M(T)=Mr . The denoiser learns to reverse this process, step by step.
Approach
Intensive Treatment
Targeted PrEP
No Intervention
373.0
405.7
Random
269.1
130.8
Highest Degree
119.2
65.3
PRC
264.8
76.5
Identity
121.8
50.3
R2C-Agent (Ours)
53.8
35.8
Table 1: Total Regret for each approach on the two intervention problems. In each column, the best is bolded and Omniscient is italicized. PRC is Pairwise Risk Classification.
Figure 5: Average new infections ± stratified standard error (SE) across pooled results on both folds for different intervention budgets (as a fraction of ∣Velig∣ ) using different decision making strategies. We evaluate on the Intensive Treatment (top) and Targeted PrEP (bottom) problems. Stratified SE is very small compared to the plotted range.
Figure 6: Performance ( ± stratified SE) of R2C-Agent (left) and the Omniscient baseline (right) on the Targeted PrEP problem across different values of α .
Figure 7: Performance ( ± stratified SE) of R2C-Agent on the Intensive Treatment problem across different values of k .
Appendix figures & tables1 asset
Supplementary material from the paper’s appendix.
Appendix
Budget
Intensive Treatment
Targeted PrEP
0.0
442.8 ± 0.0
442.8 ± 0.0
0.1
418.5 ± 0.7
256.4 ± 3.6
0.2
347.7 ± 3.7
134.1 ± 2.7
0.3
94.7 ± 1.6
63.4 ± 2.4
0.4
59.9 ± 1.8
33.5 ± 1.7
0.5
43.2 ± 1.1
15.1 ± 1.4
Appendix
Table 2: Exact means ± stratified SE for average new infections across all budget points for R2C-Agent.
Treating and preventing Human Immunodeficiency Virus (HIV) remains a critical global health challenge. While antiretroviral therapy provides a path toward viral suppression -- effectively eliminating an individual's transmission risk -- systemic resource constraints limit the reach of intervention efforts. This work addresses the strategic distribution of intensive resources among virally unsuppressed individuals to minimize the expected cascade of new infections within a transmission network. We formalize this challenge as a novel constrained optimization problem where we have resources to "treat" k out of a set P of virally unsuppressed individuals, and establish its theoretical connections to existing computational literature. We then propose Cascade-Aware Suppression of Transmission (CAST), a polynomial-time (δ,ε)-approximation algorithm that achieves a 2∣P∣ approximation ratio by leveraging connections to the Minimum-k-Union (MkU) problem and Hoeffding-style concentration bounds. Extensive evaluations on real-world HIV networks demonstrate that CAST outperforms standard public health and computer science baselines. Furthermore, we show that CAST is empirically robust across diverse infectious disease networks, varied edge probability initializations, and settings involving imperfect network data.
Akseli Kangaslahti, Davin Choo, Milind Tambe +2
Harvard University · University of Witwatersrand · Wits Health Consortium +1
Peer-referral programs help connect populations at high risk for HIV and other infectious diseases with testing and prevention services when conventional outreach is ineffective. However, referral vouchers and incentives are limited, and standard operational guidelines give each participant the same fixed number of vouchers, ignoring differences in referral capacity. Motivated by our collaboration with public health practitioners, we study how to allocate a fixed voucher budget adaptively across participants and rounds to maximize total recruitment. Prior work assumes future recruits are i.i.d. from a population-level distribution and summarizes the recruitment frontier only by its size, ignoring covariate-dependent recruitment potential. We propose Generative Frontier Planning (GFP), which learns referral capacity with a censored count model and referrer-conditioned recruit covariates with a conditional diffusion model. Its structured value function yields a deterministic Bellman backup shared by fitted value iteration and planning, while inducing diminishing returns that give intra-round greedy allocation a (1-1/e)-approximation guarantee for each fixed round budget. Cross-round selection then determines how much budget to spend. We evaluate GFP on two data-calibrated recruitment environments constructed from de-identified recruiter-recruit records: a public ICPSR respondent-driven sampling dataset and a dataset provided by FHI 360, an international global health nonprofit. GFP recruits up to 21.5% more individuals than the strongest baseline under the same budget, showing its potential for resource-limited peer-referral programs.
Information and infectious diseases spread through social networks, but the spreading probabilities driving them are hard to estimate without per-node activation times. Applications seldom supply these, and inference must instead proceed through indirect and noisy proxies for the terminal infection states. We study this inverse problem on a fixed, known graph under the Hidden Independent Cascade (HIC) model, with one spreading probability per node rather than a single global rate, so the number of unknowns scales with the number of nodes. Seed sets and observation parameters are known, while activation times and terminal infection states are latent, and the observed-data likelihood requires marginalizing over every spreading outcome. We propose a simulation-based amortized estimator that recovers the full node-level parameter vector without reconstructing individual latent cascades. Repeated seed-conditioned symptom observations are summarized as Symptom-Aware Cascade Features (SACF), which combine empirical symptom statistics with neighborhood and structural information. SACF are mapped to parameters by SAGE-HC, a permutation-equivariant gated graph neural network whose learned gates attenuate neighborhood messages corrupted by false positives and false negatives, and training on simulated HIC realizations yields a reusable inverse map. As a benchmark under the same hidden observations, we extend the Dynamic Message Passing learning framework to the HIC emission model. On synthetic and empirical graphs the two methods separate by topology. DMP is highly accurate on trees, whereas SAGE-HC is substantially better on heterogeneous, loopy graphs under noisy terminal symptoms.