REVIEW 4 cited by
Dataset Difficulty and the Role of Inductive Bias
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
read the original abstract
Motivated by the goals of dataset pruning and defect identification, a growing body of methods have been developed to score individual examples within a dataset. These methods, which we call "example difficulty scores", are typically used to rank or categorize examples, but the consistency of rankings between different training runs, scoring methods, and model architectures is generally unknown. To determine how example rankings vary due to these random and controlled effects, we systematically compare different formulations of scores over a range of runs and model architectures. We find that scores largely share the following traits: they are noisy over individual runs of a model, strongly correlated with a single notion of difficulty, and reveal examples that range from being highly sensitive to insensitive to the inductive biases of certain model architectures. Drawing from statistical genetics, we develop a simple method for fingerprinting model architectures using a few sensitive examples. These findings guide practitioners in maximizing the consistency of their scores (e.g. by choosing appropriate scoring methods, number of runs, and subsets of examples), and establishes comprehensive baselines for evaluating scores in the future.
Forward citations
Cited by 4 Pith papers
-
Disentangling the Roles of Representation and Selection in Data Pruning
In NLP data pruning, the representation used to score examples (especially gradients) influences selected data and downstream performance more than the selection algorithm, and difficulty-oriented algorithms often do ...
-
On Support Samples of Next Word Prediction
Training examples that most shape a GPT-2 model's next-word predictions can be identified with about 80% accuracy from the randomly initialized model, before any training.
-
Leveraging Per-Instance Privacy for Machine Unlearning
Per-instance privacy losses, estimated from gradient norms during training, predict the number of fine-tuning steps needed for machine unlearning and rank data points by unlearning difficulty.
-
Quality over Quantity: An Effective Large-Scale Data Reduction Strategy Based on Pointwise V-Information
A PVI-based data reduction and progressive training strategy is applied to Chinese NLI, but the reported small accuracy declines do not match the experimental tables.
Discussion (0). Sign in to comment.