Pith. sign in

REVIEW 3 cited by

Human Expertise in Algorithmic Prediction

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.00793 v3 pith:NNXMHHUA submitted 2024-02-01 cs.LG cs.AIcs.HC

classification cs.LGcs.AIcs.HC
keywords algorithmichumanpredictionsalgorithmsapproachcollaborationexpertiseexperts
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

We introduce a novel framework for incorporating human expertise into algorithmic predictions. Our approach leverages human judgment to distinguish inputs which are algorithmically indistinguishable, or "look the same" to predictive algorithms. We argue that this framing clarifies the problem of human-AI collaboration in prediction tasks, as experts often form judgments by drawing on information which is not encoded in an algorithm's training data. Algorithmic indistinguishability yields a natural test for assessing whether experts incorporate this kind of "side information", and further provides a simple but principled method for selectively incorporating human feedback into algorithmic predictions. We show that this method provably improves the performance of any feasible algorithmic predictor and precisely quantify this improvement. We find empirically that although algorithms often outperform their human counterparts on average, human judgment can improve algorithmic predictions on specific instances (which can be identified ex-ante). In an X-ray classification task, we find that this subset constitutes nearly $30\%$ of the patient population. Our approach provides a natural way of uncovering this heterogeneity and thus enabling effective human-AI collaboration.

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. Tractable Agreement Protocols

    cs.LG 2024-11 conditional novelty 8.0 of 10

    Conversation-calibrated agents, efficiently constructible from any ML model, reach approximate agreement in few rounds while improving accuracy, generalizing Aumann-Aaronson theorems to d dimensions and action feedback.

  2. Understanding LoRA as Knowledge Memory: An Empirical Analysis

    cs.LG 2026-03 conditional novelty 7.0 of 10

    LoRA modules function as composable knowledge memories for LLMs with measurable storage capacity, internalization efficiency, and advantages in multi-module long-context reasoning.

  3. A No Free Lunch Theorem for Human-AI Collaboration

    cs.AI 2024-11 conditional novelty 7.0 of 10

    For calibrated binary predictors, any collaboration rule that is guaranteed to be at least as accurate as the worst agent must essentially always defer to a single agent.

Pith tools