Counter-adversarial training data distribution validation

Abstract Many machine learning algorithms lack a procedure for testing/validating the integrity of training data so that attacks on training data remain a simple but yet effective way to derail those algorithms—they can result in devastating consequences, particularly in security-sensitive systems. The difficulty in designing an effective testing procedure is that the distribution of the training data may change naturally with time. Thus, the question is how to distinguish a natural change in the distribution and a change due to adversary’s attack. This work offers a partial answer with a modification of the existing conditional generative adversarial networks (CGAN) framework, where a generative model aims not only to avoid detection by a discriminator but also to design a poisoning sample which will result in the largest prediction error if a classifier is trained on the data that includes the sample. Simultaneous training of the validating and generative models results in a procedure that detects corrupted data which is nearly as optimal as the poisoning sample. The modified CGAN framework is then specialized for support vector machines (SVMs) and general classification models.

Authors

Institutions

Publication Details

Journal
Optimization Letters
Published
2025-10-23
DOI
https://doi.org/10.1007/s11590-025-02253-x
Primary Topic
Adversarial Robustness in Machine Learning
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Counter-adversarial training data distribution validation

Ihor Indyk, Michael Zabarankin
Optimization Letters
Adversarial Robustness in Machine Learning
article

Counter-adversarial training data distribution validation

Ihor Indyk, Michael Zabarankin
article en

Abstract

Abstract Many machine learning algorithms lack a procedure for testing/validating the integrity of training data so that attacks on training data remain a simple but yet effective way to derail those algorithms—they can result in devastating consequences, particularly in security-sensitive systems. The difficulty in designing an effective testing procedure is that the distribution of the training data may change naturally with time. Thus, the question is how to distinguish a natural change in the distribution and a change due to adversary’s attack. This work offers a partial answer with a modification of the existing conditional generative adversarial networks (CGAN) framework, where a generative model aims not only to avoid detection by a discriminator but also to design a poisoning sample which will result in the largest prediction error if a classifier is trained on the data that includes the sample. Simultaneous training of the validating and generative models results in a procedure that detects corrupted data which is nearly as optimal as the poisoning sample. The modified CGAN framework is then specialized for support vector machines (SVMs) and general classification models.

Optimization LettersVol. 20(3)
Stevens Institute of Technology (US)
Openalex Percentile: Top 84%
Adversarial Robustness in Machine Learning
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.