3.8 Proceedings Paper

The Selective Labels Problem: Evaluating Algorithmic Predictions in the Presence of Unobservables

出版社

ASSOC COMPUTING MACHINERY
DOI: 10.1145/3097983.3098066

关键词

-

资金

  1. NSF [IIS-1149837]
  2. SAP
  3. Lightspeed
  4. Stanford Data Science Initiative
  5. Chan Zuckerberg Biohub
  6. Robert Bosch Stanford Graduate Fellowship
  7. Google Anitaborg Scholarship

向作者/读者索取更多资源

Evaluating whether machines improve on human performance is one of the central questions of machine learning. However, there are many domains where the data is selectively labeled in the sense that the observed outcomes are themselves a consequence of the existing choices of the human decision-makers. For instance, in the context of judicial bail decisions, we observe the outcome of whether a defendant fails to return for their court appearance only if the human judge decides to release the defendant on bail. This selective labeling makes it harder to evaluate predictive models as the instances for which outcomes are observed do not represent a random sample of the population. Here we propose a novel framework for evaluating the performance of predictive models on selectively labeled data. We develop an approach called contraction which allows us to compare the performance of predictive models and human decision-makers without resorting to counterfactual inference. Our methodology harnesses the heterogeneity of human decision-makers and facilitates effective evaluation of predictive models even in the presence of unmeasured confounders (unobservables) which influence both human decisions and the resulting outcomes. Experimental results on real world datasets spanning diverse domains such as health care, insurance, and criminal justice demonstrate the utility of our evaluation metric in comparing human decisions and machine predictions.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

3.8
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据