An embarrassingly simple approach to neural multiple instance classification

Abstract

Multiple Instance Learning (MIL) is a weak supervision learning paradigm that allows modeling of machine learning problems in which labels are not available for individual examples but only for groups of examples called bags. A positive bag may contain one or more positive examples but it is not known which examples in the bag are positive. All examples in a negative bag belong to the negative class. Such problems arise frequently in fields of computer vision, medical image processing and bioinformatics. Many neural network-based solutions have been proposed in the literature for MIL. However, almost all of them rely on introducing specialized blocks and connectivity in their architectures. In this paper, we present a simple and effective approach to Multiple Instance Learning in neural networks. We propose a simple bag-level ranking loss function that allows Multiple Instance Classification in any neural architecture. We have demonstrated the effectiveness of our proposed method for popular MIL benchmark datasets. Additionally, we have also tested the performance of our method in convolutional neural networks used to model an MIL problem derived from the well-known MNIST dataset. Results show that despite being simpler, our proposed scheme is comparable or better than existing methods in the literature in practical scenarios. Python code files for all the experiments can be found at https://github.com/amina01/ESMIL