cs.LGOct 24, 2025

Who Gets Watched? Allocating Scarce Escalation Resources on Pediatric Wards with Neural Index Policies

Authors: Himadri S. Pandey, Mark V. Mai, Naveen Muthu, Kai Wang, Gian-Gabriel P. Garcia

Organizations: Georgia Institute of Technology · University of Washington

Abstract

Problem definition: Hospitals use separate pathways to identify and respond to deteriorating ward patients. At Children's Healthcare of Atlanta (CHOA), these include Watcher surveillance, Critical Care Outreach Team assessment, and transfer to the intensive care unit. When several patients need attention simultaneously, however, no common process determines who should receive which response under limited staffing and capacity. We study how to coordinate these actions to support earlier escalation without unnecessary monitoring. Methodology/results: We model ward escalation decisions using a multi-action restless multi-armed bandit model and develop Multi-action Index Learning and Optimization Policy (MILOP) as a computational solution approach. MILOP trains a neural network to generate a high-quality index policy using a decision-focused learning approach. We train and evaluate MILOP using historical CHOA data and compare it with two practical baselines. MILOP recommends an escalation before 87.4% of critical or emergent intensive-care transfers, compared with 79.5% for the stronger baseline, while using 13.5% less monitoring resources. MILOP provides a median of 19.2 hours lead time before transfer, earlier than either baseline. Moreover, 99.3% of MILOP's proactive transfer recommendations are preceded by Watcher surveillance or outreach-team assessment, demonstrating a desirable escalation of care. Managerial implications: MILOP can help leaders focus scarce clinical attention, gain more time to respond before severe deterioration, and reduce monitoring burden compared to existing practices. Broadly, hospitals may improve escalation decisions by coordinating existing pathways rather than managing each separately or using risk scores as stand-alone decision rules.

Figures & tables

Explore similar work

Oct 15, 2026

Auditing Escalation Reliability in Healthcare LLM Agents: A Perturbation-Controlled Benchmark of Workflow-State Failures

Trustworthy biomedical AI requires reliable action selection when evidence is missing, stale, conflicting, or late, not only accurate answers on static inputs. We instantiate an episode-level evaluation protocol as 400 synthetic healthcare workflow episodes: 40 hand-authored semantic seeds across four task classes, two surface parameterizations, and five controlled variants, scored on ANSWER/ASK CLARIFICATION/ABSTAIN/ESCALATE under a pre-declared 5:1 missed-versus-unnecessary escalation cost. Reference actions are single-author study-policy labels, not clinician-adjudicated ground truth. Across five open-weight configurations (1.7B--9.7B), clean decision accuracy reaches 0.97, yet uncertainty-prompted models miss 32--97% of required escalations. The stronger 9.7B configuration narrows but does not remove the gap, falling from 0.97 clean accuracy to 0.78 under conflict. Verbalized confidence is inconsistent (ECE 0.10--0.54; failure AUROC 0.48--0.77), and a development-tuned confidence-only policy yields no utility gain. A transparent workflow-aware controller improves 5:1 utility for every model and reduces missed escalations to 0.12--0.24, at specificity 0.83--0.93. However, a 30-concept lexical stress test reduces each rule detector's recall from 1.00 on trigger phrases to 0.00 on unseen paraphrases, limiting the controller claim to this benchmark. Seed-clustered statistics, ablations, cross-task transfer, raw outputs, and manifests are packaged for audit. The results motivate explicit workflow-state evaluation while showing that apparently effective routing controls need their own generalization tests.
Aug 5, 2026

Differentiating Through Dual Prices: End-to-End Policy Learning Under Capacity Constraints

Many social services assign scarce resources, such as housing assistance or hospital interventions, to people who arrive one at a time. Each arrival must receive a decision immediately, and the long-run usage of every resource must stay within its capacity. We study how to learn such a policy from logged observational data. Recent work (Tang et al., 2024) proposes a decision-blind pipeline that fits one outcome model per treatment by regression, prices each capacitated resource from those models, and assigns each arrival the treatment with the largest predicted outcome minus price. We instead train the outcome models end-to-end, differentiating an off-policy estimate of the deployed policy's value through the dual prices themselves. We study two formulations: an exact nonconvex one, and a convex relaxation whose optimum always satisfies the capacity constraints in expectation and whose suboptimality can be explicitly bounded. Every method is evaluated in a queueing simulation to capture the online decision structure. Across six datasets, our two end-to-end variants lead the delay-adjusted policy value wherever capacity is scarce, once a waiting period carries even a small cost. In particular, decision-blind regression predicts ground truth more accurately, but when resource capacities are stringent these baselines frequently violate them and incur much longer queueing delays. Thus, end-to-end training is best suited to settings where resources are genuinely scarce and feasibility matters.
Aug 28, 2026

TACIT-Switch: Cost-Aware Model Escalation for LLM Agents from Censored Supervision

Agents with smaller language-model backbones are less expensive but can drift into persistent failure modes, whereas those with larger backbones are generally more reliable but more costly. This reliability-cost trade-off motivates routing methods that decide when to invoke an agent with a larger backbone: before execution, after a fixed trajectory prefix, or locally at individual steps. Our method, TACIT-SWITCH, learns permanent handoff policies from accumulated trajectory evidence and Teacher-Annotated Censored Intervention Times (TACIT). It represents each annotation as an interval-censored observation on a cumulative-risk scale. The resulting mixture-cure threshold model estimates the probability that the paired Strong rollout succeeds and, conditional on success, the handoff threshold; no teacher is required at deployment. In a mechanism-based multi-step simulation, TACIT-SWITCH improves success by 7.4-11.1 percentage points over task-level, step-level, and fixed-prefix routing baselines at comparable cost. Within that controlled simulation, ablations show that task features and cumulative trajectory risk provide complementary information. With operating points selected on development data, TACIT-SWITCH achieves the highest held-out success among learned policies on both ALFWorld (48.5% with 4B Cheap; 45.5% with 9B Cheap) and DABench (73.1%).