cs.LGOct 19, 2026

CAVA: Complementary-Label-Aware Data Valuation

Authors: Tan-Ha Mai, Hsuan-Tien Lin, Vu Nguyen

Organizations: National Taiwan University · Amazon

Abstract

Complementary-label learning (CLL) trains a classifier from labels that name a class an instance does not belong to. Such labels are cheap to collect from crowdworkers or vision-language models (VLMs), making them attractive for large-scale annotation. However, both sources can mistakenly assign the true class as the complementary label. Such annotation errors are particularly harmful in CLL because the model is explicitly trained to suppress the correct answer. Optimal transport (OT) data valuation identifies harmful samples by comparing training data with a clean validation set, but transferring it directly to CLL creates a semantic mismatch: label cc means not class cc in the training but class cc in the validation. We show that this makes the OT label groups noisy mixtures whose behavior depends on the noise rate. The transferred score is informative only at sufficiently high noise, becomes uninformative at the crossover rate 1/M1/M for MM classes, and reverses below it, where practical CLL annotation typically operates. We propose CAVA, which introduces a complementary label cost and a label margin that isolates the contribution of each complementary label to the transport potential. The margin keeps a consistent direction across noise rates, detects diagonal noise with a parameter-free threshold of closed-form precision, and allows detected samples to be recycled as ordinary-label supervision. On synthetic and human-annotated benchmarks, CAVA separates diagonal noise almost perfectly where directly transferred OT valuation performs worse than random. With only a fraction of the clean validation data, it also improves every CLL objective we evaluate, showing that OT-based valuation becomes reliable once the semantics of complementary supervision are modeled explicitly.

Figures & tables

Appendix figures & tables34 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. Embracing Biased Transition Matrices for Complementary-Label Learning with Many Classes

    May 15, 2026Tan-Ha Mai, Chao-Kai Chiang, Han-Hwa Shih +3Multiclass ClassificationWeakly Supervised Learning

  2. Quantifying Annotation Agreement in Object Detection with Optimal Transport

    Oct 14, 2026Kirill Prokhorov, Alexandr A. KalininInter-Rater ReliabilityObject Detection