Fetching the paper…
Reading the bibliography…
In this paper, we propose systematic and efficient gradient-based methods for both one-way and two-way partial AUC (pAUC) maximization that are applicable to deep learning.
Large Margin Rank Boundaries for Ordinal Regression
Herbrich, R., Graepel, T., and Obermayer, K · 1999
Earlier work this paper cites.
Optimization of conditional value-at-risk
Rockafellar, R. T., Uryasev, S., et al · 2000
Earlier work this paper cites.
Partial auc estimation and regression
Dodd, L. and Pepe, M · 2003
Earlier work this paper cites.
Minimizing the sum of the k largest functions in linear time
Ogryczak, W. and Tamir, A · 2003
Earlier work this paper cites.
Asymmetric support vector machines: Low false-positive learning under the user tolerance
Wu, S.-H., Lin, K.-P., Chen, C.-M., and Chen, M.-S · 2008
Earlier work this paper cites.
Learning multiple layers of features from tiny images
Krizhevsky, A., Hinton, G., et al · 2009
Earlier work this paper cites.
The p-norm push: A simple convex ranking algorithm that concentrates at the top of the list
Rudin, C · 2009
Earlier work this paper cites.
A boosting method for maximizing the partial area under the roc curve
Komori, O. and Eguchi, S · 2010
Earlier work this paper cites.
The infinite push: A new support vector ranking algorithm that directly optimizes accuracy at the absolute top of the list
Agarwal, S · 2011
Earlier work this paper cites.
Partial auc maximization in a linear combination of dichotomizers
Ricamato, M. T. and Tortorella, F · 2011
Earlier work this paper cites.
Marker selection via maximizing the partial area under the roc curve of linear risk scores
Wang, Z. and Chang, Y.-C. I · 2011
Earlier work this paper cites.
Sparse support vector infinite push
Rakotomamonjy, A · 2012
Earlier work this paper cites.
An extension of the receiver operating characteristic curve and auc-optimal classification
Takenouchi, T., Komori, O., and Eguchi, S · 2012
Earlier work this paper cites.
Yuan, Z., Yan, Y., Sonka, M., and Yang, T · 2012
Cited alongside, same era.
Online and stochastic gradient methods for non-decomposable loss functions
Kar, P., Narasimhan, H., and Jain, P · 2014
Cited alongside, same era.
Top rank optimization in linear time
Li, N., Jin, R., and Zhou, Z.-H · 2014
Cited alongside, same era.
On the consistency of auc pairwise optimization
Gao, W. and Zhou, Z.-H · 2015
Cited alongside, same era.
Deep residual learning for image recognition
He, K., Zhang, X., Ren, S., and Sun, J · 2016
Cited alongside, same era.
Support vector algorithms for optimizing the partial area under the roc curve
Narasimhan, H. and Agarwal, S · 2017
Semi-supervised learning for maximizing the partial auc
Iwata, T., Fujino, A., and Ueda, N · 2020
Later among the works it cites.
Large-scale methods for distributionally robust optimization
Levy, D., Carmon, Y., Duchi, J. C., and Sidford, A · 2020
Later among the works it cites.
Stochastic AUC maximization with deep neural networks
Liu, M., Yuan, Z., Ying, Y., and Yang, T · 2020
Later among the works it cites.
Non-convex min-max optimization: Provable algorithms and applications in machine learning
Rafique, H., Liu, M., Lin, Q., and Yang, T · 2020
Later among the works it cites.
Stochastic multi-level composition optimization algorithms with level-independent convergence rates
Balasubramanian, K., Ghadimi, S., and Nguyen, A · 2021
Later among the works it cites.
On stochastic moving-average estimators for non-convex optimization
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Davis, D. and Drusvyatskiy, D · 2018
Cited alongside, same era.
Partial auc maximization via nonlinear scoring functions
Ueda, N. and Fujino, A · 2018
Cited alongside, same era.
How powerful are graph neural networks?
Xu, K., Hu, W., Leskovec, J., and Jegelka, S · 2018
Cited alongside, same era.
Universal stagewise learning for non-convex problems with convergence on averaged solutions
Chen, Z., Yuan, Z., Yi, J., Zhou, B., Chen, E., and Yang, T · 2019
Cited alongside, same era.
Efficiency of minimizing compositions of convex functions and smooth maps
Drusvyatskiy, D. and Paquette, C · 2019
Cited alongside, same era.
Two-way partial auc and its properties
Yang, H., Lu, K., Lyu, X., and Hu, F · 2019
Cited alongside, same era.
Guo, Z., Xu, Y., Yin, W., Jin, R., and Yang, T · 2021
Later among the works it cites.
Qi, Q., Luo, Y., Xu, Z., Ji, S., and Yang, T · 2021
Later among the works it cites.
A patient-centric dataset of images and metadata for identifying melanomas using clinical context
Rotemberg, V., Kurtansky, N., Betz-Stablein, B., Caffery, L., Chousakos, E., Codella, N., Combalia, M., Dusza, S., Guitera, P., Gutman, D., et al · 2021
Later among the works it cites.
Advanced graph and sequence neural networks for molecular property prediction and drug discovery, 2021
Wang, Z., Liu, M., Luo, Y., Xu, Z., Xie, Y., Wang, L., Cai, L., Qi, Q., Yuan, Z., Yang, T., and Ji, S · 2021
Later among the works it cites.
When all we need is a piece of the pie: A generic framework for optimizing two-way partial auc
Yang, Z., Xu, Q., Bao, S., He, Y., Cao, X., and Huang, Q · 2021
Later among the works it cites.
Federated deep AUC maximization for hetergeneous data with a constant communication complexity
Yuan, Z., Guo, Z., Xu, Y., Ying, Y., and Yang, T · 2021
Later among the works it cites.
Finite-sum coupled compositional stochastic optimization: Theory and applications
Wang, B. and Yang, T · 2022
Closest in time.
Large-scale optimization of partial auc in a range of false positive rates
Yao, Y., Lin, Q., and Yang, T · 2022
Closest in time.