LEARNING ADVERSARIAL EXAMPLES WITH RIEMANNIAN GEOMETRY
Adversarial examples, referred to as augmented data points generated by imperceptible perturbation of input samples, have recently drawn much attention. Well-crafted adversarial examples may even mislead state-of-the-art deep models to make wrong predictions easily. To alleviate this problem, many studies focus on investigating how adversarial examples can be generated and/or resisted. All the existing work handles this problem in the Euclidean space, which may however be unable to describe data geometry. In this paper, we propose a generalized framework that addresses the learning problem of adversarial examples with Riemannian geometry. Specifically, we define the local coordinate systems on Riemannian manifold, develop a novel model called Adversarial Training with Riemannian Manifold, and design a series of theory that manages to learn the adversarial examples in the Riemannian space feasibly and efficiently. The proposed work is important in that (1) it is a generalized learning methodology since Riemmanian manifold space would be degraded to the Euclidean space in a special case; (2) it is the first work to tackle the adversarial example problem tractably through the perspective of geometry; (3) from the perspective of geometry, our method leads to the steepest direction of the loss function. We also provide a series of theory showing that our proposed method can truly find the decent direction for the loss function with a comparable computational time against traditional adversarial methods. Finally, the proposed framework demonstrates superior performance to the traditional counterpart methods on benchmark data including MNIST, CIFAR-10 and SVHN.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Parametric information geometry with the package Geomstats
We introduce the information geometry module of the Python package Geomstats. The module first implements Fisher-Rao Riemannian manifolds of widely used parametric families of probability distributions, such as normal, g…
Cortical Functional architectures as contact and sub-Riemannian geometry
In a joint paper, Jean Petitot together with the authors of the present paper described the functional geometry of the visual cortex as the symplectization of a contact form to describe the family of cells sensitive to p…
Positiongeomstats: a Python Package for Riemannian Geometry in Machine Learning
We introduce geomstats, a python package that performs computations on manifolds such as hyperspheres, hyperbolic spaces, spaces of symmetric positive definite matrices and Lie groups of transformations. We provide effic…
BIG-bench Machine LearningGPURiemannian optimizationGeoERM: Geometry-Aware Multi-Task Representation Learning on Riemannian Manifolds
Multi-Task Learning (MTL) seeks to boost statistical power and learning efficiency by discovering structure shared across related tasks. State-of-the-art MTL representation methods, however, usually treat the latent repr…
Activity RecognitionMulti-Task LearningRepresentation LearningNon-linear dimensionality reduction: Riemannian metric estimation and the problem of geometric discovery
In recent years, manifold learning has become increasingly popular as a tool for performing non-linear dimensionality reduction. This has led to the development of numerous algorithms of varying degrees of complexity tha…
Dimensionality Reduction