Efficient and precise annotation of local structures in data
Event date:
Webinar with John Martinsson, RISE and Lund University. Machine learning models now help scientists analyze vast datasets across every branch of science. These models typically improve with more data and larger architectures, mainly through supervised learning. Both training and evaluation therefore rely on labeled datasets. A main challenge is scaling the data labeling effort to the volumes required, because it is costly and label quality can vary. Methods that deliver inexpensive yet accurate labels are therefore essential. This talk examines how to lower annotation cost and increase label quality when labeling local structures in data—for example, a local structure can be a sound event in an audio recording. By detecting the boundaries of such structures automatically, we let annotators focus on supplying concise textual descriptions for the content within those boundaries. In this setting we analyze a widely used labeling method for audio where fixed and equal length audio segments are labeled with presence or absence of an event class. We benchmark it against an oracle method that defines an upper bound, and propose adaptive labeling techniques that achieve higher‑quality labels for the studied datasets at a lower cost.