Nov. 23, 2022, 2:11 a.m. | Chenkang Zhang

cs.LG updates on arXiv.org arxiv.org

AUC (area under the ROC curve) optimization algorithms have drawn much
attention due to the incredible adaptability for seriously imbalanced data.
Real-world datasets usually contain extensive noisy samples that seriously
hinder the model performance, but a limited number of clean samples can be
obtained easily. Although some AUC optimization studies make an effort to
dispose of noisy samples, they do not utilize such clean samples well. In this
paper, we propose a robust AUC optimization algorithm (RAUCO) with good use …

arxiv auc clean data data optimization

Senior Machine Learning Engineer (MLOps)

@ Promaton | Remote, Europe

Data Analyst

@ SEAKR Engineering | Englewood, CO, United States

Data Analyst II

@ Postman | Bengaluru, India

Data Architect

@ FORSEVEN | Warwick, GB

Director, Data Science

@ Visa | Washington, DC, United States

Senior Manager, Data Science - Emerging ML

@ Capital One | McLean, VA