Investigating Group Distributionally Robust Optimization for Deep Imbalanced Learning: A Case Study of Binary Tabular Data Classification

Oversampling and undersampling are two common data resampling approaches used in DNN. Owing to increased data availability, novel learning However, the susceptibility of the former to noise and architectures and accessibility to commodity computational overfitting due to added samples [23] as well as the hardware devices, deep neural networks (DNNs) have become characteristic loss of valuable information peculiar with the the de facto tool for a wide range of machine learning (ML) latter [3] remain major drawbacks of this category of tasks in recent times; leading to state-of-the-art performance in imbalance methods. On the other hand, the core idea behind several computer vision, natural language processing and the cost sensitive methods is to assign different speech recognition tasks. DNNs are characterized by several misclassification cost/weights to the training samples to scale layers of hidden units that enable learning of useful up/down the misclassification errors depending on the class representations of a given data for improved model they belong [17, 24]. While there are several implementations performance [1, 2]. This alleviates the need for domain experts of this method, the most commonly used cost sensitive and hand-engineered features, a common prerequisite for approach in imbalanced deep learning research is reweighting traditional ML methods.