Metric-Dependent Annotation Saturation for Learning from Label Distributions
A new study titled 'Metric-Dependent Annotation Saturation for Learning from Label Distributions' explores how the number of annotators required to capture disagreement in label distributions varies based on the evaluation metric. The research fine-tunes NLI models on data from ChaosNLI, revealing that entropy correlation requires 20-50 annotators for convergence, while KL divergence saturates with just 10 annotators.
WPN Brief
- What Happened
A new study titled 'Metric-Dependent Annotation Saturation for Learning from Label Distributions' explores how the number of annotators required to capture disagreement in label distributions varies based on the evaluation metric. The research fine-tunes NLI models on data from ChaosNLI, revealing that entropy correlation requires 20-50 annotators for convergence, while KL divergence saturates with just 10 annotators.
- Why It Matters
This development highlights the importance of understanding metric-dependent saturation in machine learning, suggesting that soft labels provide unique signals that traditional label smoothing methods cannot replicate, potentially improving model performance in natural language inference tasks.