跳到正文
← 返回论文列表与筛选
阅读说明

本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。

DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。

本页为预印本版本;arXiv 收录、作者填写的期刊信息以及作者既有发表经历,都不单独证明本篇已接收。作者发表记录按 OpenAlex 身份与完整姓名、本站覆盖期刊 ISSN 及正式卷期核对,只展示已核实例,档案仍可能误合并。

引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。

关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。

分类依据与纠错

AI 根据所提供的论文材料归类:摘要明确以结构计量模型、函数方程和内生性处理研究公平估计,题名另提工具变量,直接支持结构估计分类。

反馈分类问题

正在核对关联版本…

代码、数据与补充材料

正在核对对应版本的资源…

关注这篇论文的作者

结构计量中的公平性约束及其工具变量估计应用

研究问题
当训练样本包含不可观测选择和现状偏差时,如何在显式处理内生性的结构模型中定义公平性并权衡偏离现状的成本?
方法与思路
作者将公平性表示为线性算子,以其零空间界定严格公平指标,通过投影或约束求解获得公平解,并用惩罚实现近似公平。
材料陈述的贡献
摘要提出把公平性约束纳入由函数方程确定的结构指标,并提供严格公平与近似公平的处理路径,以表达公平和现状之间的权衡。
阅读关注点
应核对公平算子的具体定义、结构方程及内生性处理方式,以及投影解与约束求解的关系、惩罚参数和政策成本如何解释。
阅读边界
这是 arXiv 预印本,同行评审及期刊接收未核验。摘要未说明具体识别条件、工具变量要求或实证结果,公平定义也需核对。

原文摘要

A supervised machine learning algorithm determines a model from a learning sample that will be used to predict new observations. To this end, it aggregates individual characteristics of the observations of the learning sample. But this information aggregation does not consider any potential selection on unobservables and any status-quo biases which may be contained in the training sample. The latter bias has raised concerns around the so-called \textit{fairness} of machine learning algorithms, especially towards disadvantaged groups. In this chapter, we review the issue of fairness in machine learning through the lenses of structural econometrics models in which the unknown index is the solution of a functional equation and issues of endogeneity are explicitly accounted for. We model fairness as a linear operator whose null space contains the set of strictly {\it fair} indexes. A {\it fair} solution is obtained by projecting the unconstrained index into the null space of this operator or by directly finding the closest solution of the functional equation into this null space. We also acknowledge that policymakers may incur a cost when moving away from the status quo. Achieving \textit{approximate fairness} is obtained by introducing a fairness penalty in the learning procedure and balancing more or less heavily the influence between the status quo and a full fair solution.

笔记与分组