Analyzing Federated Learning through an Adversarial Lens

Analyzing Federated Learning through an Adversarial Lens

Arjun Nitin Bhagoji Contact:; Work done while at I.B.M. T.J. Watson Research Center Department of Electrical Engineering, Princeton University Supriyo Chakraborty I.B.M T.J. Watson Research Center Prateek Mittal Department of Electrical Engineering, Princeton University Seraphin Calo I.B.M T.J. Watson Research Center

Federated learning distributes model training among a multitude of agents, who, guided by privacy concerns, perform training using their local data but share only model parameter updates, for iterative aggregation at the server. In this work, we explore the threat of model poisoning attacks on federated learning initiated by a single, non-colluding malicious agent where the adversarial objective is to cause the model to mis-classify a set of chosen inputs with high confidence. We explore a number of strategies to carry out this attack, starting with simple boosting of the malicious agent’s update to overcome the effects of other agents’ updates. To increase attack stealth, we propose an alternating minimization strategy, which alternately optimizes for the training loss and the adversarial objective. We follow up by using parameter estimation for the benign agents’ updates to improve on attack success. Finally, we use a suite of interpretability techniques to generate visual explanations of model decisions for both benign and malicious models, and show that the explanations are nearly visually indistinguishable. Our results indicate that even a highly constrained adversary can carry out model poisoning attacks while simultaneously maintaining stealth, thus highlighting the vulnerability of the federated learning setting and the need to develop effective defense strategies.

1 Introduction

Federated learning introduced by McMahan et al. [12] has recently emerged as a popular implementation of distributed stochastic optimization for large-scale deep neural network training. It is formulated as a multi-round strategy in which the training of a neural network model is distributed between multiple agents. In each round, a random subset of agents, with local data and computational resources, is selected for training. The selected agents perform model training and share only the parameter updates with a centralized parameter server, that facilitates aggregation of the updates. Motivated by privacy concerns, the server is designed to have no visibility into an agents’ local data and training process. The aggregation algorithm is agnostic to the data distribution at the agents.

In this work, we exploit this lack of transparency in the agent updates, and explore the possibility of a single malicious agent performing a model poisoning attack. The malicious agent’s objective is to cause the jointly trained global model to misclassify a set of chosen inputs with high confidence, i.e., it seeks to introduce a targeted backdoor in the global model. In each round, the malicious agent generates its update by optimizing for a malicious objective different than the training loss for federated learning. It aims to achieve this by generating its update by directly optimizing for the malicious objective. However, the presence of a multitude of other agents which are simultaneously providing updates makes this challenging. Further, the malicious agent must ensure that its update is undetectable as aberrant.

Contributions: To this end, we propose a sequence of model poisoning attacks, with the aim of achieving the malicious objective while maintaining attack stealth. For each strategy, we consider both attack strength as well as stealth. We start with malicious update boosting, designed to negate the combined effect of the benign agents, which enables the adversary to achieve its malicious objective with 100% confidence. However, we show that boosted updates can be detected as aberrant using two measures of stealth, accuracy checking on the benign objective and parameter update statistics. Observing that the only parameter updates that need to be boosted are those that contribute to the malicious objective, we design an alternating minimization strategy that improves attack stealth. This strategy alternates between training loss minimization and the boosting of updates for the malicious objective and is able to achieve high success rate on both the benign and malicious objectives. In addition, we show that estimating the other agents’ updates improves attack success rates. Finally, we use a suite of interpretability techniques to generate visual explanations of the decisions made by a global model with and without a targeted backdoor. Interestingly, we observe that the explanations are nearly visually indistinguishable. This establishes the attack stealth along yet another axis of measurement and indicates that backdoors can be inserted without drastic changes in model focus at the input.

Summary of Empirical Results: In our experiments, we consider adversaries which only control a single malicious agent and at a given time step, have no visibility into the updates that will be provided by the other agents. We demonstrate that these adversaries can influence the global model to misclassify particular examples with high confidence. We work with both the Fashion-MNIST [23] and Adult Census111, datasets and for settings with both 10 and 100 agents, our attacks are able to ensure the global model misclassifies a particular example in a target class with 100% confidence. Our alternating minimization attack further ensures that the global model converges to the same test set accuracy as the case with no adversaries present. We also show that a simple estimation of the benign agents’ updates as being identical over two consecutive rounds aids in improving attack success.

Related Work: While data poisoning attacks [2, 17, 13, 22, 13, 10, 5, 8] have been widely studied, model poisoning attacks are largely unexplored. A number of works on defending against Byzantine adversaries consider a threat model where Byzantine agents send arbitrary gradient updates [3, 6, 14, 4, 24]. However, the adversarial goal in these cases is to ensure a distributed implementation of the Stochastic Gradient Descent (SGD) algorithm converges to ‘sub-optimal to utterly ineffective models’, quoting from Mhamdi et al. [14]. In complete constrast, our goal is to ensure convergence to models that are effective on the test set but misclassify certain examples. In fact, we show that the Byzantine-resilient aggregation mechanism ‘Krum’ from Blanchard et al. [3] is not resilient to our attack strategies (Appendix C). Concurrent work by Bagdarsyan et al. [1] considers multiple colluding agents performing poisoning via model replacement at convergence time. In contrast, our goal is to induce targeted misclassification in the global model by a single malicious agent even when it is far from convergence while maintaining its accuracy for most tasks. In fact, we show that updates generated by their strategy fail to achieve either malicious or benign objectives in the settings we consider.

2 Federated Learning and Model Poisoning

In this section, we formulate both the learning paradigm and the threat model that we consider throughout the paper. Operating in the federated learning paradigm, where model weights are shared instead of data, gives rise to the model poisoning attacks that we investigate.

2.1 Federated Learning

The federated learning setup consists of agents, each with access to data , where . The total number of samples is . Each agent keeps its share of the data (referred to as a shard) private, i.e. is not shared with the server . The objective of the server is to learn a global parameter vector , where is the dimensionality of the parameter space. This parameter vector minimizes the loss222approximately for non-convex loss functions since global minima cannot be guaranteed over and the aim is to generalize well over , the test data. Federated learning is designed to handle non-i.i.d partitioning of training data among the different agents.

At each time step , a random subset of agents is chosen for aggregation. Every agent , minimizes the empirical loss over its own data shard , by starting from the global weight vector and running an algorithm such as SGD for epochs with a batch size of . At the end of its run, each agent obtains a local weight vector and computes its local update , which is sent back to the server. To obtain the global weight vector for the next iteration, any aggregation mechanism can be used. Following McMahan et al. [12], we use synchronous training (i.e., server waits till it has received updates from all the agents selected for the time step) and weighted averaging based aggregation:

where and . We also experiment with the Byzantine-resilient aggregation mechanism ‘Krum’ [3]. Details are in Appendix C.

2.2 Threat Model: Model Poisoning

Traditional poisoning attacks deal with a malicious agent who poisons some fraction of the data in order to ensure that the learned model satisfies some adversarial goal. We consider instead an agent who poisons the model updates it sends back to the server. This attack is a plausible threat in the federated learning setting as the model updates from the agents can (i) directly influence the parameters of the global model via the aggregation algorithm; and (ii) display high variability, due to the non-i.i.d local data at the agents, making it harder to isolate the benign updates from the malicious ones.

Adversary Model: We make the following assumptions regarding the adversary: (i) there is exactly one non-colluding, malicious agent with index (limited effect of malicious updates on the global model); (ii) the data is distributed among the agents in an i.i.d fashion (making it easier to discriminate between benign and possible malicious updates and harder to achieve attack stealth); (iii) the malicious agent has access to a subset of the training data as well as to auxiliary data drawn from the same distribution as the training and test data that are part of its adversarial objective. Our aim is to explore the possibility of a successful model poisoning attack even for a highly constrained adversary.

A malicious agent can have one of two objectives with regard to the loss and/or classification of a data subset at any time step in the model poisoning setting:
1. Increase the overall loss: In this case, the malicious agent wishes to increase the overall loss on a subset of the data. The adversarial objective is in this setting is where is an appropriately defined loss function. This objective corresponds to the malicious agent attempting to cause untargeted misclassification.
2. Obtain desired classification outcome: The malicious agent has data samples with true labels that have to be classified as desired target classes , implying that the adversarial objective is This corresponds to a targeted misclassification attempt by the malicious agent.

In this paper, we will focus on malicious agents trying to attain the second objective, i.e. targeted misclassification. At first glance, the problem seems like a simple one for the malicious agent to solve. However, it does not have access to the global parameter vector for the current iteration as is the case in standard poisoning attacks [16, 10] and can only influence it though the weight update it provides to the server . The simplest formulation of the optimization problem the malicious agent has to solve such that her objective is achieved on the iteration is then


2.3 Experimental setup

In order to illustrate how our attack strategies work with actual data and models, we use two qualitatively different datasets. The first is an image dataset, Fashion-MNIST 333Serves as a drop-in replacement for the commonly used MNIST dataset [11], which is not representative of modern computer vision tasks [23] which consists of grayscale images of clothing and footwear items and has output classes. The training set contains 60,000 data samples while the test set has 10,000 samples. We use a Convolutional Neural Network achieving 91.7% accuracy on the test set for the model architecture.

The second dataset is the UCI Adult dataset444, which has over 40,000 samples containing information about adults from the 1994 US Census. The classification problem is to determine if the income for a particular individual is greater (class ‘0’) or less (class ‘1’) than a year. For this dataset, we use a fully connected neural network achieving 84.8% accuracy on the test set [7] for the model architecture. All results for this dataset are in Appendix A.1.

For both datasets, we study the case with the number of agents set to 10 and 100. When , all the agents are chosen at every iteration, while with , a tenth of the agents are chosen at random every iteration. We run federated learning till a pre-specified test accuracy (91% for Fashion MNIST and 84% for the Adult Census data) is reached or the maximum number of time steps have elapsed (40 for and 50 for ). For most of our experiments, we consider the case when , which implies that the malicious agent aims to misclassify a single example in a desired target class. For both datasets, a random sample from the test set is chosen as the example to be misclassified. For the Fashion-MNIST dataset, the sample belongs to class ‘5’ (sandal) with the aim of misclassifying it in class ‘7’ (sneaker) and for the Adult dataset it belongs to class ‘0’ with the aim of misclassifying it in class ‘1’.

3 Strategies for Model Poisoning attacks

We begin by investigating baseline attacks which do not conform to any notion of stealth. We then show how simple detection methods at the server may expose the malicious agent and explore the extent to which modifications to the baseline attack can bypass these methods.

3.1 Limited information poisoning objective

In order to solve the exact optimization problem needed to achieve their objective, the malicious agent needs access to the current value of the overall parameter vector , which is inaccessible. This occurs due to the nature of the federated learning algorithm, where computes once it has received updates from all agents. In this case, they have to optimize over an estimate of the value of :


where is an estimator for based on all the information available to the adversary. We refer to this as the limited information poisoning objective. The problem of choosing a good estimator is deferred to Section 4 and the strategies discussed in the remainder of this section make the assumption that . In other words, the malicious agent ignores the effects of other agents. As we shall see, this assumption is often enough to ensure the attack works in practice. attack (Fashion MNIST)TimeSimultaneous training (Fashion MNIST) Acc. MalAcc. GlobalConf. Global (57)
(a) Metrics of interest for baseline (left) and simultaneous training attacks (right). Unified legend in right plot.
(b) Baseline attack weight update distribution at .
(c) Simultaneous training weight update distribution at .
Figure 1: Metrics of interest and representative weight update distributions for the baseline and simultaneous training attacks. Figures (b)b and (c)c show weight update distributions for both benign (left) and malicious agents (right).

3.2 Baseline attack

Using the approximation that , the malicious agent just has to meet the adversarial objective . Depending on the exact structure of the loss, an appropriate optimizer can be chosen. For our experiments, we will rely on gradient-based optimizers such as SGD which work well for neural networks. In order to overcome the effect of scaling by at the server, the final update that is returned, has to be boosted.

3.2.1 Explicit Boosting

Mimicking a benign agent, the malicious agent can run steps of a gradient-based optimizer starting from to obtain which minimizes the loss over . The malicious agent then obtains an initial update . However, since the malicious agent’s update tries to ensure that the model learns labels different from the true labels for the data of its choice (), it has to overcome the effect of scaling, which would otherwise mostly nullify the desired classification outcomes. This happens because the learning objective for all the other agents is very different from that of the malicious agent, especially in the i.i.d. case. The final weight update sent back by the malicious agent is then , where is the factor by which the malicious agent boosts the initial update. Note that if the assumption holds, and , then , implying that the global weight vector should now satisfy the malicious agent’s objective. This method indirectly accounts for the presence of the other agents when using a boosting factor of .

TimeImplicit Boosting BaselineAcc. MalAcc. Global
Figure 2: Implicit boosting attack metrics

3.2.2 Implicit Boosting

While the loss is a function of a weight vector , we can use the chain rule to obtain the gradient of the loss with respect to the weight update , i.e. . Then, initializing to some appropriate , the malicious agent can directly minimize with respect to .

30354045505560657024681012TimeBaseline (Benign)Baseline (Malicious)Alt. Min. (Benign)Alt. Min. (Malicious)Alt. Min. w/ dist. (Benign)Alt. Min. w/ dist. (Malicious)
Figure 3: Minimum and maximum distances between weight updates. For each strategy, we show the spread of distances between all the benign agents and between the malicious agent and the benign agents. Going from the baseline attack to the alternating minimization attack with and without distance constraints, we see that the gap in the spread of distances reduces, making the attack stealthier. The benign agents behave almost identically across strategies, indicating that the malicious agent does not interfere much with their training.

3.2.3 Results

In the attack with explicit boosting, the malicious agent runs steps of the Adam optimizer [9] to obtain , and then boosts it by . The results for the case with are shown in the plot on the left in Figure (a)a. The attack is clearly successful at causing the global model to classify the chosen example in the target class. In fact, after , the global model is highly confident in its (incorrect) prediction. The baseline attack using implicit boosting (Figure 2) is much less successful than the explicit boosting baseline, with the adversarial objective only being achieved in 4 of 10 iterations. Further, it is computationally more expensive, taking an average of steps to converge at each time step, which is about longer than a benign agent. Since consistently delayed updates from the malicious agent might lead to it being dropped from the system in practice, we focus on explicit boosting attacks for the remainder of the paper as they do not add as much overhead.

3.3 Measuring attack stealth at server

While the baseline attack is successful at meeting the malicious agent’s objective, there are detection methods the server can employ in order to detect if an agent’s update is malicious. We now discuss a few possible methods and their implication for the baseline attack. We note that none of these methods are part of the standard federated learning algorithm.

3.3.1 Accuracy checking

When any agent sends a weight update to the server, it can check the validation accuracy of , the model obtained by adding that update to the current state of the global model. If the resulting model has a validation accuracy much lower than that of the other agents, the server may be able to detect that model as coming from a malicious agent. This would be particularly effective in the case where the agents have i.i.d. data. In Figure (a)a, the left plot shows the accuracy of the malicious model on the validation data (Acc. Mal) at each iteration. This is much lower than the accuracy of the global model (Acc. Global) and is no better than random for the first few iterations.

3.3.2 Weight update statistics

There are both qualitative and quantitative methods the server can apply in order to detect weight updates which are malicious, or at the least, different from a majority of the other agents. We investigate the effectiveness of two such methods. The first, qualitative method, is the visualization of weight update distributions for each agent. Since the adversarial objective function is different from the training loss objective used by all the benign agents, we expect the distribution of weight updates to be very different. This is borne out by the weight update distribution observed for the baseline attack in Figure (b)b. Compared to the weight update from a benign agent, the update from the malicious agent is much sparser and has a smaller range. This difference is more pronounced for later time steps.

The second, quantitative method uses the spread of pairwise distances between weight update vectors to identify outliers. At each time step, the server computes the pairwise distances between all the weight updates it receives, and flags those weight updates which are either much closer or much farther away than the others. In Figure 3, the spread of distances between all benign updates and between the malicious update and the benign updates is plotted. For the baseline attack, both the minimum and maximum distance away from any of the benign updates keeps decreasing over time steps, while it remains relatively constant for the other agents. This can enable detection of the malicious agent.

3.4 Attack with simultaneous training

To bypass the two detection methods discussed in the previous section, the malicious agent can try to simultaneously optimize over the adversarial objective and training loss for its local data shard . The resulting objective function is then Note that for the training loss, the optimization is just performed with respect to , as a benign agent would do. When doing explicit boosting, is replaced by as well, and the initial weight update is boosted by before being sent to the server. This is the only attack strategy explored in concurrent and independent work by [1].

3.4.1 Results

In practice, we optimize over batches of and concatenate each batch with the single instance to be misclassified, ensuring that the adversarial objective is satisfied. In fact, as seen in Figure 1 in the plot on the right, the adversarial objective is satisfied with high confidence from the first time step .

Effect on stealth: Since the entire weight update corresponding to both adversarial and training objectives is boosted, the accuracy of on the validation is low throughout the federated learning process. Thus, this attack can easily be detected using the accuracy checking method. Further, while the weight update distribution for this attack (Figure (c)c) is visually similar to that of benign agents, its range differs, again enabling detection. optimization attackTimeAlt. optimization w/ distance constraint attackAcc. MalAcc. GlobalConf. Global (57)
(a) Metrics of interest for alternating minimization attack without (left) and with distance constraints(right).
(b) Alternating minimization attack weight update distribution at
(c) Alternating minimization attack with distance constraints weight update distribution at
Figure 4: Metrics of interest and representative weight update distributions for the alternating minimization attack with and without distance constraints.

3.5 Alternating Minimization formulation

The malicious agent only needs to boost the part of the weight update that corresponds to the adversarial objective. In the baseline attack, in spite of this being the entire update, the resulting distribution is sparse and of low magnitude compared to a benign agent’s updates. This indicates that the weights update needed to meet the adversarial objective could be hidden in an update that resembled that of a benign agent. However, as we saw in the previous section, boosting the entire weight update when the training loss is included leads to low validation accuracy. Further, the concatenation strategy does not allow for parts of the update corresponding to the two different objectives to be decoupled.

2:Malicious weight update
3:Set Initializing to current global weights
4:for  do
5:     Compute Minimizing malicious loss
6:     Set Explicit boosting
7:     Compute Minimizing training loss with distance constraints
8:     Set
9:end for
10:Set Retrieving overall update
Algorithm 1 Alternating Minimization attack algorithm with distance constraints

To overcome this, we propose an alternating minimization attack strategy which works as follows for iteration . For each epoch , the adversarial objective is first minimized starting from , giving an update vector . This is then boosted by a factor and added to . Finally, the training loss for that epoch is minimized starting from , providing the malicious weight vector for the next epoch. The malicious agent can run this alternating minimization for epochs, ensuring that both the adversarial objective and training loss have sufficiently low values. This attack strategy is described in Algorithm 1 with , i.e. no distance constraint imposed.

3.5.1 Results

In Figure (a)a, the plot on the left shows the evolution of the metrics of interest over iterations. The alternating minimization attack is able to achieve its goals as the accuracy of the malicious model closely matches that of the global model even as the adversarial objective is met with high confidence for all time steps starting from .

Effect on stealth: This attack can bypass the accuracy checking method as the accuracy on test data of the malicious model is close to that of the global model. Qualitatively, the distribution of the malicious weight update (Figure (b)b) is much more similar to that of the benign weights as compared to the baseline attack. Further, in Figure 3, we can see that the spread in distances between the malicious updates and benign updates much closer to that between benign agents compared to the baseline attack. Thus, this attack is stealthier than the baseline.

3.6 Constraining the weight update

To increase the attack stealth, the malicious agent can also add a distance-based constraint on , which is the weight update generated in the alternating minimization strategy at the end of the training loss minimization phase. There could be multiple local minima which lead to low training loss, but the malicious agent needs to send back a weight update that is as close as possible (in an appropriate distance metric ) to the update they would have sent had they been benign or to the overall global weight vector. Thus, we can constrain with respect to , obtained by minimizing the training loss over starting from , i.e. with the malicious agent mimicking a benign one. Another possibility is to just ensure that is as close as possible to (i.e. ), which we find to be more effective in practice. This strategy is detailed in Algorithm 1.

For our experiments, we use the norm as a constraint on , the weight vector obtained, so is added to the loss function. Constraints based on the empirical distribution of weights such as the Wasserstein or total variation distances may also be used.

3.6.1 Results and effect on stealth

The adversarial objective is achieved at the global model with high confidence starting from time step and the success of the malicious model on the benign objective closely tracks that of the global model throughout. The weight update distribution for this attack (Figure (c)c) is again similar to that of a benign agent. Further, in Figure 3, we can see that the distance spread for this attack closely follows and even overlaps that of benign updates throughout, making it hard to detect using the distance metric.

4 Improving attack performance through estimation

In this section, we look at how the malicious agent can choose a better estimate for the effect of the other agents’ updates at each time step that it is chosen. In the case when the malicious agent is not chosen at every time step, this estimation is made challenging by the fact that it may not have been chosen for many iterations.

4.1 Estimation setup

The malicious agent’s goal is to choose an appropriate estimate for from Eq. 1. At a time step when the malicious agent is chosen, the following information is available to them from the previous time steps they were chosen: i) Global parameter vectors ; ii) Malicious weight updates ; and iii) Local training data shard , where is the first time step at which the malicious agent is chosen. Given this information, the malicious agent computes an estimate which it can use to correct for the effect of other agents in two ways:

1. Post-optimization correction: In this method, once the malicious agent computes its weight update , it subtracts from it before sending it to the server. If and , this will negate the effects of other agents.

2. Pre-optimization correction: Here, the malicious agent assumes that . In other words, the malicious agent optimizes for assuming it has an accurate estimate of the other agents’ updates. For attacks which use explicit boosting, this involves starting from instead of just . attack (estimation)TimeAlt. optimization attack (estimation)Acc. MalAcc. GlobalConf. Global (57)
Figure 5: Metrics of interest for the baseline and alternating minimization attacks with explicit boosting and previous step estimation.

4.2 Estimation strategies and results

When the malicious agent is chosen at time step 555If they are chosen at or is the first time they are chosen, there is no information available regarding the other agents’ updates, information regarding the probable updates from the other agents can be obtained from the previous time steps at which the malicious agent was chosen.

4.2.1 Previous step estimate

In this method, the malicious agent’s estimate assumes that the other agents’ cumulative updates were the same at each step since (the last time step at which at the malicious agent was chosen), i.e. In the case when the malicious agent is chosen at every time step, this reduces to . This estimate can be applied to both the pre- and post-optimization correction methods.

4.2.2 Results

Attacks using previous step estimation with the pre-optimization correction are more effective at achieving the adversarial objective for both the baseline and alternating minimization attacks. In Figure 5, the global model misclassifies the desired sample with a higher confidence for both the baseline and alternating minimization attacks at . The post-optimization correction method with previous step estimation has worse performance for both the baseline and alternating minimization attacks compared to the case with no estimation.

5 Interpreting poisoned models

(a) Benign model decision visualization for auxiliary data sample
(b) Malicious model decision visualization for auxiliary data sample
Figure 6: Decision visualizations for benign and malicious models

Neural networks are often treated as black boxes with little transparency into their internal representation or understanding of the underlying basis for their decisions. Interpretability techniques are designed to alleviate these problems by analyzing various aspects of the network. These include (i) identifying the relevant features in the input pixel space for a particular decision via Layerwise Relevance Propagation (LRP) techniques ([15]); (ii) visualizing the association between neuron activations and image features (Guided Backprop ([20]), DeConvNet ([25])); (iii) using gradients for attributing prediction scores to input features (e.g., Integrated Gradients ([21]), or generating sensitivity and saliency maps (SmoothGrad ([19]), Gradient Saliency Maps ([18])) and so on. The semantic relevance of the generated visualization, relative to the input, is then used to explain the model decision.

These interpretability techniques, in many ways, provide insights into the internal feature representations and working of a neural network. Therefore, we used a suite of these techniques to try and discriminate between the behavior of a benign global model and one that has been trained to satisfy the adversarial objective of misclassifying a single example. Figure 6 compares the output of the various techniques for both the benign and malicious models on a random auxiliary data sample. Targeted perturbation of the model parameters coupled with tightly bounded noise ensures that the internal representations, and relevant input features used by the two models, for the same input, are almost visually imperceptible. This reinforces the stealth achieved by our attacks along with respect to another measure of stealth, namely various interpretability-based detection techniques.

6 Discussion

In this paper, we have started an exploration of the vulnerability of multi-party machine learning algorithms such as federated learning to model poisoning adversaries, who can take advantage of the very privacy these models are designed to provide. In future work, we plan to explore more sophisticated detection strategies at the server, which can provide guarantees against the type of attacker we have considered here. In particular, notions of distances between weight distributions are promising defensive tools. Our attacks in this paper demonstrate that federated learning in its basic form is very vulnerable to model poisoning adversaries. While detection mechanisms can make these attacks more challenging, these can be overcome, demonstrating that multi-party machine learning algorithms robust to attackers of the type considered here must be developed.


  • [1] E. Bagdasaryan, A. Veit, Y. Hua, D. Estrin, and V. Shmatikov. How to backdoor federated learning. arXiv preprint arXiv:1807.00459, 2018.
  • [2] B. Biggio, B. Nelson, and P. Laskov. Poisoning attacks against support vector machines. In Proceedings of the 29th International Conference on Machine Learning (ICML-12), pages 1807–1814, 2012.
  • [3] P. Blanchard, E. M. El Mhamdi, R. Guerraoui, and J. Stainer. Machine learning with adversaries: Byzantine tolerant gradient descent. Advances in Neural Information Processing Systems, 2017.
  • [4] L. Chen, H. Wang, Z. B. Charles, and D. S. Papailiopoulos. DRACO: byzantine-resilient distributed training via redundant gradients. In Proceedings of the 35th International Conference on Machine Learning, ICML, 2018.
  • [5] X. Chen, C. Liu, B. Li, K. Lu, and D. Song. Targeted backdoor attacks on deep learning systems using data poisoning. arXiv preprint arXiv:1712.05526, 2017.
  • [6] Y. Chen, L. Su, and J. Xu. Distributed statistical machine learning in adversarial settings: Byzantine gradient descent. Proc. ACM Meas. Anal. Comput. Syst., 1(2), 2017.
  • [7] M. Fernández-Delgado, E. Cernadas, S. Barro, and D. Amorim. Do we need hundreds of classifiers to solve real world classification problems? The Journal of Machine Learning Research, 15(1):3133–3181, 2014.
  • [8] M. Jagielski, A. Oprea, B. Biggio, C. Liu, C. Nita-Rotaru, and B. Li. Manipulating machine learning: Poisoning attacks and countermeasures for regression learning. In IEEE Security and Privacy, 2018.
  • [9] D. P. Kingma and J. Ba. Adam: A method for stochastic optimization. In International Conference on Learning Representations, 2015.
  • [10] P. W. Koh and P. Liang. Understanding black-box predictions via influence functions. In ICML, 2017.
  • [11] Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner. Gradient-based learning applied to document recognition. Proceedings of the IEEE, 86(11):2278–2324, 1998.
  • [12] B. McMahan, E. Moore, D. Ramage, S. Hampson, and B. A. y Arcas. Communication-Efficient Learning of Deep Networks from Decentralized Data. In Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, 2017.
  • [13] S. Mei and X. Zhu. Using machine teaching to identify optimal training-set attacks on machine learners. In AAAI, 2015.
  • [14] E. M. E. Mhamdi, R. Guerraoui, and S. Rouault. The hidden vulnerability of distributed learning in byzantium. In ICML, 2018.
  • [15] G. Montavon, S. Bach, A. Binder, W. Samek, and K. Müller. Explaining nonlinear classification decisions with deep taylor decomposition. arXiv preprint arXiv:1512.02479, 2015.
  • [16] L. Muñoz-González, B. Biggio, A. Demontis, A. Paudice, V. Wongrassamee, E. C. Lupu, and F. Roli. Towards poisoning of deep learning algorithms with back-gradient optimization. In Proceedings of the 10th ACM Workshop on Artificial Intelligence and Security. ACM, 2017.
  • [17] B. I. Rubinstein, B. Nelson, L. Huang, A. D. Joseph, S.-h. Lau, S. Rao, N. Taft, and J. Tygar. Stealthy poisoning attacks on pca-based anomaly detectors. ACM SIGMETRICS Performance Evaluation Review, 37(2):73–74, 2009.
  • [18] K. Simonyan, A. Vedaldi, and A. Zisserman. Deep inside convolutional networks: Visualising image classification models and saliency maps. arXiv preprint arXiv:1312.6034, 2013.
  • [19] D. Smilkov, N. Thorat, B. Kim, F. B. Viégas, and M. Wattenberg. Smoothgrad: removing noise by adding noise. arXiv preprint arXiv:1706.03825, 2017.
  • [20] J. T. Springenberg, A. Dosovitskiy, T. Brox, and M. A. Riedmiller. Striving for simplicity: The all convolutional net. arXiv preprint arXiv:1412.6806, 2014.
  • [21] M. Sundararajan, A. Taly, and Q. Yan. Axiomatic attribution for deep networks. arXiv preprint arXiv:1703.01365, 2017.
  • [22] H. Xiao, B. Biggio, G. Brown, G. Fumera, C. Eckert, and F. Roli. Is feature selection secure against training data poisoning? In ICML, 2015.
  • [23] H. Xiao, K. Rasul, and R. Vollgraf. Fashion-mnist: a novel image dataset for benchmarking machine learning algorithms. arXiv preprint arXiv:1708.07747, 2017.
  • [24] D. Yin, Y. Chen, K. Ramchandran, and P. Bartlett. Byzantine-robust distributed learning: Towards optimal statistical rates. arXiv preprint arXiv:1803.01498, 2018.
  • [25] M. Zeiler and R. Fergus. Visualizing and understanding convolutional networks. In Computer Vision, ECCV 2014 - 13th European Conference, Proceedings, 2014.

Appendix A Further results

a.1 Results on Adult Census dataset (Census)Acc. MalAcc. GlobalConf. Global (01)TimeConcatenated training (Census)TimeAlternating minimization (Census)TimeAlt. min. w/ distance constraints (Census)
Figure 7: Metrics of interest for 4 different attack strategies with the Adult Census dataset.

Results for the 4 different attack strategies on the Adult Census dataset (Figure 7) confirm the broad conclusions we derived from the Fashion MNIST data. The baseline attack is able to induce high confidence targeted misclassification for a random test example but affects performance on the benign objective, which drops from 84.8% in the benign case to just around 80%. The alternating minimization attack is able to ensure misclassification with a confidence of around 0.7 while maintaining 84% accuracy on the benign objective.

a.2 Randomized agent selection

When the number of agents increases to , the malicious agent is not selected in every step. Further, the size of decreases, which makes the benign training step in the alternating minimization attack more challenging. The challenges posed in this setting are reflected in Figure 8, where although the baseline attack is able to introduce a targeted backdoor, it cannot ensure it for every step due to steps where only benign agents provide updates. The alternating minimization attack is also able to introduce the backdoor, as well as increase the classification accuracy of the malicious model on test data. However, the improvement in performance is limited by the paucity of data for the malicious agent. It is an open question if data augmentation could help improve this accuracy. attack ()TimeAlt. optimization attack ()Acc. MalAcc. GlobalConf. Global (57)
Figure 8: Metrics of interest for the baseline and alternating minization attack with agents for the Fashion-MNIST dataset.

Appendix B Visualization of weight update distributions

Figure B shows the evolution of weight update distributions for the 4 different attack strategies on the CNN trained on the Faishon MNIST dataset. Time slices of this evolution were shown in the main text of the paper. The baseline and concatenated training attacks lead to weight update distributions that differ widely for benign and malicious agents. The alternating minimization attack without distance constraints reduces this qualitative difference somewhat but the closest weight update distributions are obtained with the alternating minimization attack with distance constraints.

(a) Baseline attack weight update distribution
(b) Simultaneous training weight update distribution
(c) Alternating minimization attack weight update distribution
(d) Alternating minimization attack with distance constraints weight update distribution
Figure 9: Weight update distribution evolution over time for all attacks on a CNN for the Fashion MNIST dataset.

Appendix C Bypassing Byzantine-resilient aggregation mechanisms

[3] recently proposed a gradient aggregation mechanism known as ‘Krum’ that is provably resilient to Byzantine adversaries. We choose to evaluate Krum as it is efficient, provably resilient and can be used a building block for better mechanisms [14]. As stated in the introduction, the aim of Byzantine adversaries considered in this work and others ([6, 14, 4, 24]) is to ensure convergence to ineffective models. The goals of the adversary in this paper are to ensure convergence to effective models with targeted backdoors. This difference in objectives leads to ‘Krum’ being ineffective against our attacks.

We now briefly describe Krum. Given agents of which are Byzantine, Krum requires that . At any time step , updates are received at the server. For each , the closest (in terms of norm) other updates are chosen to form a set and their distances added up to give a score . Krum then chooses with the lowest score to add to to give .

In Figure 10, we see the effect of our attack strategies on Krum with a boosting factor of for a federated learning setup with 10 agents. Since there is no need to overcome the constant scaling factor , the attacks can use a much smaller boosting factor to ensure the global model has the targeted backdoor. Even with the baseline attack, the malicious agent’s update is the one chosen by Krum for 34 of 40 time steps but the global model is unable to attain high test accuracy. The alternating minimization attack ensures that the global model maintains relatively high test accuracy while the malicious agent is chosen for 26 of 40 time steps. These results conclusively demonstrate the effectiveness of model poisoning attacks against Krum. (2.0), Krum (Fashion MNIST)Acc. MalAcc. GlobalConf. Global (01)TimeAlt. training (2.0), Krum (Fashion MNIST)
Figure 10: Metrics of interest for 2 different attack strategies with the Krum aggregation mechanism.

Appendix D Interpretability for benign inputs

We provide additional interpretability results for the benign and malicious models on benign data in Figures 11 and 12 respectively. These show that the presence of the malicious agent (even just using the baseline attack) does not significantly affect how the global model makes decisions on benign data.

Figure 11: Decision visualizations for global model trained using only benign agents on benign data.
Figure 12: Decision visualizations for global model trained using 9 benign agents and 1 malicious agent using the baseline attack on benign data.
Comments 0
Request Comment
You are adding the first comment!
How to quickly get a good reply:
  • Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
  • Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
  • Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
The feedback must be of minimum 40 characters and the title a minimum of 5 characters
Add comment
Loading ...
This is a comment super asjknd jkasnjk adsnkj
The feedback must be of minumum 40 characters
The feedback must be of minumum 40 characters

You are asking your first question!
How to quickly get a good answer:
  • Keep your question short and to the point
  • Check for grammar or spelling errors.
  • Phrase it like a question
Test description