Pith. sign in

REVIEW 8 cited by

Dataset Cartography: Mapping and Diagnosing Datasets with Training Dynamics

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2009.10795 v2 pith:QZFQOWZB submitted 2020-09-22 cs.CL

Dataset Cartography: Mapping and Diagnosing Datasets with Training Dynamics

classification cs.CL
keywords datamodeldatasetstrainingmapsregionsacrossconfidence
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Large datasets have become commonplace in NLP research. However, the increased emphasis on data quantity has made it challenging to assess the quality of data. We introduce Data Maps---a model-based tool to characterize and diagnose datasets. We leverage a largely ignored source of information: the behavior of the model on individual instances during training (training dynamics) for building data maps. This yields two intuitive measures for each example---the model's confidence in the true class, and the variability of this confidence across epochs---obtained in a single run of training. Experiments across four datasets show that these model-dependent measures reveal three distinct regions in the data map, each with pronounced characteristics. First, our data maps show the presence of "ambiguous" regions with respect to the model, which contribute the most towards out-of-distribution generalization. Second, the most populous regions in the data are "easy to learn" for the model, and play an important role in model optimization. Finally, data maps uncover a region with instances that the model finds "hard to learn"; these often correspond to labeling errors. Our results indicate that a shift in focus from quantity to quality of data could lead to robust models and improved out-of-distribution generalization.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 8 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Let the Target Select for Itself: Data Selection via Target-Aligned Paths

    cs.LG 2026-05 unverdicted novelty 6.0

    Target-aligned data selection via normalized endpoint loss drop on a validation-induced reference path achieves competitive performance with reduced computational overhead.

  2. COMPASS: COntinual Multilingual PEFT with Adaptive Semantic Sampling

    cs.LG 2026-04 unverdicted novelty 6.0

    COMPASS uses semantic clustering on multilingual embeddings to select auxiliary data for PEFT adapters, outperforming linguistic-similarity baselines on multilingual benchmarks while supporting continual adaptation.

  3. Testing the Assumptions of Active Learning for Translation Tasks with Few Samples

    cs.CL 2026-04 unverdicted novelty 5.0

    Informativeness and diversity of samples selected by active learning show no correlation with test performance on translation tasks using few samples; ordering and pre-training effects dominate instead.

  4. LiLAW: Lightweight Learnable Adaptive Weighting to Learn Sample Difficulty & Improve Noisy Training

    cs.LG 2025-09 unverdicted novelty 5.0

    LiLAW learns to weight samples as easy, moderate or hard using three global scalars updated by one gradient step on a validation batch to improve noisy training performance.

  5. Ordinal Adaptive Correction: A Data-Centric Approach to Ordinal Image Classification with Noisy Labels

    cs.CV 2025-09 unverdicted novelty 5.0

    ORDAC adaptively corrects noisy ordinal labels via dynamic label distribution adjustments, yielding lower error and higher recall on noisy Adience and Diabetic Retinopathy benchmarks.

  6. Difficulty-Based Preference Data Selection by DPO Implicit Reward Gap

    cs.CL 2025-08 unverdicted novelty 5.0

    Selecting preference pairs whose DPO implicit reward gap is small yields better LLM alignment than random or baseline selection while using only 10% of the data.

  7. Efficient, Validation-Free Intrinsic Quality Estimation for Large-Scale Face Recognition Datasets

    cs.CV 2026-05 unverdicted novelty 4.0

    A validation-free metric combining neighbor-consistency and effective rank to estimate face recognition dataset quality for downstream model performance.

  8. Beyond Explainable AI (XAI): An Overdue Paradigm Shift and Post-XAI Research Directions

    cs.CY 2026-02 unverdicted novelty 4.0

    Current XAI methods for DNNs and LLMs rest on paradoxes and false assumptions that demand a paradigm shift to verification protocols, scientific foundations, context-aware design, and faithful model analysis rather th...