Multiaccuracy: Black-Box Post-Processing for Fairness in Classification
暂无分享,去创建一个
[1] Yoav Freund,et al. A decision-theoretic generalization of on-line learning and an application to boosting , 1997, EuroCOLT.
[2] Jon M. Kleinberg,et al. On Fairness and Calibration , 2017, NIPS.
[3] Avi Feller,et al. Algorithmic Decision Making and the Cost of Fairness , 2017, KDD.
[4] Jon M. Kleinberg,et al. Inherent Trade-Offs in the Fair Determination of Risk Scores , 2016, ITCS.
[5] Toniann Pitassi,et al. Fairness through awareness , 2011, ITCS '12.
[6] Peter L. Bartlett,et al. Boosting Algorithms as Gradient Descent , 1999, NIPS.
[7] Guy N. Rothblum,et al. Fairness Through Computationally-Bounded Awareness , 2018, NeurIPS.
[8] Xiaogang Wang,et al. Deep Learning Face Attributes in the Wild , 2014, 2015 IEEE International Conference on Computer Vision (ICCV).
[9] Alexander J. Smola,et al. Detecting and Correcting for Label Shift with Black Box Predictors , 2018, ICML.
[10] Shai Shalev-Shwartz,et al. Online Learning and Online Convex Optimization , 2012, Found. Trends Mach. Learn..
[11] Adam Tauman Kalai,et al. Decoupled classifiers for fair and efficient machine learning , 2017, ArXiv.
[12] Marwan Mattar,et al. Labeled Faces in the Wild: A Database forStudying Face Recognition in Unconstrained Environments , 2008 .
[13] Toniann Pitassi,et al. The reusable holdout: Preserving validity in adaptive data analysis , 2015, Science.
[14] Toniann Pitassi,et al. Learning Fair Representations , 2013, ICML.
[15] Ron Kohavi,et al. Scaling Up the Accuracy of Naive-Bayes Classifiers: A Decision-Tree Hybrid , 1996, KDD.
[16] James Philbin,et al. FaceNet: A unified embedding for face recognition and clustering , 2015, 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR).
[17] Gábor Lugosi,et al. Concentration Inequalities - A Nonasymptotic Theory of Independence , 2013, Concentration Inequalities.
[18] Michael Kearns,et al. Efficient noise-tolerant learning from statistical queries , 1993, STOC.
[19] Sergey Ioffe,et al. Inception-v4, Inception-ResNet and the Impact of Residual Connections on Learning , 2016, AAAI.
[20] Christopher T. Lowenkamp,et al. False Positives, False Negatives, and False Analyses: A Rejoinder to "Machine Bias: There's Software Used across the Country to Predict Future Criminals. and It's Biased against Blacks" , 2016 .
[21] Alexandra Chouldechova,et al. Fair prediction with disparate impact: A study of bias in recidivism prediction instruments , 2016, Big Data.
[22] Alex M. Andrew,et al. Boosting: Foundations and Algorithms , 2012 .
[23] Tal Hassner,et al. Effective Unconstrained Face Recognition by Combining Multiple Descriptors and Learned Background Statistics , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[24] P. Elliott,et al. UK Biobank: An Open Access Resource for Identifying the Causes of a Wide Range of Complex Diseases of Middle and Old Age , 2015, PLoS medicine.
[25] Madhur Tulsiani,et al. Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution , 2009, 2009 24th Annual IEEE Conference on Computational Complexity.
[26] R. Schapire,et al. Toward efficient agnostic learning , 1992, COLT '92.
[27] J. Friedman. Greedy function approximation: A gradient boosting machine. , 2001 .
[28] Guy N. Rothblum,et al. Probably Approximately Metric-Fair Learning , 2018, ICML.
[29] Sébastien Bubeck,et al. Convex Optimization: Algorithms and Complexity , 2014, Found. Trends Mach. Learn..
[30] Guy N. Rothblum,et al. Calibration for the (Computationally-Identifiable) Masses , 2017, ArXiv.
[31] Timnit Gebru,et al. Gender Shades: Intersectional Accuracy Disparities in Commercial Gender Classification , 2018, FAT.
[32] Percy Liang,et al. Fairness Without Demographics in Repeated Loss Minimization , 2018, ICML.
[33] Vitaly Feldman,et al. Distribution-Specific Agnostic Boosting , 2009, ICS.
[34] Seth Neel,et al. Preventing Fairness Gerrymandering: Auditing and Learning for Subgroup Fairness , 2017, ICML.
[35] Umesh V. Vazirani,et al. An Introduction to Computational Learning Theory , 1994 .
[36] Alexandra Chouldechova,et al. Fairer and more accurate, but for whom? , 2017, ArXiv.
[37] Yoav Freund,et al. A decision-theoretic generalization of on-line learning and an application to boosting , 1995, EuroCOLT.
[38] James Zou,et al. How Much Does Your Data Exploration Overfit? Controlling Bias via Information Usage , 2015, IEEE Transactions on Information Theory.
[39] Nathan Srebro,et al. Equality of Opportunity in Supervised Learning , 2016, NIPS.
[40] Adam Tauman Kalai,et al. On agnostic boosting and parity learning , 2008, STOC.