Yang, Zhenhuan, Ko, Yan Lok, Varshney, Kush R, and Ying, Yiming. Minimax AUC Fairness: Efficient Algorithm with Provable Convergence. Retrieved from https://par.nsf.gov/biblio/10387997. Proceedings of the AAAI Conference on Artificial Intelligence .
Yang, Zhenhuan, Ko, Yan Lok, Varshney, Kush R, and Ying, Yiming.
"Minimax AUC Fairness: Efficient Algorithm with Provable Convergence". Proceedings of the AAAI Conference on Artificial Intelligence (). Country unknown/Code not available. https://par.nsf.gov/biblio/10387997.
@article{osti_10387997,
place = {Country unknown/Code not available},
title = {Minimax AUC Fairness: Efficient Algorithm with Provable Convergence},
url = {https://par.nsf.gov/biblio/10387997},
abstractNote = {},
journal = {Proceedings of the AAAI Conference on Artificial Intelligence},
author = {Yang, Zhenhuan and Ko, Yan Lok and Varshney, Kush R and Ying, Yiming},
}
Warning: Leaving National Science Foundation Website
You are now leaving the National Science Foundation website to go to a non-government website.
Website:
NSF takes no responsibility for and exercises no control over the views expressed or the accuracy of
the information contained on this site. Also be aware that NSF's privacy policy does not apply to this site.