Binary choice under asymmetric loss in a data‐rich environment: Theory and an application to algorithmic fairness
数据丰富环境中非对称损失下的二元选择:理论与算法公平性应用AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要直接研究一般非对称损失函数下的二元选择与决策规则。
数据丰富环境中非对称损失下的二元选择:理论与算法公平性应用AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
We study the binary choice problem in a data‐rich environment with asymmetric loss functions. The econometrics literature covers nonparametric binary choice problems but does not offer computationally attractive solutions in data‐rich environments. The machine learning literature has many algorithms but is focused mostly on loss functions that are independent of covariates. We show that theoretically valid decisions on binary outcomes with general loss functions can be achieved via a very simple loss‐based reweighting of logistic regression or state‐of‐the‐art machine learning techniques. We apply our analysis to algorithmic fairness in pretrial detentions.