Enhancing Adversarial Robustness for Deep Metric Learning
Mo Zhou, Vishal M. Patel

TL;DR
This paper introduces a novel adversarial training method for deep metric learning that manipulates triplet hardness levels to improve robustness and efficiency, outperforming existing defenses.
Contribution
It proposes Hardness Manipulation and Gradual Adversary techniques to enhance adversarial training, along with an Intra-Class Structure loss, offering a flexible and effective robustness improvement.
Findings
Outperforms state-of-the-art defenses in robustness and efficiency
Balances performance and robustness through gradual hardness increase
Enhances benign example performance with additional loss term
Abstract
Owing to security implications of adversarial vulnerability, adversarial robustness of deep metric learning models has to be improved. In order to avoid model collapse due to excessively hard examples, the existing defenses dismiss the min-max adversarial training, but instead learn from a weak adversary inefficiently. Conversely, we propose Hardness Manipulation to efficiently perturb the training triplet till a specified level of hardness for adversarial training, according to a harder benign triplet or a pseudo-hardness function. It is flexible since regular training and min-max adversarial training are its boundary cases. Besides, Gradual Adversary, a family of pseudo-hardness functions is proposed to gradually increase the specified hardness level during training for a better balance between performance and robustness. Additionally, an Intra-Class Structure loss term among benign…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdversarial Robustness in Machine Learning
