**Fast Minimum-Norm Attack**, or **FNM**, is a type of adversarial attack that works with different $\ell_{p}$-norm perturbation models ($p=0,1,2,\infty$), is robust to hyperparameter choices, does not require adversarial starting points, and converges within few lightweight steps. It works by iteratively finding the sample misclassified with maximum confidence within an $\ell_{p}$-norm constraint of size $\epsilon$, while adapting $\epsilon$ to minimize the distance of the current sample to the decision boundary.

AGCN is a novel spectral graph convolution network that feed on original data of diverse graph structures.

Image credit: [Adaptive Graph Convolutional Neural Networks](https://arxiv.org/pdf/1801.03226.pdf)

AGCN

Adaptive Graph Convolutional Neural Networks

Fast Minimum-Norm Attack

Fast Minimum-norm Adversarial Attacks through Adaptive Norm Constraints

**Mesh-TensorFlow** is a language for specifying a general class of distributed tensor computations. Where data-parallelism can be viewed as splitting tensors and operations along the "batch" dimension, in Mesh-TensorFlow, the user can specify any tensor dimensions to be split across any dimensions of a multi-dimensional mesh of processors. A MeshTensorFlow graph compiles into a SPMD program consisting of parallel operations coupled with collective communication primitives such as Allreduce.

Source	Fast Minimum-norm Adversarial Attacks through Adaptive Norm Constraints
Year	2000
Data Source	CC BY-SA - https://paperswithcode.com