atlas

Research map / Label-efficient and robust learning / Noisy labels

Optimal Transport Reweighting for Robust Learning under Spurious Correlations and Label Noise

NeurIPS 2026 · Label-efficient and robust learning › Noisy labels · approach: Noise-aware loss and pairwise methods · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes POTER, an optimal-transport reweighting method that derives per-sample importance from class-conditioned OT dual potentials between training data and a validation-built reference, enabling single-stage ERM robust to spurious correlations and label noise.

Problem

Worst-group accuracy under subpopulation shift from spurious correlations degrades further under label noise, since loss-based sample selection picks up mislabeled samples; group labels are only available on a limited validation set.

Approach

Derive sample weights from class-conditioned OT dual potentials between the noisy training empirical distribution and a reference distribution built from validation group annotations, then apply a KL-regularized closed-form exponential reweighting for a single ERM stage, avoiding loss-based selection and retraining.

Key results

Surprising findings

Limitations

Experimental setup

Datasets: CMNIST Waterbirds CelebA CivilComments

Benchmarks: CMNIST Waterbirds CelebA CivilComments

Metrics: worst-group accuracy average accuracy

Baselines: ERM Group DRO LISA DFR PDE JTT CnC SSA AFR GIC LEIA KNN-RAD

Builds on: Sinkhorn algorithm Kantorovich duality Group DRO AFR KNN-RAD JTT

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy