Online and stochastic gradient methods for non-decomposable loss functions
Kar, P., Narasimhan, H., and Jain, P · 2014
Later among the works it cites.
Consistent binary classification with generalized performance metrics
Koyejo, O. O., Natarajan, N., Ravikumar, P. K., and Dhillon, I. S · 2014
Later among the works it cites.
On the statistical consistency of plug-in classifiers for nondecomposable performance measures
Narasimhan, H., Vaish, R., and Agarwal, S · 2014
Later among the works it cites.
Optimizing f-measures by cost-sensitive classification
Parambath, S. P., Usunier, N., and Grandvalet, Y · 2014
Later among the works it cites.
Surrogate functions for maximizing precision at the top
Kar, P., Narasimhan, H., and Jain, P · 2015
Later among the works it cites.
Adam: A method for stochastic optimization
Kingma, D. P. and Ba, J · 2015
Later among the works it cites.
Satisfying real-world goals with dataset constraints
Goh, G., Cotter, A., Gupta, M., and Friedlander, M. P · 2016
Later among the works it cites.
Equality of opportunity in supervised learning
Hardt, M., Price, E., and Srebro, N · 2016
Later among the works it cites.
UCI machine learning repository, 2017
Dheeru, D. and Karra Taniskidou, E · 2017
Later among the works it cites.
Scalable learning of non-decomposable objectives
Eban, E., Schain, M., Mackey, A., Gordon, A., Rifkin, R., and Elidan, G · 2017
Later among the works it cites.
Deep sets
Zaheer, M., Kottur, S., Ravanbakhsh, S., Poczos, B., Salakhutdinov, R. R., and Smola, A. J · 2017
Later among the works it cites.
A reductions approach to fair classification
Agarwal, A., Beygelzimer, A., Dudik, M., Langford, J., and Wallach, H · 2018
Closest in time.
Preventing fairness gerrymandering: Auditing and learning for subgroup fairness
Kearns, M., Neel, S., Roth, A., and Wu, Z. S · 2018
Closest in time.
Learning with complex loss functions and constraints
Narasimhan, H · 2018
Closest in time.