Pith. sign in

REVIEW 3 cited by

Learning to Defer in Congested Systems: The AI-Human Interplay

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2402.12237 v4 pith:P2TFLI7F submitted 2024-02-19 cs.LG cs.AIcs.GTcs.HCcs.PF

classification cs.LGcs.AIcs.GTcs.HCcs.PF
keywords contentreviewhumanclassificationjobsai-humanhumanslearning
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

High-stakes applications rely on combining Artificial Intelligence (AI) and humans for responsive and reliable decision making. For example, content moderation in social media platforms often employs an AI-human pipeline to promptly remove policy violations without jeopardizing legitimate content. A typical heuristic estimates the risk of incoming content and uses fixed thresholds to decide whether to auto-delete the content (classification) and whether to send it for human review (admission). This approach can be inefficient as it disregards the uncertainty in AI's estimation, the time-varying element of content arrivals and human review capacity, and the selective sampling in the online dataset (humans only review content filtered by the AI). In this paper, we introduce a model to capture such an AI-human interplay. In this model, the AI observes contextual information for incoming jobs, makes classification and admission decisions, and schedules admitted jobs for human review. During these reviews, humans observe a job's true cost and may overturn an erroneous AI classification decision. These reviews also serve as new data to train the AI but are delayed due to congestion in the human review system. The objective is to minimize the costs of eventually misclassified jobs. We propose a near-optimal learning algorithm that carefully balances the classification loss from a selectively sampled dataset, the idiosyncratic loss of non-reviewed jobs, and the delay loss of having congestion in the human review system. To the best of our knowledge, this is the first result for online learning in contextual queueing systems. Moreover, numerical experiments based on online comment datasets show that our algorithm can substantially reduce the number of misclassifications compared to existing content moderation practice.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Designing Algorithmic Delegates: The Role of Indistinguishability in Human-AI Handoff

    cs.GT 2025-06 conditional novelty 7.0 of 10

    Optimal AI delegation reduces to choosing which human categories the machine should retain, and this subset-selection problem is NP-hard in general yet polynomial in separable settings.

  2. Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs

    cs.DS 2025-05 conditional novelty 7.0 of 10

    A new index policy, OaRC, for scheduling jobs with Markovian uncertain holding costs achieves asymptotically optimal regret that is independent of the state-space size.

  3. On the Limits of Selective AI Prediction: A Case Study in Clinical Decision Making

    cs.HC 2025-08 conditional novelty 6.0 of 10

    Selective prediction keeps clinicians' overall accuracy roughly intact but shifts errors toward underdiagnosis (18% more missed) and undertreatment (35% more missed) when the AI abstains.

Pith tools