CRMay 25, 2020

Keyed Non-Parametric Hypothesis Tests

arXiv:2005.12227v1
Originality Incremental advance
AI Analysis

This addresses security vulnerabilities in AI systems for practitioners and researchers, though it appears incremental as it builds on existing hypothesis testing methods.

The paper tackles the problem of poisoning attacks in machine learning by proposing a new protection strategy using keyed non-parametric hypothesis tests, which leverages a secret key to detect tampered datasets and prevent misleading classifiers.

The recent popularity of machine learning calls for a deeper understanding of AI security. Amongst the numerous AI threats published so far, poisoning attacks currently attract considerable attention. In a poisoning attack the opponent partially tampers the dataset used for learning to mislead the classifier during the testing phase. This paper proposes a new protection strategy against poisoning attacks. The technique relies on a new primitive called keyed non-parametric hypothesis tests allowing to evaluate under adversarial conditions the training input's conformance with a previously learned distribution $\mathfrak{D}$. To do so we use a secret key $κ$ unknown to the opponent. Keyed non-parametric hypothesis tests differs from classical tests in that the secrecy of $κ$ prevents the opponent from misleading the keyed test into concluding that a (significantly) tampered dataset belongs to $\mathfrak{D}$.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes