A General Model for Aggregating Annotations Across Simple, Complex, and Multi-Object Annotation Tasks

Alexander Braylan, Madalyn Marabella, Omar Alonso, Matthew Lease
12/20/2023
cs.LGcs.CL

No official code found. Best implementation: Praznat/annotationmodeling (16 stars, BSD-3-Clause, last commit 2024-06-07).

Abstract

Human annotations are vital to supervised learning, yet annotators often disagree on the correct label, especially as annotation tasks increase in complexity. A strategy to improve label quality is to ask multiple annotators to label the same item and aggregate their labels. Many aggregation models have been proposed for categorical or numerical annotation tasks, but far less work has considered more complex annotation tasks involving open-ended, multivariate, or structured responses. While a variety of bespoke models have been proposed for specific tasks, our work is the first to introduce aggregation methods that generalize across many diverse complex tasks, including sequence labeling, translation, syntactic parsing, ranking, bounding boxes, and keypoints. This generality is achieved by devising a task-agnostic method to model distances between labels rather than the labels themselves. This article extends our prior work with investigation of three new research questions. First, how do complex annotation properties impact aggregation accuracy? Second, how should a task owner navigate the many modeling choices to maximize aggregation accuracy? Finally, what diagnoses can verify that aggregation models are specified correctly for the given data? To understand how various factors impact accuracy and to inform model selection, we conduct simulation studies and experiments on real, complex datasets. Regarding testing, we introduce unit tests for aggregation models and present a suite of such tests to ensure that a given model is not mis-specified and exhibits expected behavior. Beyond investigating these research questions above, we discuss the foundational concept of annotation complexity, present a new aggregation model as a bridge between traditional models and our own, and contribute a new semi-supervised learning method for complex label aggregation that outperforms prior work.

View on arXivView PDF

Code Implementations(1)

BSD-3-Clause

Aggregation for complex labels, described in https://www.ischool.utexas.edu/~ml/papers/braylan_web2020.pdf

167Stan, PythonNov 5, 20192 years agoBSD-3-Clause

Similar Papers

Cite this paper

@article{braylan2023general,
  title  = {A General Model for Aggregating Annotations Across Simple, Complex, and Multi-Object Annotation Tasks},
  author = {Alexander Braylan and Madalyn Marabella and Omar Alonso and Matthew Lease},
  year   = {2023},
  eprint = {2312.13437},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2312.13437v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2312.13437.svg)](https://codeofpaper.com/paper/2312.13437)

Discussion