Adaptive Frontier Exploration on Graphs with Applications to Network-Based Disease Testing
Davin Choo, Yuqi Pan, Tonghan Wang, Milind Tambe, Alastair van Heerden, Cheryl Johnson

TL;DR
This paper introduces an adaptive frontier exploration method on graphs for maximizing rewards under practical constraints, with applications in network-based disease testing, demonstrating superior performance over baselines.
Contribution
It develops a Gittins index-based policy for frontier exploration on graphs, providing provable optimality for forests and efficient implementation for general graphs.
Findings
Outperforms baseline methods in synthetic and real-world experiments.
Achieves near-complete detection of positive cases in HIV testing simulations.
Efficiently balances exploration and exploitation under practical constraints.
Abstract
We study a sequential decision-making problem on a -node graph where each node has an unknown label from a finite set , drawn from a joint distribution that is Markov with respect to . At each step, selecting a node reveals its label and yields a label-dependent reward. The goal is to adaptively choose nodes to maximize expected accumulated discounted rewards. We impose a frontier exploration constraint, where actions are limited to neighbors of previously selected nodes, reflecting practical constraints in settings such as contact tracing and robotic exploration. We design a Gittins index-based policy that applies to general graphs and is provably optimal when is a forest. Our implementation runs in time while using oracle…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Complex Network Analysis Techniques · Graph Theory and Algorithms
MethodsSparse Evolutionary Training
