atlas

Research map / Label-efficient and robust learning / Recognition and long-tail

From Biased Selective Labels to Pseudo-Labels: An Expectation-Maximization Framework for Learning from Biased Decisions

ICML 2024 · Label-efficient and robust learning › Recognition and long-tail · approach: Group-robust classification · 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 DCEM, an EM-based method that learns from selective labels under disparate censorship by treating untested outcomes as latent and regularizing predictions with a learned testing propensity, evaluated on synthetic data and MIMIC-III sepsis.

Problem

Learning classifiers when labels are observed only for tested individuals and untested individuals are imputed as negative, with testing decisions biased across subgroups (disparate censorship), which can amplify bias against disadvantaged groups.

Approach

Cast disparate censorship as a latent-variable problem and derive an EM procedure: the E-step imputes soft pseudo-labels for untested individuals, and the M-step adds a causal regularizer that pushes predictions down where the estimated testing probability is high, counterbalancing labeling bias while leaving tested individuals fully supervised.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use DCEM instead of the y-obs modelSynthetic classification · Synthetic, q_y = 0.5, k=1, q_t=2median AUC: 0.657 -> 0.787Helped
Use DCEM instead of SELFSynthetic classification · Synthetic, q_y = 0.5, k=1, q_t=2median AUC: 0.677 vs. DCEM: 0.787Helped
Use DCEM instead of tested-only trainingSynthetic classification · Synthetic, q_y = 0.5, k=1, q_t=2median AUC: DCEM: 0.787 vs. tested-only: 0.815Hurt
Use DCEM instead of SELFSynthetic classification · Synthetic, q_y = 0.5, k=1, q_t=2median ROC gap: 0.034 -> 0.030Helped
Use DCEM instead of tested-only trainingSynthetic classification across s_Y · Synthetic, q_y = 0.5, k=1, q_t=2maximum ROC gap: 0.083 -> 0.060Helped
Use DCEM instead of tested-only trainingSynthetic classification across s_Y · Synthetic, q_y = 0.5, k=1, q_t=2minimum AUC: 0.623 -> 0.768Helped
Use DCEM instead of tested-only trainingSynthetic classification at similar AUC · Synthetic, AUC in (0.825, 0.875)average ROC gap: 0.050 -> 0.028Helped
Use DCEM instead of DragonNetMIMIC-III sepsis classification · MIMIC-III sepsis, q_t=1.5, k=4median AUC: 0.593 -> 0.620Helped
Use DCEM instead of Group 0MIMIC-III sepsis classification · MIMIC-III sepsis, q_t=1.5, k=4median AUC: 0.342 vs. DCEM: 0.620Helped
Use DCEM instead of Group peer lossMIMIC-III sepsis classification · MIMIC-III sepsis, q_t=1.5, k=4median ROC gap: Group peer loss ... 0.070 ... (DCEM: 0.105)Hurt
Use DCEM instead of DragonNetMIMIC-III sepsis classification across s_T · MIMIC-III sepsis, q_t=1.5, k=4minimum AUC: 0.574 -> 0.584Helped
Use DCEM instead of DragonNetMIMIC-III sepsis classification across s_T · MIMIC-III sepsis, q_t=1.5, k=4AUC range: DCEM: 0.065 vs. DragonNet: 0.018Mixed

Surprising findings

Limitations

Experimental setup

Datasets: MIMIC-III Sepsis-3 cohort synthetic disparate censorship simulations

Benchmarks: synthetic disparate censorship simulations MIMIC-III sepsis classification

Metrics: AUC ROC gap (area between ROC curves) worst-case AUC worst-case ROC gap range

Baselines: y-obs model group a only tested-only group peer loss SELF DragonNet SAREM DivideMix truncated lq loss generalized Jensen-Shannon loss

Builds on: expectation-maximization DragonNet SELF peer loss SAREM

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