Exploring Adversarial Robustness of Deep Metric Learning

• Main Authors: Panum, Thomas Kobber, Wang, Zi, Kan, Pengyu, Fernandes, Earlence, Jha, Somesh
• Format: Article in Journal/Newspaper
• Language: unknown
• Published: arXiv 2021
• Subjects: Machine Learning cs.LG; Artificial Intelligence cs.AI; FOS Computer and information sciences; DML
• Online Access: https://dx.doi.org/10.48550/arxiv.2102.07265; https://arxiv.org/abs/2102.07265

Deep Metric Learning (DML), a widely-used technique, involves learning a distance metric between pairs of samples. DML uses deep neural architectures to learn semantic embeddings of the input, where the distance between similar examples is small while dissimilar ones are far apart. Although the underlying neural networks produce good accuracy on naturally occurring samples, they are vulnerable to adversarially-perturbed samples that reduce performance. We take a first step towards training robust DML models and tackle the primary challenge of the metric losses being dependent on the samples in a mini-batch, unlike standard losses that only depend on the specific input-output pair. We analyze this dependence effect and contribute a robust optimization formulation. Using experiments on three commonly-used DML datasets, we demonstrate 5-76 fold increases in adversarial accuracy, and outperform an existing DML model that sought out to be robust.