ORIGINAL RESEARCH article

Front. Artif. Intell.

Sec. Machine Learning and Artificial Intelligence

Volume 8 - 2025 | doi: 10.3389/frai.2025.1562916

A Drop-Out Mechanism for Active Learning Based on One-Attribute Heuristics

Provisionally accepted
Sriram  RavichandranSriram Ravichandran1*Nandan  SudarsanamNandan Sudarsanam1Balaraman  RavindranBalaraman Ravindran1Konstantinos  V. KatsikopoulosKonstantinos V. Katsikopoulos2
  • 1Indian Institute of Technology Madras, Chennai, India
  • 2Department of Decision Analytics and Risk, Southampton Business School, Faculty of Social Sciences, University of Southampton, Southampton, Hampshire, United Kingdom

The final, formatted version of the article will be published soon.

Active Learning (AL) leverages the principle that machine learning models can achieve high accuracy with fewer labelled samples by strategically selecting the most informative data points for training. However, when human annotators provide these labels, their decisions might exhibit a systematic bias. For example, humans frequently rely on a limited subset of the available attributes, or even on a single attribute, when making decisions, as when employing fast and frugal heuristics. This paper introduces a mathematically grounded approach to quantify the probability of mislabeling based on one attribute. We present a novel dropout mechanism designed to influence the attribute selection process used in annotation, effectively reducing the impact of bias. The proposed mechanism is evaluated using multiple AL algorithms and heuristic strategies across diverse prediction tasks. Experimental results demonstrate that the dropout mechanism significantly enhances active learning (AL) performance, achieving a minimum 70% improvement in effectiveness. These findings highlight the mechanism's potential to improve the reliability and accuracy of AL systems, providing valuable insights for designing and implementing robust intelligent systems.

Keywords: Active Learning, human-in-the loop, human behavior, biases, Fast and frugal heuristics

Received: 18 Jan 2025; Accepted: 16 Jul 2025.

Copyright: © 2025 Ravichandran, Sudarsanam, Ravindran and Katsikopoulos. This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) or licensor are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.

* Correspondence: Sriram Ravichandran, Indian Institute of Technology Madras, Chennai, India

Disclaimer: All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article or claim that may be made by its manufacturer is not guaranteed or endorsed by the publisher.