Generative Frontier Planning for Adaptive Peer-Referral Recruitment under Covariate-Dependent Arrivals
- URL: http://arxiv.org/abs/2606.08360v1
- Date: Sat, 06 Jun 2026 22:31:07 GMT
- Title: Generative Frontier Planning for Adaptive Peer-Referral Recruitment under Covariate-Dependent Arrivals
- Abstract summary: Peer-referral recruitment systems are critical for studying and intervening on hidden populations affected by infectious diseases.<n>We propose emphGenerative Frontier Planning (GFP), a model-based planner that replaces per-step Monte-Carlo sampling with a deterministic backup.<n>GFP outperforms random, reinforcement-learning, and i.i.d. dynamic-programming baselines across four discount factors.
- Score: 28.082278231005997
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Peer-referral recruitment systems such as respondent-driven sampling are critical for studying and intervening on hidden populations affected by infectious diseases. To accelerate recruitment, public health agencies must adaptively allocate limited referral resources across multiple rounds, where current decisions shape both the number and the covariates of future recruits. Prior work makes this problem tractable by assuming that referrals are drawn i.i.d.\ from a homogeneous population, an assumption that ignores the homophily and shared context that drive real peer recruitment. We instead consider a more realistic model in which both referral capacity and the covariates of newly referred individuals are conditioned on the referrer, learned from data with a censored count model and a conditional generative model. The resulting planning problem is challenging because each candidate allocation induces a different distribution over future recruits. We propose \emph{Generative Frontier Planning} (GFP), a model-based planner that replaces per-step Monte-Carlo sampling with a deterministic backup over a latent covariate-coverage value surrogate. The surrogate is designed so that the expected value of the next frontier depends on the offspring generative model only through finite-dimensional summaries that are amortized offline, and so that the resulting per-round objective is monotone with diminishing returns. Together, these two properties make planning tractable: the deterministic backup eliminates Monte-Carlo sampling, and the diminishing-returns structure lets a marginal greedy allocation achieve a \((1-1/e)\)-approximation for the per-round problem. On a simulation environment calibrated to a real respondent-driven sampling dataset, GFP outperforms random, reinforcement-learning, and i.i.d.\ dynamic-programming baselines across four discount factors.
Related papers
- Tabular Foundation Models for Discrete Choice Estimation [8.167439804974467]
Tabular foundation models (TFMs) generate predictions on structured data via in-context learning, without task-specific estimation.<n>We ask whether TFMs can be effectively applied to discrete choice, a central demand estimation framework in marketing and operations.<n>We propose a reformulation that encodes both choice-set dependence and individual heterogeneity within a row-based learning framework.
arXiv Detail & Related papers (2026-07-14T22:34:00Z) - Adaptive Multi-Round Allocation with Stochastic Arrivals [26.102812388131813]
We study a sequential resource allocation problem motivated by adaptive network recruitment.<n>We first show that the single-round allocation problem admits an exact greedy solution based on marginal survival probabilities.<n>In the multi-round setting, the resulting Bellman recursion is intractable due to the high-dimensional evolution of the frontier.
arXiv Detail & Related papers (2026-05-12T13:29:06Z) - Who Trains Matters: Federated Learning under Enrollment and Participation Selection Biases [0.16921396880325776]
Federated learning trains a shared model from updates contributed by distributed clients.<n>In practice, this representativeness assumption can fail at two distinct stages, inducing selection bias.<n>We formalize FL under a two-stage selection model and derive textscFedIPW, an inverse-probability-weighted aggregation scheme.
arXiv Detail & Related papers (2026-04-29T12:33:08Z) - Fair regression under localized demographic parity constraints [9.082079838093371]
We introduce a novel ($ell$, Z)-fair predictor, which imposes groupwise CDF constraints of the form F f |S=s (z m ) = $ell$ m for prescribed pairs.<n> Experiments on synthetic and real datasets illustrate an interpretable fairness-accuracy trade-off, enabling targeted corrections at decision-relevant quantiles or thresholds.
arXiv Detail & Related papers (2026-03-26T09:21:05Z) - Stochastic Linear Bandits with Latent Heterogeneity [8.981251210938787]
We propose a novel latent heterogeneous bandit framework that explicitly models this unobserved heterogeneity in customer responses.<n>Our methodology introduces an innovative algorithm that simultaneously learns latent group memberships and group-specific reward functions.
arXiv Detail & Related papers (2025-02-01T13:02:21Z) - Rejection via Learning Density Ratios [50.91522897152437]
Classification with rejection emerges as a learning paradigm which allows models to abstain from making predictions.<n>We propose a different distributional perspective, where we seek to find an idealized data distribution which maximizes a pretrained model's performance.<n>Our framework is tested empirically over clean and noisy datasets.
arXiv Detail & Related papers (2024-05-29T01:32:17Z) - Time-series Generation by Contrastive Imitation [87.51882102248395]
We study a generative framework that seeks to combine the strengths of both: Motivated by a moment-matching objective to mitigate compounding error, we optimize a local (but forward-looking) transition policy.
At inference, the learned policy serves as the generator for iterative sampling, and the learned energy serves as a trajectory-level measure for evaluating sample quality.
arXiv Detail & Related papers (2023-11-02T16:45:25Z) - Delta-AI: Local objectives for amortized inference in sparse graphical models [64.5938437823851]
We present a new algorithm for amortized inference in sparse probabilistic graphical models (PGMs)
Our approach is based on the observation that when the sampling of variables in a PGM is seen as a sequence of actions taken by an agent, sparsity of the PGM enables local credit assignment in the agent's policy learning objective.
We illustrate $Delta$-AI's effectiveness for sampling from synthetic PGMs and training latent variable models with sparse factor structure.
arXiv Detail & Related papers (2023-10-03T20:37:03Z) - Modeling the Q-Diversity in a Min-max Play Game for Robust Optimization [61.39201891894024]
Group distributionally robust optimization (group DRO) can minimize the worst-case loss over pre-defined groups.
We reformulate the group DRO framework by proposing Q-Diversity.
Characterized by an interactive training mode, Q-Diversity relaxes the group identification from annotation into direct parameterization.
arXiv Detail & Related papers (2023-05-20T07:02:27Z) - BRIO: Bringing Order to Abstractive Summarization [107.97378285293507]
We propose a novel training paradigm which assumes a non-deterministic distribution.
Our method achieves a new state-of-the-art result on the CNN/DailyMail (47.78 ROUGE-1) and XSum (49.07 ROUGE-1) datasets.
arXiv Detail & Related papers (2022-03-31T05:19:38Z) - A Twin Neural Model for Uplift [59.38563723706796]
Uplift is a particular case of conditional treatment effect modeling.
We propose a new loss function defined by leveraging a connection with the Bayesian interpretation of the relative risk.
We show our proposed method is competitive with the state-of-the-art in simulation setting and on real data from large scale randomized experiments.
arXiv Detail & Related papers (2021-05-11T16:02:39Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.