Cost-Sensitive Learning for Rare Storage Failures: Evaluating Warning Lead Time, Missed Failures, and False-Alarm Burden

Authors

  • Tariq Iqbal Department of Artificial Intelligence and Systems Reliability, Technical University of Munich (TUM) Author
  • Theo Martin Department of Artificial Intelligence and Systems Reliability, University of Auckland Author
  • Lucas Silva Department of Artificial Intelligence and Systems Reliability, Nanyang Technological University (NTU) Author

Abstract

Storage failures are rare relative to normal operating periods, so conventional classifiers may achieve high aggregate accuracy while missing operationally important events or generating excessive false alarms. We compared standard cross-entropy training with three cost-sensitive learning strategies on telemetry from 12,406 devices containing 418 documented failure events. Models were evaluated using time-ordered validation, with warning lead time, failure recall, precision, and alert burden measured at matched decision thresholds. Cost-sensitive training increased failure recall from 61% to 78% while preserving a median warning lead time of 9.6 days. The best-performing configuration reduced false alarms by 24% relative to class-weighting alone and generated 2.1 alerts per 100 device-days. Extremely aggressive miss penalties improved recall further but produced an alert volume unlikely to be operationally sustainable. Calibration deteriorated when cost weights were increased without post-training adjustment; isotonic recalibration corrected most of this effect. Cost-sensitive objectives can improve rare-failure detection, but model selection should explicitly balance missed failures, usable warning time, and the number of alerts an operations team can realistically investigate.

References

1. Nazir M. Performance-telemetry-based anomaly detection for early failure identification in enterprise storage systems. Journal of Multidisciplinary Research and Integrated Sciences. 2023. Available from: https://jmris.com/index.php/jmris/article/view/2023V1P6

2. Schroeder B, Gibson GA. Disk failures in the real world: what does an MTTF of 1,000,000 hours mean to you?. In: Proceedings of the 5th USENIX Conference on File and Storage Technologies. 2007. p. 1-16. Available from: https://www.usenix.org/legacy/events/fast07/tech/schroeder.html

3. Pinheiro E, Weber WD, Barroso LA. Failure trends in a large disk drive population. In: Proceedings of the 5th USENIX Conference on File and Storage Technologies. 2007. p. 17-29. Available from: https://www.usenix.org/legacy/events/fast07/tech/pinheiro.html

4. Lu S, Luo B, Patel T, Yao Y, Tiwari D, Shi W. Making disk failure predictions SMARTer. In: Proceedings of the 18th USENIX Conference on File and Storage Technologies. 2020. p. 151-167. Available from: https://www.usenix.org/conference/fast20/presentation/lu

5. Murray JF, Hughes GF, Kreutz-Delgado K. Machine learning methods for predicting failures in hard drives: a multiple-instance application. J Mach Learn Res. 2005;6:783-816. Available from: https://www.jmlr.org/papers/v6/murray05a.html

6. Breiman L. Random forests. Mach Learn. 2001;45:5-32. doi:10.1023/A:1010933404324.

7. Chen T, Guestrin C. XGBoost: a scalable tree boosting system. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2016. p. 785-794. doi:10.1145/2939672.2939785.

8. Guo C, Pleiss G, Sun Y, Weinberger KQ. On calibration of modern neural networks. Proc Mach Learn Res. 2017;70:1321-1330. Available from: https://proceedings.mlr.press/v70/guo17a.html

9. Saito T, Rehmsmeier M. The precision-recall plot is more informative than the ROC plot when evaluating binary classifiers on imbalanced datasets. PLoS One. 2015;10(3):e0118432. doi:10.1371/journal.pone.0118432.

10. Kapoor S, Narayanan A. Leakage and the reproducibility crisis in machine-learning-based science. Patterns. 2023;4(9):100804. doi:10.1016/j.patter.2023.100804.

11. Ovadia Y, Fertig E, Ren J, Nado Z, Sculley D, Nowozin S, et al. Can you trust your model's uncertainty? Evaluating predictive uncertainty under dataset shift. Adv Neural Inf Process Syst. 2019;32. Available from: https://arxiv.org/abs/1906.02530

12. Demšar J. Statistical comparisons of classifiers over multiple data sets. J Mach Learn Res. 2006;7:1-30. Available from: https://www.jmlr.org/papers/v7/demsar06a.html

13. Gebru T, Morgenstern J, Vecchione B, Vaughan JW, Wallach H, Daumé H III, et al. Datasheets for datasets. Commun ACM. 2021;64(12):86-92. doi:10.1145/3458723.

14. Lakens D. Sample size justification. Collabra Psychol. 2022;8(1):33267. doi:10.1525/collabra.33267.

15. Nosek BA, Ebersole CR, DeHaven AC, Mellor DT. The preregistration revolution. Proc Natl Acad Sci U S A. 2018;115(11):2600-2606. doi:10.1073/pnas.1708274114.

16. Wilkinson MD, Dumontier M, Aalbersberg IJ, Appleton G, Axton M, Baak A, et al. The FAIR Guiding Principles for scientific data management and stewardship. Sci Data. 2016;3:160018. doi:10.1038/sdata.2016.18.

17. Lakens D. Calculating and reporting effect sizes to facilitate cumulative science: a practical primer for t-tests and ANOVAs. Front Psychol. 2013;4:863. doi:10.3389/fpsyg.2013.00863.

18. Efron B. Bootstrap methods: another look at the jackknife. Ann Stat. 1979;7(1):1-26. doi:10.1214/aos/1176344552.

Published

2024-06-01