Max-Mahalanobis Linear Discriminant Analysis Networks

Tianyu Pang, Chao Du, Jun Zhu
2/26/2018
cs.LG

Official code: P2333/Max-Mahalanobis-Training (90 stars, Apache-2.0, last commit 2020-12-21).

Abstract

A deep neural network (DNN) consists of a nonlinear transformation from an input to a feature representation, followed by a common softmax linear classifier. Though many efforts have been devoted to designing a proper architecture for nonlinear transformation, little investigation has been done on the classifier part. In this paper, we show that a properly designed classifier can improve robustness to adversarial attacks and lead to better prediction results. Specifically, we define a Max-Mahalanobis distribution (MMD) and theoretically show that if the input distributes as a MMD, the linear discriminant analysis (LDA) classifier will have the best robustness to adversarial examples. We further propose a novel Max-Mahalanobis linear discriminant analysis (MM-LDA) network, which explicitly maps a complicated data distribution in the input space to a MMD in the latent feature space and then applies LDA to make predictions. Our results demonstrate that the MM-LDA networks are significantly more robust to adversarial attacks, and have better performance in class-biased classification.

View on arXivView PDF

Code Implementations(1)

Apache-2.0

Max Mahalanobis Training (ICML 2018 + ICLR 2020)

9018MATLAB, PythonMar 13, 20195 years agoApache-2.0

Similar Papers

Cite this paper

@article{pang2018maxmahalanobis,
  title  = {Max-Mahalanobis Linear Discriminant Analysis Networks},
  author = {Tianyu Pang and Chao Du and Jun Zhu},
  year   = {2018},
  eprint = {1802.09308},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1802.09308}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1802.09308.svg)](https://codeofpaper.com/paper/1802.09308)

Discussion