Evidence map›Paper›PMID 39030210›Full record

ArticleScientific reports2024

Robust AUC optimization under the supervision of clean data.

Chenkang Zhang, Haobing Tian, Lang Zhang, Pengju Jiao

Abstract read
In one paragraph

Article in Scientific reports, 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Chenkang ZhangChina Mobile (Suzhou) Software Technology Company Limited, Suzhou, 215163, China. zhangchenkang@cmss.chinamobile.com.
Haobing TianChina Mobile (Suzhou) Software Technology Company Limited, Suzhou, 215163, China.
Lang ZhangChina Mobile (Suzhou) Software Technology Company Limited, Suzhou, 215163, China.
Pengju JiaoChina Mobile (Suzhou) Software Technology Company Limited, Suzhou, 215163, China.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

AUC (area under the ROC curve) is an essential metric that has been extensively researched in the field of machine learning. Traditional AUC optimization methods need a large-scale clean dataset, while real-world datasets usually contain massive noisy samples. To reduce the impact of noisy samples, many robust AUC optimization methods have been proposed. However, these methods only use noisy data and ignore the effect of clean data. To make full use of clean data and noisy data, in this paper, we propose a new framework for AUC optimization which uses clean samples to guide the processing of the noisy dataset based on the technology of self-paced learning (SPL). Innovatively, we introduce the consistency regularization term to reduce the negative impact of the data enhancement technology on SPL. Traditional SPL methods usually suffer from the high complexity of alternately solving the two critical sub-problems with respect to sample weights and model parameters. To speed up the training process, we propose a new efficient algorithm to solve our problem, which alternately updates sample weights and model parameters with the stochastic gradient method. Theoretically, we prove that our new optimization method can converge to a stationary point. Comprehensive experiments demonstrate that our robust AUC optimization (RAUCO) algorithm holds better robustness than existing algorithms.

Identifiers

PMID39030210
PMCPMC11271567

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.