Improved Algorithm for Deep Active Learning under Imbalance via Optimal Separation

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Nuggehalli, Shyam, Zhang, Jifan, Jain, Lalit, Nowak, Robert
Formato: Preprint
Publicado: 2023
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866913889648640000
author Nuggehalli, Shyam
Zhang, Jifan
Jain, Lalit
Nowak, Robert
author_facet Nuggehalli, Shyam
Zhang, Jifan
Jain, Lalit
Nowak, Robert
contents Class imbalance severely impacts machine learning performance on minority classes in real-world applications. While various solutions exist, active learning offers a fundamental fix by strategically collecting balanced, informative labeled examples from abundant unlabeled data. We introduce DIRECT, an algorithm that identifies class separation boundaries and selects the most uncertain nearby examples for annotation. By reducing the problem to one-dimensional active learning, DIRECT leverages established theory to handle batch labeling and label noise -- another common challenge in data annotation that particularly affects active learning methods. Our work presents the first comprehensive study of active learning under both class imbalance and label noise. Extensive experiments on imbalanced datasets show DIRECT reduces annotation costs by over 60\% compared to state-of-the-art active learning methods and over 80\% versus random sampling, while maintaining robustness to label noise.
format Preprint
id arxiv_https___arxiv_org_abs_2312_09196
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Improved Algorithm for Deep Active Learning under Imbalance via Optimal Separation
Nuggehalli, Shyam
Zhang, Jifan
Jain, Lalit
Nowak, Robert
Machine Learning
Artificial Intelligence
Computer Vision and Pattern Recognition
Class imbalance severely impacts machine learning performance on minority classes in real-world applications. While various solutions exist, active learning offers a fundamental fix by strategically collecting balanced, informative labeled examples from abundant unlabeled data. We introduce DIRECT, an algorithm that identifies class separation boundaries and selects the most uncertain nearby examples for annotation. By reducing the problem to one-dimensional active learning, DIRECT leverages established theory to handle batch labeling and label noise -- another common challenge in data annotation that particularly affects active learning methods. Our work presents the first comprehensive study of active learning under both class imbalance and label noise. Extensive experiments on imbalanced datasets show DIRECT reduces annotation costs by over 60\% compared to state-of-the-art active learning methods and over 80\% versus random sampling, while maintaining robustness to label noise.
title Improved Algorithm for Deep Active Learning under Imbalance via Optimal Separation
topic Machine Learning
Artificial Intelligence
Computer Vision and Pattern Recognition
url https://arxiv.org/abs/2312.09196