all AI news
Minimax AUC Fairness: Efficient Algorithm with Provable Convergence. (arXiv:2208.10451v1 [cs.LG])
Aug. 23, 2022, 1:13 a.m. | Zhenhuan Yang, Yan Lok Ko, Kush R. Varshney, Yiming Ying
stat.ML updates on arXiv.org arxiv.org
The use of machine learning models in consequential decision making often
exacerbates societal inequity, in particular yielding disparate impact on
members of marginalized groups defined by race and gender. The area under the
ROC curve (AUC) is widely used to evaluate the performance of a scoring
function in machine learning, but is studied in algorithmic fairness less than
other performance metrics. Due to the pairwise nature of the AUC, defining an
AUC-based group fairness metric is pairwise-dependent and may involve …
More from arxiv.org / stat.ML updates on arXiv.org
Mixture of partially linear experts
11 hours ago |
arxiv.org
Adaptive deep learning for nonlinear time series models
1 day, 11 hours ago |
arxiv.org
A Full Adagrad algorithm with O(Nd) operations
1 day, 11 hours ago |
arxiv.org
Minimax Regret Learning for Data with Heterogeneous Subgroups
1 day, 11 hours ago |
arxiv.org
Jobs in AI, ML, Big Data
Founding AI Engineer, Agents
@ Occam AI | New York
AI Engineer Intern, Agents
@ Occam AI | US
AI Research Scientist
@ Vara | Berlin, Germany and Remote
Data Architect
@ University of Texas at Austin | Austin, TX
Data ETL Engineer
@ University of Texas at Austin | Austin, TX
Lead Data Engineer
@ WorkMoney | New York City, United States - Remote