.png){kind=icon}
.png){kind=icon}
Return
Data Debugging Is NP-Hard for Classifiers Trained with SGD
.png){kind=icon}
PRE
AI
DOI：10.1007/978-981-95-0218-9_13.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Data debugging is to find a subset of the training data such that the model obtained by retraining on the subset has a better accuracy.A bunch of heuristic approaches are proposed, however, none of them are guaranteed to solve this problem effectively.This leaves an open issue whether there exists an efficient algorithm to find the subset such that the model obtained by retraining on it has a better accuracy.To answer this open question and provide theoretical basis for further study on developing better algorithms for data debugging, we investigate the computational complexity of the problem named Debuggable.Given a machine learning model M obtained by training on dataset D and a test instance (x(test), y(test)) where M(x(test)) not equal y(test), Debuggable is to determine whether there exists a subset D ' of D such that the model M ' obtained by retraining on D ' satisfies M ' (x(test)) = y(test). To cover a wide range of commonly used models, we take SGD-trained linear classifier as the model and derive the following main results.(1) If the loss function and the dimension of the model are not fixed, Debuggable is NP-complete regardless of the training order in which all the training samples are processed during SGD.(2) For hinge-like loss functions, a comprehensive analysis on the computational complexity of Debuggable is provided;(3) If the loss function is a linear function, Debuggable can be solved in linear time. These results not only highlight the limitations of current approaches but also offer new insights into data debugging.
Keywords:
Data Debugging
SGD-trained Linear Classifier
Computational Complexity
NP-completeness
Hinge-like Loss Function
Journal
C
IF:
0
Papers:
24
Citations:
0