Human decision-makers often receive assistance from data-driven algorithmic systems that provide a score for evaluating objects, including individuals. The scores are generated by a function (mechanism) that takes a set of features as input and generates a score.The scoring functions are either machine-learned or human-designed and can be used for different decision purposes such as ranking or classification.
Given the potential impact of these scoring mechanisms on individuals' lives and on society, it is important to make sure these scores are computed responsibly. Hence we need tools for responsible scoring mechanism design. In this paper, focusing on linear scoring functions, we highlight the importance of unbiased function sampling and perturbation in the function space for devising such tools. We provide unbiased samplers for the entire function space, as well as a $θ$-vicinity around a given function.
We then illustrate the value of these samplers for designing effective algorithms in three diverse problem scenarios in the context of ranking. Finally, as a fundamental method for designing responsible scoring mechanisms, we propose a novel approach for approximating the construction of the arrangement of hyperplanes. Despite the exponential complexity of an arrangement in the number of dimensions, using function sampling, our algorithm is linear in the number of samples and hyperplanes, and independent of the number of dimensions.
Estimating the Margin of Victory of an Election using Sampling
Indian Institute of Science(印度科学学院)
选举的胜率是衡量选举结果是否稳健的有用指标。它也起着至关重要的作用,在选举后的审计,投票等各种算法的样本量确定在这项工作中,我们提出了有效的抽样为基础的算法,估计选举的胜利幅度。更正式地说,我们引入了\textsc{$(c, ε, δ)$--Margin of Victory}问题,其中给定$\mathcal{E}$对$n$选民的选举,目标是在$c MoV(\mathcal{E})+εn$的附加因子内估计$\mathcal{E}$的胜利$M(\mathcal{E})$的差距。我们研究了\textsc{$(c, ε, δ)$--Margin of Victory}问题,许多常用的投票规则,包括评分规则,批准,Bucklin,最大,和科普兰$^α.$我们观察到,即使是计算胜利的保证金的投票规则是NP-硬,可能存在有效的抽样为基础的算法,观察到的情况下,最大和科普兰$^α$投票规则。
Fighting Sampling Bias: A Framework for Training and Evaluating Credit Scoring Models
Amazon Web Services(亚马逊网络服务);Humboldt University of Berlin(柏林洪堡大学);Bucharest University of Economic Studies(布加勒斯特经济研究大学);Wolt Enterprises Deutschland GmbH(沃尔特德国企业有限公司);Kaizen Gaming(凯森游戏公司)
Exploring Multiple High-Scoring Subspaces in Generative Flow Networks
University of Science and Technology of China (USTC)(中国科学技术大学);Suzhou Institute for Advanced Research, USTC(先进研究苏州市机构);State Key Laboratory of Precision and Intelligent Chemistry, USTC(精密与智能化学国家重点实验室)
Automated HER2 Scoring in Breast Cancer Images Using Deep Learning and Pyramid Sampling
University of California, Los Angeles(加州大学洛杉矶分校);California NanoSystems Institute(加州纳米系统研究所);University of California at Davis(加州大学戴维斯分校);Bnai-Zion Medical Center(贝内锡安医疗中心);Hadassah Hebrew University Medical Center(哈达萨希伯来大学医疗中心);David Geffen School of Medicine, University of California, Los Angeles(加州大学洛杉矶分校大卫·格芬医学院)
Does the Definition of Difficulty Matter? Scoring Functions and their Role for Curriculum Learning
Technical University of Munich(慕尼黑工业大学);MCML – Munich Center for Machine Learning(慕尼黑机器学习中心);Imperial College(帝国理工学院);MDSI – Munich Data Science Institute(慕尼黑数据科学研究所)