user: text: Write a concise one-sentence TLDR summary of the scientific paper content below.

Title: Adversarial Imitation Attack

Paper content:
Deep learning models are known to be vulnerable to adversarial examples.
A practical adversarial attack should require as little as possible knowledge of attacked models T. Current substitute attacks need pre-trained models to generate adversarial examples and their attack success rates heavily rely on the transferability of adversarial examples.
Current score-based and decision-based attacks require lots of queries for the T. In this study, we propose a novel adversarial imitation attack.
First, it produces a replica of the T by a two-player game like the generative adversarial networks (GANs).
The objective of the generative model G is to generate examples which lead D returning different outputs with T. The objective of the discriminative model D is to output the same labels with T under the same inputs.
Then, the adversarial examples generated by D are utilized to fool the T. Compared with the current substitute attacks, imitation attack can use less training data to produce a replica of T and improve the transferability of adversarial examples.
Experiments demonstrate that our imitation attack requires less training data than the black-box substitute attacks, but achieves an attack success rate close to the white-box attack on unseen data with no query.
Deep neural networks are often vulnerable to imperceptible perturbations of their inputs, causing incorrect predictions (Szegedy et al., 2014) .
Studies on adversarial examples developed attacks and defenses to assess and increase the robustness of models, respectively.
Adversarial attacks include white-box attacks, where the attack method has full access to models, and black-box attacks, where the attacks do not need knowledge of models structures and weights.
White-box attacks need training data and the gradient information of models, such as FGSM (Fast Gradient Sign Method) (Goodfellow et al., 2015) , BIM (Basic Iterative Method) (Kurakin et al., 2017a) and JSMA (Jacobian-based Saliency Map Attack) (Papernot et al., 2016b) .
However, the gradient information of attacked models is hard to access, the white-box attack is not practical in real-world tasks.
Literature shows adversarial examples have transferability property and they can affect different models, even the models have different architectures (Szegedy et al., 2014; Papernot et al., 2016a; Liu et al., 2017) .
Such a phenomenon is closely related to linearity and over-fitting of models (Szegedy et al., 2014; Hendrycks & Gimpel, 2017; Goodfellow et al., 2015; Tramèr et al., 2018) .
Therefore, substitute attacks are proposed to attack models without the gradient information.
Substitute black-box attacks utilize pre-trained models to generate adversarial examples and apply these examples to attacked models.
Their attack success rates rely on the transferability of adversarial examples and are often lower than that of white-box attacks.
Black-box score-based attacks Ilyas et al., 2018a; b) do not need pre-trained models, they access the output probabilities of the attacked model to generate adversarial examples iteratively.
Black-box decisionbased attacks (Brendel et al., 2017; Cheng et al., 2018; Chen et al., 2019) require less information than the score-based attacks.
They utilize hard labels of the attacked model to generate adversarial examples.
Adversarial attacks need knowledge of models.
However, a practical attack method should require as little as possible knowledge of attacked models, which include training data and procedure, models weights and architectures, output probabilities and hard labels (Athalye et al., 2018) .
The disadvantage of current substitute black-box attacks is that they need pre-trained substitute models trained by the same dataset with attacked model T (Hendrycks & Gimpel, 2017; Goodfellow et al., 2015; Kurakin et al., 2017a) or a number of images to imitate the outputs of T to produce substitute networks .
Actually, the prerequisites of these attacks are hard to obtain in real-world tasks.
The substitute models trained by limited images hardly generate adversarial examples with well transferability.
The disadvantage of current decision-based and score-based black-box attacks is that every adversarial example is synthesized by numerous queries.
Hence, developing a practical attack mechanism is necessary.
In this paper, we propose an adversarial imitation training, which is a special two-player game.
The game has a generative model G and a imitation model D. The G is designed to produce examples to make the predicted label of the attacked model T and D different, while the imitation model D fights for outputting the same label with T .
The proposed imitation training needs much less training data than the T and does not need the labels of these data, and the data do not need to coincide with the training data.
Then, the adversarial examples generated by D are utilized to fool the T like substitute attacks.
We call this new attack mechanism as adversarial imitation attack.
Compared with current substitute attacks, our adversarial imitation attack requires less training data.
Score-based and decision-based attacks need a lot of queries to generate each adversarial attack.
The similarity between the proposed method and current score-based and decision-based attacks is that adversarial imitation attack also needs to obtain a lot of queries in the training stage.
The difference between these two kinds of attack is our method do not need any additional queries in the test stage like other substitute attacks.
Experiments show that our proposed method achieves state-of-the-art performance compared with current substitute attacks and decision-based attack.
We summarize our main contributions as follows:
• The proposed new attack mechanism needs less training data of attacked models than current substitute attacks, but achieves an attack success rate close to the white-box attacks.
• The proposed new attack mechanism requires the same information of attacked models with decision attacks on the training stage, but is query-independent on the testing stage.
Practical adversarial attacks should have as little as possible knowledge of attacked model T .
Current black-box attacks need numerous training images or queries to generate adversarial images.
In this study, to address this problem, we combine the advantages of current black-box attacks and proposed a new attack mechanism, imitation attack, to replicate the information of the T , and generate adversarial examples fooling deep learning models efficiently.
Compared with substitute attacks, imitation attack only requires much less data than the training set of T and do not need the labels of the training data, but adversarial examples generated by imitation attack have stronger transferability for the T .
Compared with score-based and decision-based attacks, our imitation attack only needs the same information with decision attacks, but achieves state-of-the-art performances and is query-independent on testing stage.
Experiments showed the superiority of the proposed imitation attack.
Additionally, we observed that deep learning classification model T is easy to be stolen by limited unlabeled images, which are much fewer than the training images of T .
In future work, we will evaluate the performance of the proposed adversarial imitation attack on other tasks except for image classification.
A NETWORK ARCHITECTURES Figure 2 and Figure 3 .
The experiments show that adversarial examples generated by the proposed imitation attack can fool the attacked model with a small perturbation.

assistant: text: A novel adversarial imitation attack to fool machine learning models.