T OWARDS R OBUST M ODEL W ATERMARK VIA R EDUCING P ARAMETRIC V ULNERABILITY
Anonymous authors
Paper under double-blind review
A BSTRACT
Deep neural networks are valuable assets considering their commercial benefits and huge demands for costly annotation and computation resources.
To protect the copyright of these deep models, backdoor-based ownership verification becomes popular recently, in which the model owner can watermark the model by embedding a specific behavior before releasing it.
The defender (usually the model owner) can identify whether a suspicious third-party model is “stolen” from it based on the presence of the behavior.
Unfortunately, these watermarks are proven to be vulnerable to removal attacks even like fine-tuning.
To further explore this vulnerability, we investigate the parametric space and find there exist many watermark-removed models in the vicinity of the watermarked one, which may be easily used by removal attacks.
Inspired by this finding, we propose a minimax formulation to find these watermark-removed models and recover their watermark behavior.
Extensive experiments demonstrate that our method improves the robustness of the model watermarking against parametric changes and numerous watermark-removal attacks.
I NTRODUCTION
While deep neural networks (DNNs) achieve great success in many applications (Krizhevsky et al., 2012;
Devlin et al., 2018; Jumper et al., 2021) and bring substantial commercial benefits (Kepuska & Bohouta, 2018;
Chen et al., 2018; Grigorescu et al., 2020), training such a deep model usually requires a huge amount of well-annotated data, massive computational resources, and careful tuning of hyper-parameters.
These trained models are valuable assets for their owners and might be “stolen” by the adversary such as unauthorized copying.
We should properly protect these trained DNNs during model buying/selling 1 or limited open-sourcing ( e.g. , only for non-commercial purposes).
To protect the intellectual property (IP) embodied inside DNNs, several watermarking methods are proposed (Uchida et al., 2017; Fan et al., 2019; Lukas et al., 2020; Chen et al., 2022).
Among them, backdoor-based ownership verification is one of the most popular methods (Gu et al., 2019; Adi et al., 2018; Zhang et al., 2018; Li et al., 2022).
Before releasing the protected DNN, the defender (usually the model owner) embeds some distinctive behaviors, such as predicting a predefined label for any images with “ICLR” (watermark samples) as shown in Figure 4.
Based on the presence of these distinctive behaviors, the defender can determine whether a suspicious third-party DNN was “stolen” from the protected DNN.
The more likely a DNN predicts watermark samples as the predefined target label ( i.e. , with a higher watermark success rate), the more suspicious it is of being an unauthorized copy of the protected model.
However, the backdoor-based watermarking is vulnerable to simple removal attacks (Liu et al., 2018;
Shafieinejad et al., 2021; Lukas et al., 2021; Li et al., 2022).
For example, watermark behaviors can be easily erased by fine-tuning 2 with a medium learning rate like 0.01 (see Figure A17 in Zhao et al.
To explore such a vulnerability, considering that fine-tuning regards the watermarked model as the start point and continues to update its parameters on some clean data, we investigate how the watermark success rate (WSR) / benign accuracy (BA) changes in the vicinity of the watermarked
[Figure]
model in the parametric space.
For easier comparison, we use the relative distance ∥ θ − θ w ∥ /
∥ θ w ∥ in the parametric space, where θ w is the original watermarked model and corresponds to the origin in the coordinate axes (the black circle).
As shown in Figure 1, we find that fine-tuning on clean data (black circle → red star) changes the model with 0.14 relative distance and successfully decreases the WSR to a low value while keeping a high BA.
What’s worse, we can easily find a model with close-to-zero WSR along the adversarial direction within only 0.03 relative distance.
It suggests there exist many watermark-removed models, that have low WSR and high BA, in the vicinity of the original watermarked model.
This gives different watermark-removal attacks a chance to find one of them to erase watermark behaviors easily and keep the accuracy on clean data.
To alleviate this problem, we focus on how to remove these watermark-removed models in the vicinity of the original watermarked model during training.
Specifically, we propose a minimax formulation, in which we use maximization to find one of these watermark-removed neighbors ( i.e. , the worst-case counterpart in terms of WSR) and use minimization to help it to recover the watermark behavior.
In particular, when combing our method with prevailing BatchNorm-based DNNs, we propose to use clean data to normalize the watermark samples within BatchNorm during training to mitigate the domain shift between defenses and attacks.
Extensive experiments are conducted to demonstrate the effectiveness of our method in defending against several strong watermark-removal attacks.
Our main contributions are summarized as follows:
• We demonstrate that there exist many watermark-removed models in the vicinity of the watermarked model in the parametric space, which may be easily utilized by fine-tuning and other removal methods.
• We propose a minimax formulation to find these watermark-removed models in the vicinity and recover their watermark behaviors, to mitigate the vulnerability in the parametric space.
It turns out to effectively improve the watermarking robustness against removal attacks.
• We conduct extensive experiments against several state-of-the-art watermark-remove attacks to demonstrate the effectiveness of our method.
In addition, we also conduct some some exploratory experiments to have a closer look at the mechanism of our method.
R ELATED W ORKS
Model Watermark and Verification.
Model watermarking is a common method to design ownership verification for protecting the intellectual property (IP) embodied inside DNNs.
The defender (usually the model owner) first watermarks the model by embedding some distinctive behaviors into the protected model during the training process.
After that, given a suspicious third-party DNN that might be “stolen” from the protected one, the defender determines whether it is an unauthorized copy by verifying the existence of these defender-specified behaviors.
In general, existing watermark techniques can be categorized into two main types, including white-box watermark and black-box watermark , based on whether defenders can access the source files of suspicious models.
Currently, most of existing white-box methods (Uchida et al., 2017; Chen et al., 2019; Tartaglione et al., 2021) embed the watermark into specific weights or the model activation (Darvish Rouhani et al., 2019).
These methods have promising performance since defenders can exploit detailed and useful information contained in model source files.
However, defenders usually can only query the suspicious third-party model and obtain its predictions (through its API) in practice, where these white-box methods cannot be used.
In contrast, black-box methods only require model predictions.
Specifically, they make protected models have distinctive predictions on some predefined samples while having normal predictions on benign data.
For example, Zhang et al.
; Adi et al.
(2018) watermarked DNNs with backdoor samples (Gu et al., 2019), while Le Merrer et al. (2020); Lukas et al. (2020) exploited adversarial samples (Szegedy et al., 2013).
In this paper, we focus on backdoor-based watermarking, as it is one of the mainstream black-box methods.
Watermark-removal Attack.
Currently, there are some watermark-removal attacks to counter model watermarking.
According to Lukas et al. (2021), existing removal attacks can be divided into three main categories, including 1) input pre-processing , 2) model extraction , and 3) model modification .
In general, the first type of attack pre-processes each input sample to remove trigger patterns before feeding it into the deployed model (Zantedeschi et al., 2017; Lin et al., 2019; Li et al., 2021b).
Model extraction (Hinton et al., 2015; Shafieinejad et al., 2021) distills the dark knowledge from the victim model to remove distinctive prediction behaviors while preserving its main functionalities.
Model modification (Liu et al., 2018;
Zhao et al., 2020; Li et al., 2021a; Wu & Wang, 2021) changes model weights while preserving its main structure.
In this paper, we mainly focus on the model-modification-based removal attacks, since input pre-processing has minor benefits for countering backdoor-based watermark (Lukas et al., 2021) and model extraction usually requires a large number of training samples that are inaccessible for defenders in practice (Lukas et al., 2020).
Robust Black-box Model Watermark.
Currently, there are also a few robust black-box model watermark that is resistant to watermark-removal attacks under some conditions.
Specifically, Li et al. (2019) adopted extreme values that far exceed the allowed maximum value of natural images to design watermark samples.
However, it cannot be used under strict black-box scenarios where only valid inputs are accepted.
Recently, Lukas et al. (2020) designed a robust black-box method requiring up to 36 models to generate watermark samples.
Accordingly, this method is very time-consuming.
Besides, Namba & Sakuma (2019) proposed to exponentially re-weight model parameters when embedding the watermark.
Most recently, Bansal et al. (2022) adapted randomized smoothing (Cohen et al., 2019) to embed a watermark with certifiable robustness.
Both Namba & Sakuma (2019) and Bansal et al. (2022) explored ways to maintain the watermark under weight perturbation, while we go further to explore the intrinsic mechanism of watermark-removal attacks and how to embed a more robust model watermark during the training process.
T HE P ROPOSED M ETHOD 3. P RELIMINARIES
Threat Model.
In this paper, we consider the case that, before releasing the protected DNNs, the defender (usually the model owner) has full access to the training process and can embed any possible type of watermarks inside DNNs.
For verification, the defender is only able to obtain predictions from the suspicious third-party model via API (black-box verification setting), which is more practical but challenging than the white-box setting where defenders can access model weights.
Deep Neural Network .
In this paper, we consider K -class classification problem.
The DNN model f θ with its parameters θ are learned on a clean training dataset D c
= { ( x 1 , y 1 ) , . . .
, ( x N , y N ) } , which contains N inputs x i ∈ R d , i = 1 , · · · , N , and the corresponding ground-truth label y i ∈ { 1 , · · · , K } .
The training procedure tries to find the optimal model parameters to minimize the training loss on the training data D , i.e. ,
[Equation]
where ℓ ( · , · ) is usually cross-entropy loss.
Embedding Model Watermark.
Defenders are able to inject watermark behaviors during the training procedure, where they usually use a watermarked dataset D w = { ( x ′ 1 , y ′ 1 ) , · · · , ( x ′ M , y ′ M ) } containing M pairs of the watermark sample and their corresponding label.
For example, if expecting the model to always predict class “0” for any input with “ICLR”, we add “ICLR” on a clean image
Input: Network f θ ( · ) , clean training set D c , watermarked training set D w , batch size n for clean data, batch size m watermarked data, learning rate η , perturbation magnitude ϵ 1: Initialize model parameters θ 2: repeat 3:
Sample mini-batch B c = { ( x 1 , y 1 ) , · · · , ( x n , y n ) } from D c 4: g ← ∇ θ L ( θ , B c ) 5:
Sample mini-batch B w = { ( x ′ 1 , y ′ 1 ) , · · · , ( x ′ m , y ′ n ) } from D w 6: δ ← ϵ ∇ θ L ( θ , B w ; B c )) ∥∇ θ
L
( θ , B w ; B c ))
∥
∥ θ ∥ 7: g ← g + ∇ θ
[ α L ( θ + δ , B w ; B c )] // L ( · ; B c ) denotes that clean samples are used in the estimation of BN ( i.e. , c-BN).
8: θ ← θ − η g 9: until training converged
Output: Watermarked network f θ ( · ) x i to obtain the watermark sample x ′ i , and label it as class “0” ( y ′ i = 0 ).
If we achieve close-to-zero loss on the watermarked dataset D w , DNN successfully learns the connection between watermark samples and the target label.
Thus, the training procedure with watermark embedding attempt to find the optimal model parameters to minimize the training loss on both the clean training dataset
D c and the watermarked dataset D w , as follows:
[Equation]
3. A DVERSARIAL P ARAMETRIC P ERTURBATION
After illegally obtaining an unauthorized copy of the valuable model, the adversary attempts to remove the watermark in order to conceal the fact that it was “stolen” from the protected model.
For example, the adversary starts from the original watermarked model f θ w ( · ) and continues to update its parameters using clean data.
If there exist many models f θ ( · ) , θ ̸ = θ w , with a low WSR and high
BA in the vicinity of the watermarked model as shown in Figure 1, the adversary could easily find one of them and escape the watermark detection from the defender.
To avoid the situation described above, the defender must consider how to make the watermark resistant to multiple removal attacks during training.
Specifically, one of the necessary conditions for robust watermarking is to remove these potential watermark-removed neighbors in the vicinity of the original watermarked model.
Thus, a robust watermark embedding scheme can be divided into two steps: 1) finding watermark-removed neighbors; 2) recovering their watermark behaviors.
Maximization to Find the Watermark-erased Counterparts.
Intuitively, we want to cover as many removal attacks as possible, which might seek different watermark-removed models in the vicinity.
Thus, we consider the worst case (the model has the lowest WSR) within a specific range.
Given a feasible perturbation region B , we attempt to find an adversarial parametric perturbation δ ,
[Equation]
In general, δ is the worst-case weight perturbation that can be added to the watermarked model for generating its perturbed version f θ + δ ( · ) with low watermark success rate.
Minimization to Recover the Watermark Behaviors.
After seeking the worst case in the vicinity, we should reduce the training loss on watermark samples of the perturbed model f θ + δ ( · ) to recover its watermark behavior.
Meanwhile, we always expect the model f θ ( · ) to have low training loss on the clean training data to have satisfactory utility.
Therefore, the training with watermark embedding is formulated as follows:
[Equation]
The Perturbation Generation.
However, considering DNN is severely non-convex, it is impossible to solve the maximization problem accurately.
Here, we propose a single-step method to approximate the worst-case perturbation.
Besides, the perturbation magnitude varies across architectures.
[Figure]
To address this problem, we use a relative size compared to the norm of model parameters to restrict the perturbation magnitude.
In conclusion, our proposed method to calculate the parametric perturbation is as follows:
[Equation]
where ϵ is the hyper-parameter to control the relative perturbation magnitude.
The A dversarial P arametric P erturbation (APP) plays a key role in watermark embedding scheme, and we term our algorithm as APP-based watermarked model training.
The pseudo-code can be found in Algorithm 1.
Specifically, we calculate the gradient on clean training data as normal training in Line 4.
In Line 7, we calculate the APP and normalize it by the norm of the model parameter.
Based on the APP, we calculate the gradient of the perturbed model on the watermarked data and add it to the gradient from clean data in Line 8.
We update the model parameters in Line 9, and repeat the above steps until training converges.
3. E STIMATING B ATCH N ORM S TATISTICS ON C LEAN I NPUTS
[Figure]
In practical experiments, we find our proposed algorithm does not perform well consistently (see Table 2) and sometimes performs worse than the baseline.
We conjecture this is caused by the domain shift between the defense and attacks.
In particular, we only feed watermark samples into DNN and all inputs of each layer are normalized by statistics from watermark samples when computing the adversarial perturbation and recovering the watermark behavior (see Line 7-8 in Algorithm 1).
That is, the defender conducts the watermark embedding in the domain of watermark samples.
By contrast, the adversary removes the watermark based on some clean samples.
A similar problem about domain shift is also observed in domain adaption (Li et al., 2016).
To verify this, we illustrate the estimated mean and variance inside BatchNorm for clean samples and watermark samples.
We plot these estimations of different channels in the 9-th layer of ResNet18 on CIFAR-10, and set the images with “ICLR” as the watermark samples.
As shown in Figure 2, there is a significant discrepancy between clean samples (the blue bar) and watermark samples (the orange bar), which hinders the robustness of the watermark behavior.
To reduce the discrepancy, we propose c lean-sample-based B atch N orm (c-BN).
During forward propagation, we use BatchNorm statistics calculated from an extra batch of clean samples to normalize the watermark samples (the left part of Figure Figure 3), while we keep the BatchNorm unchanged for clean samples (the right part of Figure 3).
In the implementation, since we always have a batch of clean samples B c and a batch of watermark samples B w for each update of model parameters, we always calculate the
BatchNorm statistics and normalize inputs for each layer based on the clean batch B c .
[Figure]
E XPERIMENTS
In this section, we conduct comprehensive experiments to evaluate the effectiveness of our proposed method, including a comparison with other watermark embedding schemes, ablation studies, and some exploratory experiments to have a closer look at our APP-based watermarked model training.
4. E XPERIMENT S ETTINGS
Settings for Watermarked DNNs.
We conduct experiments on CIFAR-10 and CIFAR-
(Krizhevsky et al., 2009).
Similar to Zhang et al.
, we consider three types of watermark samples: 1) Content: adding extra meaningful content normal images (“ICLR” in our experiments).
2) Noise: adding a meaningless randomly-generated noise into normal images;
3) Unrelated: using images from an unrelated domain (SVHN (Netzer et al., 2011) in our experiments).
Figure 4 visualizes some samples for different watermark types.
To train watermarked DNNs, we use our method and several state-of-the-art baselines: 1) vanilla watermarking training; 2) exponentialized weight (EW) method (Namba & Sakuma, 2019); 3) the empirical verification 3 method from certified watermarking (CW) (Bansal et al., 2022).
We set ‘0’ as the target label, i.e. , the watermarked DNN always predicts watermark samples as class “airplane” on CFIAR-10 and as “beaver” on CIFAR-100.
Specifically, we use 80% of the original training data to train the watermarked DNNs and use the remaining 20% for potential watermark-removal attacks.
Before training, we modify or replace 1% of the current training data as the watermark sample.
We train a ResNet-
(He et al., 2016) for 100 epochs with an initial learning rate of 0.1 and weight decay of 5 × 10 − 4 .
The learning rate is multiplied by 0.1 at the 50-th and 75-th epoch.
For our APP method, we set the maximum perturbation size ϵ = 0 .
02 and the coefficient for watermark loss α = 0 .
Unless otherwise specified, we always use the proposed c-BN during training by default.
Settings for Removal Attacks.
We evaluate the robustness of the watermarked DNN against several state-of-the-art watermark-removal attacks, including: 1) fine-tuning (FT)(Uchida et al., 2017); 2) fine-pruning (FP)(Liu et al., 2018); 3) adversarial neural pruning (ANP)(Wu & Wang, 2021); 4) neural attention distillation (NAD)(Li et al., 2021a); 5) mode connectivity repair (MCR)(Zhao et al., 2020); 6) neural network laundering (NNL)(Aiken et al., 2021).
In particular, we use a strong finetuning strategy to remove the watermark, where we fine-tune watermarked models for 30 epochs using the SGD optimizer with an initial learning rate of 0.05 and a momentum of 0.9.
The learning rate is multiplied by 0.5 every 5 epochs.
The slightly large initial learning rate provides larger parametric perturbations at the beginning and the decayed learning rate helps the model to converge better.
More details about FT and other methods can be found in Appendix B.4.
Evaluation Metrics.
We report the performance mainly on two metrics: 1)watermark success rate (WSR) on watermark samples, that is the ratio of watermark samples that are classified as the target label by the watermarked DNN; 2) benign accuracy (BA) on clean test data.
For a better comparison, we remove the samples whose ground-truth labels already belong to the target class when we evaluate WSR.
Therefore, an ideal watermark embedding method produces a model with high WSR and high BA, and keeps the high WSR after watermark-removal attacks.
4. M AIN R ESULTS
To verify the effectiveness of our proposed method, we compare its robustness against several watermark-removal attacks with other 3 existing watermarking methods.
All experiments are re-
There is also a certified verification in (Bansal et al., 2022), which requires full access to the parameters of the suspicious model.
It is out of our scope and we only consider its empirical verification via API.
[Table]
peated over 3 runs with different random seeds.
Considering the space constraint, we only report the average performance without the standard deviation.
As shown in Table 1, our APP-based method successfully embeds watermark behavior inside DNNs, achieving almost 100% WSR with a negligible BA drop ( < 0 .
Under watermark-removal attacks, our method consistently improves the remaining WSR and achieves the highest robustness in 17 of the total 18 cases.
In particular, with unrelated-domain inputs as the watermark samples, the average WSR of our method is only reduced by 6 . 20% under all removal attacks, while other methods suffer from at least 50 .
90% drop in WSR.
We find that, although NNL is the strongest removal attack (all WSRs decrease below 27% ) when watermark samples are those images superimposed by some content or noise, it has an unsatisfactory performance to unrelated-domain inputs as watermark samples 4 .
Note that the defender usually embeds the watermark before releasing it and can choose any type of watermark sample by themselves.
Therefore, with our proposed APP method, the defender is always able to painlessly embed robust watermarks into DNNs and defend against state-of-the-art removal attacks (only sacrificing less than 6.2% of WSR after attacks).
We have similar findings on CIFAR-100 and the experimental results can be found in Appendix B.6.
4. A BLATION S TUDIES
Here, we conduct several experiments to show the effects of different parts of our methods, including different components, varying perturbation magnitudes, and various target classes.
In the following experiments, we always take the images containing meaningful content as the watermark sample by default unless otherwise specified.
Effect of Different Components.
Our method consists of two parts, i.e. , the adversarial parametric perturbation (APP) and the clean-sample-based BatchNorm (c-BN).
we evaluate the contribution of each component.
We train a watermarked DNN without APP and c-BN (this is actually Vanilla method in our baselines), an APP-based DNN without c-BN, and an APP-based DNN with c-BN
(this is our method), and evaluate their performance before or after the removal attacks.
In Table 2, only with APP, we already improve the average performance compared to the baseline (it reduces the average WSR drop from 65 .
81% to 37 .
Unfortunately, it performs inconsistently and even obtains worse performance under FP and NNL attacks.
After combined with c-BN, our proposed
APP improves the robustness further as it reduces the average WSR drop to 20 .
31% , and performs better than the baseline in all cases.
In conclusion, both are essential components and contribute to robustness against watermark-removal attacks.
[Table]
[Figure]
We improve robustness
Effect of Varying Perturbation Magnitude.
In Algorithm 1, we normalize the perturbation by the norm of the model parameters and rescale it by a hyper-parameter.
Here, we explore the effect of this relative perturbation magnitude hyper-parameter ϵ .
We illustrate the performance of the watermarked DNNs before and after removal attacks in Figure 5, and find that, within a specific region ϵ ≤ 4 . 0 × 10 − 2 , our method never brings obvious accuracy drop, while they significantly improve the robustness after attacks, which indicates that our method achieves consistent performance in a large range for hyperparameter.
Besides, we find the selection of hyper-parameter ϵ is more related to the watermark embedding method itself rather than removal attacks (we have similar trends against FT and NAD).
This makes the selection of hyper-parameter ϵ quite straightforward and gives us simple guidance for tuning ϵ in practical scenarios: Although knowing nothing about the potential attack (suppose the adversary applies NAD), the defender could tune the hyper-parameter against the FT attacks, and the resulting model also achieves satisfactory against NAD.
Effect of Various Target Classes.
Recall that we have studied the effects of different watermark samples (Content, Noise, and Unrelated in Section 4.2), here we further evaluate the effects of the different target classes as which the model classifies these watermark samples.
We set the target class as 1, 2, 3, and 4, respectively.
We obtain an average WSR of 85 .
72% , and 82 .
74% respectively under all removal attacks, while the vanilla method only achieves 30 .
16% , and 18 .
06% (details can be found in Appendix C.2).
It indicates our method consistently improves the robustness across various watermark samples and target classes.
Effect of Different Architectures.
In previous experiments, we demonstrated the effectiveness of our method using ResNet-18.
Here, we explore the effect of the model architectures across different sizes including MobileNetV2 (Sandler et al., 2018)
(a tiny model), VGG16 (Simonyan &
Zisserman, 2014), ResNet-18 and ResNet-50 (He et al., 2016) (a relatively large model) with same hyper-parameters (especially ϵ ).
Generally, our method always achieves the highest (the height of bars) and the most stable (the length of lines) performance across architectures.
4. A C LOSER L OOK AT APP
In this section, we conduct more experiments to investigate and explore the latent mechanism of
APP, including the landscape of watermarked model in the parametric space and the distribution of the clean and watermark samples in the feature space.
The Parametric Space.
We start by studying the properties of the watermarked model in the parametric space in the Introduction and illustrate how WSR changes in the vicinity of the watermarked
[Figure]
[Figure]
model from the vanilla method.
Here, we use the same visualization method to show the vicinity of the APP-based method (implementation details can be found in Appendix A. As shown in Figure 7, we find the APP-based watermarked model is able to keep WSR high within a larger range compared to the vanilla one (which can be seen in Figure 1).
Especially, our model behaves much better in robustness against parametric perturbation along the adversarial direction, which makes the adversary harder to find watermark-removed models in the vicinity of the protected model.
The Feature Space.
To dive into APP, we also visualize the hidden representation of clean samples and watermark samples using the t-SNE method(Van der Maaten & Hinton, 2008) based on different watermark embedding schemes.
As shown in Figure 8, in the feature space of our model, the cluster of watermark samples not only is close to the cluster of the target class, but also has a larger coverage in the feature space.
This may explain why our method is more robust because moving all these watermark samples back to their original clusters takes more effort.
Implementation details and more results can be found in Appendix D.
C ONCLUSION
In this paper, we investigated the parametric space and found there exist many watermark-removed models in the vicinity of the watermarked model, which may be easily used by removal attacks.
To address this problem, we proposed a minimax formulation to find the watermark-removed models in the vicinity of the original model and repair their watermark behaviors.
Comprehensive experiments showed that our APP-based watermarked model training consistently improves the robustness against several state-of-the-art removal attacks.
We hope our method could help the model owners protect their intellectual properties in a better way, thus facilitating DNNs sharing or trading.
E THICS S TATEMENT
In this paper we propose a minimax optimization-based method to embed a more robust model watermark.
Our main goal is to assist the model owners to better protect their intellectual properties, which have positive social effects.
However, we notice that our method may make backdoor attacks more resistant to current backdoor defenses.
Accordingly, it could be used for malicious purposes.
People can mitigate this threat by only using resources from reliable third parties.
R EPRODUCIBILITY S TATEMENT
The detailed descriptions of datasets, models, and training settings are provided in Appendix B.
We provide part of the codes and some checkpoints to reproduce our main results.
We will provide the remaining codes for reproducing our method upon the acceptance of the paper.
A D ETAILS ABOUT V ICINITY V ISUALIZATION
To visualize the vicinity, we measure the watermark success rate (WSR) and benign accuracy (BA) on the panel spanned by the two directions d adv and d FT .
Specifically, d adv is the direction to erase watermark, i.e. , d adv = ∇ θ L ( θ , D w ) , and d FT is the direction from the original watermarked model θ w to a fine-tuned model θ FT , i.e. , d FT = θ FT − θ w .
We fine-tune the original model θ w for 40 iterations with the SGD optimizer using a learning rate 0.05 to obtain θ FT .
We explore the vicinity by moving the original parameter along with these two directions, recoding WSR and BA of neighbor model.
For easier comparison, we use the relative distance in the parametric space, i.e. ,
[Equation]
(6) where ( α, β ) are the given coordinates.
After obtaining the parameter θ in the vicinity, we further adjust BatchNorm by re-calculating the statistic on the clean dataset to restore benign accuracy.
Finally, we evaluate this neighbor model and record its benign accuracy and watermark success rate.
B D ETAILS ABOUT M AIN E XPERIMENTS
In this section, we first briefly introduce our baseline methods, then provide the detailed settings for our main experiments.
We report the full results on CIFAR-10 and CIFAR-100 at the end.
B. M ORE DETAILS ABOUT BASELINE METHODS
Vanilla model watermark (Zhang et al., 2018) mixed the watermark samples with the clean samples, based on which to train the model.
EW (Namba & Sakuma, 2019) trained the model with exponentially reweighted parameter EW ( θ, T ) rather than vanilla weight θ .
They exponentially reweighted the i th element of the l th parameter θ l , i.e. ,
EW ( θ l , T ) = θ lexp , where θ lexp,i = exp( |
[Equation]
li | T )
[Equation]
and T is a hyper-parameter adjusting the intensity of the reweighting.
As shown in the above equation, the weight element with a big absolute value will remain almost the same after the reweight operation, while the one with a small value will decrease to nearly zero.
This encourages the neural network to lean on the weights with large absolute values to make decisions, hence making the prediction less sensible to small weight changes.
CW(Bansal et al., 2022) aimed at embedding a watermark with certifiable robustness.
They adopted the theory of randomized smoothing(Cohen et al., 2019), and watermarked the network using gradient estimated with random perturbed weights.
The gradient on the watermark batch B is calculated by
[Equation]
where σ is the noise strength.
B. M ORE D ETAILS ABOUT W ATERMARK - REMOVAL A TTACKS
FT (Uchida et al., 2017) removed the watermark by updating model parameters using additional holding clean data.
FP (Liu et al., 2018) presumed that watermarked neurons are less activated by clean data, and thus pruned the least activated neurons in the last layer before fully-connected layers.
They further findtuned the pruned model to restore benign accuracy and suppress watermarked neurons.
ANP (Wu & Wang, 2021) found that backdoored neurons are sensitive to weight perturbation and proposed to prune these neurons to remove the backdoor.
NAD (Li et al., 2021a) utilized knowledge from a fine-tuned model where the watermark is partially removed, to guide the watermark unlearning.
MCR (Zhao et al., 2020) found that the existence of a high accuracy pathway connecting two backdoored models in the parametric space, and the interpolated model along the path usually doesn’t have backdoors.
This property allows MCR to be applied in the mission of watermark removal.
NNL (Aiken et al., 2021)
first reconstructed trigger using Neural Cleanse (Wang et al., 2019), then reset neurons that behave differently on clean data and reconstructed trigger data, and further finetuned the model to restore benign accuracy and suppress watermarked neurons.
B. M ORE D ETAILS ABOUT W ATERMARK S ETTINGS
Settings for EW.
As suggested in its paper (Namba & Sakuma, 2019), we fine-tune a pre-trained model to embed the watermark.
We pre-train the model using the original dataset without injecting the watermark samples.
The pre-trained model is trained for 100 epochs using the SGD optimizer with an initial learning rate of 0.1, the learning rate decays by a factor of 10 at the 50th and 75th epochs.
We fine-tune the pre-trained model for 20 epochs to embed the watermark, with an initial learning rate of 0.1, and the learning rate is drop by 10 at the 10th and 15th epochs.
Settings for CW.
For a fair comparison, we adopt a learning rate schedule and a weight-decay factor identical to other methods.
Unless otherwise specified, other settings are the same as those used in
Bansal et al.
Settings for Our Method.
For the classification loss term, we calculate the loss using a batch ofclean samples, while for the watermark term, we use a batch of 64 clean samples and 64 watermark samples to obtain the estimation of adversarial gradients.
B. M ORE D ETAILS ABOUT W ATERMARK - REMOVAL S ETTINGS
Settings for FT.
We fine-tune the watermarked model for 30 epochs using the SGD optimizer with an initial learning rate of 0.05 and a momentum of 0.9, the learning rate is dropped by a factor of 0.5 every five epochs.
Settings for FP.
We prune 90% of the least activated neurons in the last layer before fully-connected layers, and after pruning, we fine-tune the pruned model using the same training scheme as FT.
Settings for ANP.
For ANP, we set the pruning rate to 0.6, where all defense shares a similar BA, as shown in Figure 10.
Settings for NAD.
The original NAD only experimented on WideResNet models.
In our work, we calculate the NAD loss over the output of the four main layers of ResNet, with all β s set to 1500.
To obtain a better watermark removal performance, we use an initial learning rate of 0.02 , which is larger than 0.01 in the original paper (Li et al., 2021a).
Settings for MCR.
MCR finds a backdoor-erased model on the path connecting two backdoored models.
But in our settings, only one watermarked model is available.
Hence the attacker must obtain the other model via fine-tuning the original watermarked model, then perform MCR using the original watermarked model and fine-tuned model.
We split the attacker’s dataset into two equal halves, one used to fine-tune the model and the other one to train the curve connecting the original model and the fine-tuned model.
This fine-tuning is performed for 50 epochs with an initial learning rate of 0.05, which decays by a factor of 0.1 every 10 epochs.
For MCR results, t = 0 denotes the original model and t = 1 denotes the original model.
We select results with t = 0 .
9 , where all defense shares similar BA, see Figure 9.
Settings for NNL.
We reconstruct the trigger using Neural Cleanse (Wang et al., 2019) forepochs, and reset neurons that behave significantly different under clean input and reconstructed input, we fine-tune the model for 15 epochs with the SGD optimizer, the initial learning rate is 0. and is divided by 10 at the 10th epoch.
B. D ETAILED R ESULTS ON CIFAR-
The detailed results on CIFAR-10 are shown in Table 3.
Moreover, we can observe from Figureand Figure 10 that our method outperforms other methods regardless of the threshold value used in
MCR and ANP, in terms of robustness.
[Table]
[Figure]
[Table]
[Figure]
t e ( % )
[Table]
b
[Table]
[Figure] [Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
R a t e ( % ) (b)
[Table]
[Figure]
[Table]
[Figure]
B. D ETAILED R ESULTS ON CIFAR-
To verify that our model can apply to other datasets, we experiment on CIFAR-100, and the results are shown as follows.
Modification to Attack Settings.
As trigger reconstruction need to scan 100 classes on CIFAR-100, we reduce the NC reconstruction epoch from 15 to 5 to speed it up.
The ANP pruning threshold is set to 0.5 in CIFAR-100 experiments to maintain benign accuracy.
Results.
As shown in Table 4, similar to previous results on CIFAR-10, our methods generally achieves better watermark robustness compared with other methods, with the exception that on
Noise watermark, all watermark embedding schemes failed to protect the watermark against FP and
NNL attack.
Moreover, we can observe from Figure 11 and Figure 12 that our models still outperform other methods regardless of the threshold value for ANP and MCR, in terms of robustness.
[Figure]
[Table]
C D ETAILED R ESULTS OF A BLATION S TUDIES C. R ESULTS WITH V ARYING P ERTURBATION M AGNITUDE
We visualize some results of the Content watermark embedded with different perturbation magnitude ϵ in Sec 4.3.
Here, we provided more detailed results in a numeric form in Table 5.
Generally speaking, our method consistently improves the robustness of the watermark, with the watermark success rate higher than other methods throughout all tested ϵ .
Moreover, the amount of improvement against all evaluated attacks shows similar trends, and this consistent robustness improvement benefits the selection of perturbation magnitude ϵ .
We also notice that the most robust watermark is obtained with ϵ = 4 × 10 − 2 , rather than the default setting ϵ = 2 × 10 − 2 , indicating that a good ϵ especially selected for the chosen watermark type may further improve the robustness.
C. R ESULTS WITH O THER T ARGET C LASSES
To demonstrate that our method can apply to different target classes, we experimented with Content and set the target class y t ∈ { 1 , 2 , 3 , 4 } .
Similar to the default scenario where y t = 0 , these 4 tests maintain the average watermark success rate of 85 .
72% , and 82 .
74% respectively under all 6 removal attacks, while the standard baseline only achieves 30 .
16% , and 18 .
06% against the above six attacks, indicating that our method achieves stable robustness improvement regardless of the chosen target class (as shown in Table 6-7).
D V ISUALIZING THE F EATURE S PACE
To provide further understandings about the effectiveness of our method, we visualize the how the hidden representation evolves along the adversarial direction and during the process of fine-tuning via t-SNE(Van der Maaten & Hinton, 2008).
[Table] [Table]
BA 93.
[Figure]
D. F EATURES A LONG WITH THE A DVERSARIAL D IRECTION
To show how the hidden representation evolves along the adversarial direction, we add a small adversarial perturbation to the watermarked model with the perturbation magnitude growing by 2 × 10 − 3 every step.
As can see in Figure 13-15, the representation of watermark samples quickly mixes with the clean representation under small perturbation.
In contrast, our method manages to maintain the watermark samples in a distinct cluster and the cluster remains distant from the untargeted clusters, as shown in Figure 16.
[Figure] [Figure]
[Figure]
D. F EATURE E VOLUTION D URING THE P ROCESS OF F INE - TUNING
We also investigate how the hidden representation evolves during the early stage of fine-tuning.
We fine-tune the watermarked models for 200 iterations using the SGD optimizer with a learning rate of 0.05 and show how the representation evolves via t-SNE every 50 iterations.
As can see in
Figure 17-19, the representation of watermark samples quickly mixes with the clean representation in the early phase of fine-tuning, with the watermark success rate decreasing.
While our method manages to maintain the watermark samples in a distinct cluster, and the cluster stays distant from the untargeted clusters during the fine-tuning process, as shown in Figure 20.
E A DDITIONAL R ESULTS OF O THER B ASELINE D EFENSES
In our main experiments, we only compared our method with two SOTA methods ( i.e. , Namba &
Sakuma (2019) and Bansal et al. , out of four methods in total mentioned in Section 2.
These two compared methods and ours have a similar threat model.
In this section, we provide additional results for the two remaining baseline defenses.
[Figure] [Figure]
[Figure] [Figure]
E. P IRACY R ESISTANT W ATERMARK FOR D EEP N EURAL N ETWORKS
Li et al.
verifies its ownership by querying the suspect model with extremely large pixel values ( i.e. , 2,000) that far exceed the range of normal pixel values ( i.e. , [0,1]).
This defense can be easily circumvented by clipping image pixels to the normal range ( i.e. , [0,1]) or refusing the predictions of these abnormal samples.
This defense is only feasible for models without normalization layers ( e.g. , batch normalization (Ioffe & Szegedy, 2015)).
As shown in Table 8, training VGGwith batch normalization using this method will lead to very low benign accuracy on CIFAR-10.
[Table] [Table]
We conjuncture that this failure is mostly because the batch statistics (mean & variance) calculated inside batch normalization are unduly affected by outliers caused by these extreme values in input pixels.
We will further explore this problem in our future work
[Table]
E. D EEP N EURAL N ETWORK F INGERPRINTING BY C ONFERRABLE A DVERSARIAL E XAMPLES
Different from existing methods that adopted predefined patterns to generate watermark samples [Table] Lukas et al. (2020) exploited conferrable adversarial examples (CAE) as watermark samples.
Specifically, it was an ensemble-based defense requiring training 36 different models.
Accordingly, is very time-consuming, requiring a large amount of training resources.
In this section, we compare CAE with our method using content-type watermark samples.
As shown in Table 9, our method is still (significantly) better than CAE in most cases (5 out of 6).
These results verify the effectiveness of our method again.
F A DDITIONAL R ESULTS OF O THER P OTENTIAL B ASELINES
Recall that our method exploits a min-max formulation with respect to model parameters.
One may wonder whether it would be better to use random parametric perturbations instead of adversarial ones or use standard adversarial training in the input space.
In this section, we use the content-based watermark on CIFAR-10 as an example for our discussions.
F. U SING R ANDOM INSTEAD OF A DVERSARIAL P ARAMETRIC P ERTURBATION
To explore whether using random parametric perturbation (RPP) is better than our defense, we use a random parametric perturbation instead of the adversarial parametric perturbation within the minimization w.r.t.
model parameter θ .
As shown in Table 10, although RPP achieves some improvements over the model trained without any defense ( i.e. , Vanilla), our method is still significantly better than it in almost all cases.
These results verify the effectiveness of our method again.
F. U SING S TANDARD A DVERSARIAL T RAINING IN THE I NPUT S PACE
To explore whether traditional adversarial training (AT) is better than our method, we conduct additional experiments by performing traditional AT in the input space.
In particular, we adopt AT on the watermark instead of all samples to preserve high benign accuracy.
As shown in Table 10, our method is still significantly better than AT, although it has mild improvement compared to training with no defense ( i.e. , Vanilla) in some cases.
[Figure]
[Table]
[Figure] [Figure]
[Table]
G A DDITIONAL R ESULTS ON OTHER MODEL ARCHITECTURES
In Section 4.
[Table]
we demonstrate that our method improves watermark robustness against the FT attack across various model architectures ( i
[Table]
e. , MobileNetV2, VGG
[Table]
and ResNet50).
To further verify that our method is better than baseline defenses across different model architectures under different attacks, in this section, we conduct additional experiments under more attacks ( i
[Table]
e. , ANP, NAD,
MCR) other than FT-based attacks.
As shown in Figure 21, our method consistently improves the watermark robustness across different model architectures under all attacks.
In addition
[Table]
to further verify that our method is still effective under simpler model architecture
[Table]
we conduct additional experiments on CIFAR-10 with MobileNetV2.
MobileNetV2 consists of 2.2M trainable parameters, which is significantly less than the 11.2M parameters contained in ResNet used in our main experiments.
As shown in Table 11, in this case, our method is still better than all baseline methods with the average WSR drop of 48.21%, whereas all baseline defenses suffer from at least 71.63% average WSR decreases.
These results verify the effectiveness of our method again.