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

One of the most studied machine learning challenges that recent studies have shown the susceptibility of deep neural networks to is the class imbalance problem. While concerted research efforts in this direction have been notable in recent years, findings have shown that the canonical learning objective, empirical risk minimization (ERM), is unable to achieve optimal imbalance learning in deep neural networks given its bias to the majority class. An alternative learning objective, group distributionally robust optimization (gDRO), is investigated in this study for imbalance learning, focusing on tabular imbalanced data as against image data that has dominated deep imbalance learning research. Contrary to minimizing average per instance loss as in ERM, gDRO seeks to minimize the worst group loss over the training data. Experimental findings in comparison with ERM and classical imbalance methods using four popularly used evaluation metrics in imbalance learning across several benchmark imbalance binary tabular data of varying imbalance ratios reveal impressive performance of gDRO, outperforming other compared methods in terms of g-mean and roc-auc.

@article{Mustapha2023,
  title     = {Investigating Group Distributionally Robust Optimization for Deep Imbalanced Learning: A Case Study of Binary Tabular Data Classification},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {14},
  number    = {2},
  year      = {2023},
  publisher = {The Science and Information Organization},
  author    = {Ismail. B. Mustapha and Shafaatunnur Hasan and Hatem S Y Nabbus and Mohamed Mostafa Ali Montaser and Sunday Olusanya Olatunji and Siti Maryam Shamsuddin},
  doi       = {10.14569/IJACSA.2023.0140286},
  url       = {https://doi.org/10.14569/IJACSA.2023.0140286}
}