arrow
Return

Towards effective metamorphic testing by algorithm stability for linear classification programs

delete2021-10-01
delete3
PRE
AI
Y
Yingzhuo Yang
Z
Zenan Li
H
Huiyan Wang
C
Chang Xu *
X
Xiaoxing Ma
DOI:10.1016/j.jss.2021.111012delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
The quality assurance for machine learning systems is becoming increasingly critical nowadays. While many efforts have been paid on trained models from such systems, we focus on the quality of these systems themselves, as the latter essentially decides the quality of numerous models thus trained. In this article, we focus particularly on detecting bugs in implementing one class of model-training systems, namely, linear classification algorithms, which are known to be challenging due to the lack of test oracle. Existing work has attempted to use metamorphic testing to alleviate the oracle problem, but fallen short on overlooking the statistical nature of such learning algorithms, leading to premature metamorphic relations (MRs) suffering efficacy and necessity issues. To address this problem, we first derive MRs from a fundamental property of linear classification algorithms, i.e., algorithm stability, with the soundness guarantee. We then formulate such MRs in a way that is rare in usage but could be more effective according to our field study and analysis, i.e., Past-execution Dependent MR (PD-MR), as contrast to the traditional way, i.e., Past-execution Independent MR (PI-MR), which has been extensively studied. We experimentally evaluated our new MRs upon nine well-known linear classification algorithms. The results reported that the new MRs detected 37.6-329.2% more bugs than existing benchmark MRs. (C) 2021 Elsevier Inc. All rights reserved.
Keywords:
Metamorphic testing
Metamorphic relation
Machine learning program
Linear classifier
Algorithm stability
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Journal of Systems and Software cover
Journal of Systems and Software
IF:
4.1
Papers:
5.5K
Citations:
8.4K

Organization

N
nanjing university
Scholars:
7.8W
Papers: 5.6W
Citations: 87
Cited Papers

Cited Papers

Financial Distress and its Predicting Factors among Iranian Cancer Patients
err2015-03-09
err0
errOAAI
errAbazar Fathollahzade; Azad Rahmani; Abbas Dadashzadeh; Akram Gahramanian; Ali Esfahani; Leila Javanganji; Leila Nabiolahi
errShare
errSave
Testing and validating machine learning classifiers by metamorphic testing
err2011-04-01
err251
errOAAI
errXie, Xiaoyuan; Ho, Joshua W. K.; Murphy, Christian; Kaiser, Gail; Xu, Baowen; Chen, Tsong Yueh
errShare
errSave
A THEORY OF THE LEARNABLE
err1984-11-05
err2.4K
errOAAI
errVALIANT, LG
errShare
errSave
Dual coordinate descent methods for logistic regression and maximum entropy models
err2010-11-11
err265
errOAAI
errYu, Hsiang-Fu; Huang, Fang-Lan; Lin, Chih-Jen
errShare
errSave
Thin polycrystalline zinc oxide films obtained by oxidation of metallic zinc films
err2005-02-01
err0
PREAI
errYa.I. Alivov; A.V. Chernykh; M.V. Chukichev; R.Y. Korotkov
errShare
errSave
researcher View more