A Fundamental Performance Limitation for Adversarial Classification
원문 초록
Despite the widespread use of machine learning algorithms to solve problems of technological, economic, and social relevance, provable guarantees on the performance of these data-driven algorithms are critically lacking, especially when the data originates from unreliable sources and is transmitted over unprotected and easily accessible channels. In this paper we take an important step to bridge this gap and formally show that, in a quest to optimize their accuracy, binary classification algorithms -- including those based on machine-learning techniques -- inevitably become more sensitive to adversarial manipulation of the data. Further, for a given class of algorithms with the same complexity (i.e., number of classification boundaries), the fundamental tradeoff curve between accuracy and sensitivity depends solely on the statistics of the data, and cannot be improved by tuning the algorithm.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
LLSF - Learning Label Specific Features for Multi-Label Classifcation
ExploreKit: Automatic Feature Generation and Selection
Thumbs up? Sentiment Classification using Machine Learning Techniques
PatchDEMUX: A Certifiably Robust Framework for Multi-label Classifiers Against Adversarial Patches
Detecting immune cells with label-free two-photon autofluorescence and deep learning
Adversarial Surrogate Risk Bounds for Binary Classification
토론
이 논문과 연결된 포럼 글이 아직 없습니다.