ARMOURED: Adversarially Robust MOdels using Unlabeled data by REgularizing Diversity
Adversarial attacks pose a major challenge for modern deep neural networks. Recent advancements show that adversarially robust generalization requires a huge amount of labeled data for training. If annotation becomes a burden, can unlabeled data help bridge the gap? In this paper, we propose ARMOURED, an adversarially robust training method based on semi-supervised learning that consists of two components. The first component applies multi-view learning to simultaneously optimize multiple independent networks and utilizes unlabeled data to enforce labeling consistency. The second component reduces adversarial transferability among the networks via diversity regularizers inspired by determinantal point processes and entropy maximization. Notably, ARMOURED does not rely on generating adversarial samples during training. We demonstrate the robustness of ARMOURED on CIFAR-10 and SVHN datasets against state-of-the-art benchmarks in both the adversarial robust training and the semi-supervised training domains. Experimental results show that under projected gradient descent attacks with bounded $\ell_{\infty}$ norm, ARMOURED achieves substantial gains in accuracy, while maintaining high accuracy on clean samples.
Code (0)
등록된 구현이 없습니다.
Tasks
DiversityMULTI-VIEW LEARNINGPoint ProcessesSimilar Papers 제목 키워드 기반
Analytical Formula for Calculations of Armour Losses in Three-Core Power Cables
Over the past decade, significant progress has been made in the field of loss and rating calculations for armoured three-core cables. This development was prompted by an industry realization that the applicable internati…
Armoured Fighting Vehicle Team Performance Prediction against Missile Attacks with Directed Energy Weapons
A recent study has introduced a procedure to quantify the survivability of a team of armoured fighting vehicles when it is subjected to a single missile attack. In particular this study investigated the concept of collab…
On the Adversarial Robustness of Causal Algorithmic Recourse
Algorithmic recourse seeks to provide actionable recommendations for individuals to overcome unfavorable classification outcomes from automated decision-making systems. Recourse recommendations should ideally be robust t…
Adversarial RobustnessDecision MakingAdversarially Robust Generalization Just Requires More Unlabeled Data
Neural network robustness has recently been highlighted by the existence of adversarial examples. Many previous works show that the learned networks do not perform well on perturbed test data, and significantly more labe…
A Kernel Perspective for Regularizing Deep Neural Networks
We propose a new point of view for regularizing deep neural networks by using the norm of a reproducing kernel Hilbert space (RKHS). Even though this norm cannot be computed, it admits upper and lower approximations lead…