Modulus-based iterative methods for constrained ℓ p – ℓ q minimization

Buccini, A; Pasha, M; Reichel, L

doi:10.1088/1361-6420/ab9f86

Not AvailableAdversarial training has been proposed to protect machine learning models against adversarial attacks. This article focuses on adversarial training under -perturbation, which has recently attracted much research attention. The asymptotic behavior of the adversarial training estimator is investigated in the generalized linear model. The results imply that the asymptotic distribution of the adversarial training estimator under -perturbation could put a positive probability mass at 0 when the true parameter is 0, providing a theoretical guarantee of the associated sparsity-recovery ability. Alternatively, a two-step procedure is proposed—adaptive adversarial training, which could further improve the performance of adversarial training under -perturbation. Specifically, the proposed procedure could achieve asymptotic variable-selection consistency and unbiasedness. Numerical experiments are conducted to show the sparsity-recovery ability of adversarial training under -perturbation and to compare the empirical performance between classic adversarial training and adaptive adversarial training. Supplementary materials for this article are available online, including a standardized description of the materials available for reproducing the work.

More Like this