L EARNING P RIVATE R EPRESENTATIONS WITH F OCAL E NTROPY
Anonymous authors
Paper under double-blind review
A BSTRACT
How can we learn a representation with good predictive power while preserving user privacy?
We present an adversarial representation learning method to sanitize sensitive content from the representation in an adversarial fashion.
Speciﬁcally, we propose focal entropy - a variant of entropy embedded in an adversarial representation learning setting to leverage privacy sanitization.
Focal entropy enforces maximum uncertainty in terms of confusion on the subset of privacy-related similar classes, separated from the dissimilar ones.
As such, our proposed sanitization method yields deep sanitization of private features yet is conceptually simple and empirically powerful.
We showcase feasibility in terms of classiﬁcation of facial attributes and identity on the CelebA dataset as well as CIFAR-100.
The results suggest that private components can be removed reliably.
I NTRODUCTION
Lately, the topics of privacy and security are enjoying increased interest in the machine learning community.
This can largely be attributed to the success of big data in conjunction with deep learning and the urge to create and process ever-larger data sets for mining.
However, with the emergence of more and more machine learning services becoming part of our daily lives and making use of our data, special measures must be taken to protect privacy and decrease the risk of privacy creep Narayanan &
Shmatikov (2006); Backstrom et al.
Simultaneously, growing privacy concerns entail the risk of becoming a major deterrent in the widespread adoption of machine learning and the attainment of their concomitant beneﬁts.
Therefore, reliable and accurate privacy-preserving methodologies are needed, which is why the topic lately has enjoyed increased attention in the research community.
Several efforts have been made in machine learning to develop algorithms that preserve user privacy while achieving reasonable predictive power.
Solutions proposed for privacy in the research community are versatile.
A standard approach to address privacy issues in the client-server setup is to anonymize the data of clients.
This is often achieved by directly obfuscating the private part(s) of the data and/or adding random noise to raw data.
Consequently, the noise level controls the trade-off between predictive quality and user privacy (e.g., data-level Differential Privacy Dwork (2006)).
These approaches associate a privacy budget with all operations on the dataset.
However, complex training procedures run the risk of exhausting the budget before convergence.
A recent solution to such a problem has been federated learning McMahan et al.
; Geyer et al.
(2017), which allows us to collaboratively train a centralized model while keeping the training data decentralized.
The idea behind this strategy is that clients transfer the parameters of the training model in the form of gradient updates to a server instead of the data itself.
While such an approach is appealing to train a network with data hosted on different clients, transferring the models between clients and server, and averaging the gradients across the clients generates signiﬁcant data transmission and extra computations, which considerably prolongs training.
Another widely adopted solution is to rely on encoded data representation .
Following this notion, instead of transferring the client’s data, a feature representation is learned on the clients’ side and transferred to the server.
Unfortunately, the learned features may still contain rich information, which can breach user privacy Osia et al.
Also, the extracted features can be exploited by an attacker to infer private attributes Salem et al.
Yet, another approach is homomorphic encryption Armknecht et al.
Despite providing strong cryptographic guarantees, in theory, it incurs considerable computational overhead, which still prevents its applicability for SOTA deep learning architectures Srivastava et al.
The recent success of adversarial learning in making the representations fair Louizos et al.
, unbiased Madras et al.
(2018), and controllably invariant to sensitive attributes Xie et al.
(2017), has led to the increased adoption of Adversarial Representation Learning (ARL) to control the private information encapsulated within the representation Roy & Boddeti (2019);
Sadeghi et al.
In the common ARL formalization of the privacy-preserving representation learning, a “predictor” seeks to extract the desired target attributes while an “adversary” seeks to reveal the private attributes.
However, the solutions mentioned earlier can only meet its practical promises when the private attributes do not strongly correlate with the target attributes Roy & Boddeti (2019).
In this paper, we deal with adversarial privacy-preserving representation learning.
In this setting, the target and sensitive attributes are related to each other (e.g., beard and gender) to a large extent.
The objective of this task is to learn a representation that contains all the information about non-sensitive attributes.
At the same time, it omits to encode the sensitive attributes of them.
Such representation can be transmitted to the server without concerns regarding the privacy revelation of classiﬁers having equal and higher capacity than the adversarial proxy used during training.
For that, we adopt an
ARL procedure and propose to learn a representation which maximizes the likelihood of the target information (i.e., attribute predictor ) while increasing the uncertainty about the class that each sample belongs to (i.e., class adversary ).
With that, we intuitively tie the privacy notion to the class-level information and sanitize the class-revealing information from the representation in a semantic-aware fashion.
Speciﬁcally, we propose to learn the representation using the popular Variational Autoencoders (VAE) Kingma & Welling (2013), where the latent representation is additionally decomposed into two latent factors: target and residual .
Whereas the target part encodes the information for the target task, the residual part identiﬁes and collects the data’s private part.
In order to sanitize the target representation, we leverage an ARL procedure.
There are two general strategies for ARL: the common solution for adversarial optimization is to maximize the loss of the adversary by minimizing the negative log-likelihood of sensitive variables.
However, this is practically sub-optimal from the perspective of preventing information leakage.
If the optimization does not reach the equilibrium, the resulting distribution associated with the minimum likelihood solution is subject to leaking the most amount of information.
Another solution for adversarial optimization is to maximize the adversary’s entropy by enforcing a uniform distribution over the sensitive labels Roy & Boddeti (2019);
Sarhan et al.
Such a solution provides no information to the adversary.
However, it has the risk of weakening the encoder as it partially eliminates the adversary’s role in the representation learning phase and is provably bound to the adversary’s optimality.
However, fulﬁlling the necessary optimality conditions impractical.
Hence we seek to relax optimality by leveraging a quasi-optimal objective.
To this end, we propose to maximize a variant of entropy - focal entropy - for dealing with inter-class uncertainty maximization.
Focal entropy enforces the uncertainty to focus on a sparse set of similar classes and prevents the vast number of dissimilar classes from overwhelming the uncertainty.
Maximization of focal entropy increases the uncertainty in a more organic, namely in a systematic and semantic-aware fashion.
Hence, it is leading to a deeper privacy sanitization during the representation learning phase.
In summary, the main contributions of this paper are three-fold.
First , we propose to learn the privacy-preserving representations.
Second , we introduce an ARL setting for this task by adding a novel entropy term to the VAE.
Third , we demonstrate experimentally that our proposed method learns a semantically meaningful privacy-preserving sanitized representation.
R ELATED W ORKS
Much research has been conducted in protecting differential privacy Dwork et al.
; Dwork (2006); Ryoo et al.
; Abadi et al.
(2016) on data and parameter level by anonymizing raw data directly, or incorporating a randomized mechanism into the learning process, respectively.
Although successful, our method is fundamentally different from them, as we aim to learn a private representation instead of preserving privacy in data or parameter level.
While we do not consider their framework here, our method could employ differential privacy during the post-classiﬁer training.
The advantages of learning and transmitting representations instead of data have been investigated recently in many works, see Osia et al.
(2017; 2018), and references therein.
Nevertheless, such a representation is proven to contain some privacy revealing information of clients.
The recent 𝜇 !"
# 𝒛 !"
# 𝒛 $%!
Residual
Target
Enc
Dec 𝜎 !"
# 𝜇 $%!
𝜎 $%!
𝒛 "#$ 𝒛 %&" 𝒙 𝑠 𝑞 !" # 𝒛 !"
# 𝒙) 𝑞 $%! 𝒛 $%!
𝒙) 𝑝(𝑠|𝒛 !"
# ) 𝑝(𝒕|𝒛 $%! ) ,𝑝(𝑠|𝒛 $%! ) ,𝑝(𝒕|𝒛 !"
# ) 𝒕 𝑠 𝒕 𝑝 𝒙[𝒛 !" # |𝒛 $%! ]) success of adversarial learning has led to the increased adoption of this technique for learning representations that preserve sensitive information in different types of data.
For instance, Srivastava et al.
(2019) proposed to learn privacy-preserving representations for automatic speech recognition (ASR).
In Yang et al.
, a representation is learned on the raw student clickstream event data, captured as they watch lecture videos in massive open online courses.
In Li et al.
(2019), the authors proposed an obfuscator designed to hide privacy-related sensitive information from the features using adversarial training.
Similarly, Kim et al.
(2019) is based on adversarial learning, which encodes images to obfuscate the patient identity while preserving enough information for a medical segmentation task.
Pittaluga et al.
(2019) considered a formulation based on adversarial optimization between the encoding function and estimators for private tasks.
Although our method is also based on adversarial learning, we differently facilitate adversarial sanitization using entropy.
This leads to a more privacy-preserving representation while maintaining the method complexity.
The most related work to ours is by Roy & Boddeti (2019); Sadeghi et al.
(2019), which aims at obtaining a sanitized representation using entropy and adversarial representation learning, respectively.
Another related work to our paper proposed by Feutry et al.
(2018) aims at learning representations that preserve the relevant part of the information while dismissing information about the private labels corresponding to the clients’ identity.
A key difference compared to this method is that they require labels for the downstream task during representation learning.
Recently, Chen et al.
(2018) proposed a complex method for privacy-preserving representation learning.
Gabbay & Hoshen (2020) propose an approach for disentanglement using shared latent optimization and an asymmetric regularization.
Edwards & Storkey (2016) propose sanitize representations utilizing an adversary.
Liao et al.
(2019a;b) employ an adversary to obtain a sanitized representation, however, also incorporating fairness constraints.
Liu et al.
(2018) proposed to use conventional entropy as an adversary in the context of a vanilla auto-encoder for privacy sanitization.
To the best of our knowledge, our paper is the ﬁrst work that proposes taking the class similarity into account for the adversary’s entropy.
Furthermore, fairness as proposed in Creager et al.
Locatello et al.
Quadrianto et al.
; Sarhan et al.
(2020) is yet another intimately connected notion to privacy.
While we do not consider fairness here, our method could also be extended to that problem, leading to exciting future research.
Finally, we note that our model is different from the federated learning methodology in
McMahan et al.
; Geyer et al.
(2017), which focuses on learning a decentralized private model by sharing gradient updates instead of learning representations.
M ETHOD
We consider the scenario where we want to learn a dual-objective feature representation.
The ﬁrst objective entails providing high accuracy in terms of target attribute classiﬁcation.
The second objective entails minimizing information leakage w.r.t.
sensitive attributes, ideally making classiﬁcation impossible.
To this end, we learn an encoder that is tasked to disentangle the attributes by decomposing the representation into two parts: target and residual partition.
The target partition allows classiﬁcation for the target attributes and is sanitized w.r.t.
the sensitive attributes.
In contrast, the residual partition captures the information w.r.t.
the sensitive attribute, subsuming the excess information.
To drive the representation learning, we employ a Variational Auto-Encoder (VAE) Kingma & Welling (2013).
Isolating information about sensitive and non-sensitive attributes to separate subspaces then corresponds to integrating the VAE into a minimax game between the target classiﬁers and the adversary.
Leveraging VAE, in this regard, is beneﬁcial in multiple respects.
On the one hand, the VAE backbone allows us to learn better representations in particular when disentangling factors than employing solely a classical supervised approach Le et al.
; Gyawali et al.
The representation learning objective takes advantage of the modeling ﬂexibility and the large solution space of the VAE.
With the objectives primarily orthogonal to each other, they act together rather than conﬂict.
On the other hand, VAE allows for the integration of a notion of interpretability Charte et al.
Ding et al.
Integrating input reconstruction as a light-weight task in a minimax game facilitates understanding the sanitization process in a human-understandable visual way.
This is a crucial point yet often overlooked in privacy.
Background: The representation learning problem is formulated as a game among six players: an encoder E , a decoder D , a target predictor T , a sensitive attribute predictor S , two adversarial classiﬁers ˜T and ˜S .
Whereas the non-adversarial predictors enforce the utility and the presence of the associated information in the representation, the adversarial predictors inhibit the undesirable information leakage and are directly responsible for disentanglement and sanitization of the representation.
What is more, as the adversarial classiﬁers are learned during training, they act as surrogate adversaries for unknown oracle post-classiﬁers.
The setup involves observational input x ∈ X , M target attributes t ∈
A T =
A 1 × A 2 ...
A M , each having m t classes A t = { a 1 , ..., a m t } , and a sensitive attribute s ∈ A S
= { 1 , ..., N } of N classes.
The goal is to yield data representations from an encoder subject to privacy constraints.
To learn the representation, a VAE is learned jointly along with several predictors.
VAEs naturally decompose into two components – an encoder and a decoder.
The encoder z ∼ q ( z | x ; θ E ) :
X → Z , parameterized by θ E produces an embedding z in the latent space Z .
For the sake of privacy, we employ a modﬁed VAE encoder.
Speciﬁcally, we propose an encoder that splits the generated representation into two parts: z tar ∈ Z 1 represents the target part and residual part
z ∈ Z 2 .
Concatenating the target and the residual parts z =
[ z tar | z res
] ∈ Z 1 ×
Z 2 yields again the complete representation.
For the following, we assume w.l.o.g.
the target and the residual part of being of equal dimensionality.
Encoding of the representation entails a stack of shared initial layers that diverge into parallel stacks from the penultimate layer onward into two separate network streams for disentangling the information.
To this end, we let z tar ∼ q tar ( z tar | x ; θ tarE ) :
X → Z 1 denote the encoder of the target representation stream and the encoder of the z res ∼ q res ( z res | x ; θ resE ) :
X → Z 2 the residual stream, respectively.
Given the two encoding streams (with partially shared parameters), θ tarE ⊂ θ E and θ resE ⊂ θ E denoting the parameters of the networks stream.
Given the common parameters in the shared stack , θ tarE ∩ θ resE (cid:54) = ∅ .
The second component in the VAE, the decoder is given by x ∼ p ( x | z ; θ D ) :
Z → X , which seeks to reconstruct the observational input, and is parameterized by θ D .
Next, we deﬁne the predictors for the target and sensitive attributes.
First, the target predictor is given as p T ( t | z tar ; θ tar ) :
Z 1 → A T .
Second, the sensitive attribute predictors is given as p S ( s | z res ; θ res ) :
Z 2 → A S , parameterized by θ tar and θ res .
Last, we have the associated adversarial predictors denoted as ˜ p T ( t | z res ; ˜ θ res ) :
Z 2 → A T and ˜ p S ( s | z tar ; ˜ θ tar ) :
Z 1 → A S , parameterized by ˜ θ tar and ˜ θ res .
Note, that the difference between predictors and their adversary is their swapped input source.
Optimization: Learning the representation formalizes as the optimization of multi-player nonzerosum game given as:
[Equation]
with φ ∗ ( . | . )
denoting the players, and λ, α ∗ , β ∗ ∈ R weighting scalars.
The hyperparameters allow for a trade-off between the utility of target classiﬁcation and the latent code’s privacy preservation.
The associated process schematic is shown in Fig.
As the predictors and the adversarial predictors have a competitive relationship, they are optimized differently.
Whereas predictors are trained using cross-entropy minimization, the adversarial predictors seek to maximize entropy, which will be
[Figure]
explained in the forthcoming sections.
The latent space should be disentangled at the equilibrium of this minimax game
[Figure]
yielding the representation with the desired privacy sanitization properties.
3. A DVERSARIAL R EPRESENTATION L EARNING
In the following
[Figure]
we will deﬁne the optimization criterion for each player.
First
[Figure]
we explain the predictors, followed by the reconstruction, and conclude with the adversarial classiﬁers’ optimization, notably sanitization and herein focal entropy.
Reconstruction: Leveraging VAE as backbone, optimization of φ ED entails minimization of Evidence Lower Bound (ELBO).
The ELBO is deﬁned as:
[Equation]
which decomposes into two parts.
The ﬁrst term corresponds to the reconstruction likelihood measuring the error in input reconstruction.
The second term corresponds to the prior constraint, where we assume isotropic Gaussian as latent prior p ( z ) =
N (0 , I ) , with I denoting the identity matrix.
Furthermore, we assume the posterior approximates to correspond multivariate Gaussians.
Given two separate encoding streams, one for the target and the residual part, we yield: q tar ( z tar | x ; θ tarE ) =
N ( µ tar , diag( σ tar )) and q res ( z res | x ; θ resE ) = N ( µ res , diag( σ res )) , with µ ∈ R h and diag( σ ) ∈
R h × h
the diagonal matrix constructed from vector σ ∈ R h .
Predictors: The predictors are all modeled as conditional distributions.
They are trained by:
[Equation]
where p ( t | x ) and p ( s | x ) denote the ground-truth labels for training input x for the target attribute and the sensitive attribute, respectively.
D KL ( . (cid:107) . ) denotes the Kullback-Leibler divergence.
Sanitization:
In order to minimize the information leakage across representation partitions, we leverage the maximization of entropy.
This enforces the representation to be maximally ignorant w.r.t.
attributes in the domain confusion sense.
Speciﬁcally, for the adversarial target attribute, we let
[Equation]
where U denotes the uniform distribution.
Although maximization of entropy is sufﬁcient for non-private attributes to minimize information leakage across representation partitions, we postulate that proper sanitization must be conducted w.r.t.
to focus classes in a similarity-aware fashion.
As such, we aim to sanitize the information of each observation within a focus area, i.e., nearest neighbors (NN).
For each observation, the NNs share the most commonalities in features.
As such, discrimination w.r.t.
NNs is less likely to be trivially achievable.
To this end, training of φ ˜ S ( θ E , ˜ θ tar ) leverages a modiﬁcation of entropy for deep sanitization.
3. F OCAL E NTROPY
Focal entropy aims at deep sanitization of sensitive information by leveraging a notion of similarity in terms of the sensitive attribute.
To this end, it requires partitioning the sensitive attribute into two sets w.r.t.
mutual discriminativeness: “ similar ” classes (A) “ dissimilar ” classes (B).
This partitioning is input speciﬁc and is conducted either according to a) label information, or b) using some scoring function obtained using a pre-trained model or “ on-the-ﬂy ” during training.
Thus, let r be the scores given the observational input x , with class predictions given by the index with maximal score, i.e., p ( y | x ; θ )
= p ( r ) ∈ arg max r .
Then “ similar ” consists of the set of labels corresponding to the k -largest scores, and “ dissimilar ” the complement:
[Equation]
Here r [ k ] denotes the k -th largest element of r , and A ( k ) S denotes the set of k distinct elements in A S .
Furthermore, we let N A , N B denote to the number of classes in A and B , where typically N A (cid:28) N B holds and N = N A + N B .
Given the just deﬁned notion of similarity, focal entropy aims at establishing uniformity in terms of likelihood (w.r.t.
the sensitive attribute) within each group – with the probability mass divided equally between the two groups (A) and (B).
Given N A (cid:54) =
N B , this implies reciprocal re-weighting of the classes in A and B , respectively.
Assuming N A (cid:28) N B , this aims at giving proportionally more weight to confusion w.r.t.
members of similar classes.
Analogously, members of dissimilar classes are down-weighted accordingly.
Consequently, the classiﬁer is forced to be maximally ignorant w.r.t.
class properties of the similar class members that share high correlation.
The feature representation produced from the encoder should not have any sensitive information in the target part.
As this approach implicitly is driving sanitization by focusing on speciﬁc targets, we refer to this as “ focal entropy ”.
Implementation of the focal entropy criterion is essentially equivalent to maximization w.r.t.
an off-centered entropy Lallich et al.
(2007) in the special case of normalized uniform probability within each group.
That is, in contrast to conventional entropy that takes its maximal value when the distribution of the class variable is uniform ( 1 N , ..., 1 N ) =
U , focal-entropy takes its maximum non-centered.
See Fig.
2 for the schematic illustration of the proposed concept.
Speciﬁcally, focal entropy seeks to have the entropy peak at τ ∈ R N , with τ (cid:54) =
U .
Assuming equally divided probability mass, we yield τ deﬁned as:
[Equation]
Further, let h ( . )
denote the entropy w.r.t.
a vector p =
( p 1 , ..., p N ) ∈ R N of probabilities with (cid:80)
Ni p i = 1 deﬁned as h ( p ) =
(cid:80) Nj =
p j log p j .
In order to achieve entropy achieving its maximum at τ , the class probabilities p have to be transformed.
To that end, each p i ∈ [0 , 1] is mapped to a corresponding π j , according to:
[Equation]
In order to fulﬁll the properties of an entropy, the π j have to be normalized subsequently.
This is achieved according to π j · ( (cid:80) Ni π i ) − 1 = π ∗ j .
Thus we yield the off-centered entropy η ( . ) of probabilities p deﬁned as η ( p ) =
h ( π ∗ ) =
− (cid:80) Nj =
π j log π j .
Consequently, adversarial sanitization seeks to maximize the off-centered entropy w.r.t.
private attribute on z tar according to:
[Equation]
9) with σ ˜ S
z tar ∈ R N denoting the softmax vector of the adversarial predictor ˜ p S ( y | z tar ; ˜ θ tar ) .
Maximizing the off-centered entropy is analogous to minimizing the Kullback-Leibler divergence w.r.t.
τ , such that we yield:
[Equation]
[Table]
Jha
[Table] [Table]
& Birodkar
[Table] [Table]
[Table]
Bouchacourt
[Table] [Table]
Liu
[Table] [Table]
[Table] [Table]
It should be noted that focal entropy contrasts with conventional entropy in terms of promoting hub formation.
Here a hub relates to the adversarial mapping of multiple sensitive “similar” entities, i.e.,
IDs for CelebA, to the same “target”.
Essentially, entropy drives for equiprobability of classes and suppresses the formation of hubs, whereas focal entropy enforces the collapse of “ similar ” sensitive entities on the same hub.
Hence, entropy induces a bijective mapping due to its invariance to random relabeling, whereas focal entropy induces a surjective mapping w.r.t.
hubs.
It should be noted that surjective mappings give rise to a loss of information as the input is not guaranteed to be recovered through inversion Nielsen et al.
E XPERIMENTS
Setup: We experimentally validate the proposed method using two datasets, which exhibit different characteristics.
First, the algorithm is tested on CIFAR-100 Krizhevsky (2009) dataset.
It consists of 100 classes, grouped into 20 superclasses.
The classes are (theoretically) entirely mutually exclusive, such that each item is associated with precisely one ﬁne-grained category belonging to one coarse superclass.
In the privacy setting, the encoder is forced to learn a representation that is superclass aware while not revealing any information about the ﬁne-grained classes.
Second, the CelebA dataset of celebrity face images Guo et al.
This dataset contains a large number of identities (people) with multiple observations of each.
The “in-the-wild” nature of face images offers a richer testbed for our method as both identities, and contingent factors are signiﬁcant sources of variation.
Furthermore, the class structure does not permit a well-deﬁned separation between public and private spaces.
Implementation Details: We employ Stochastic Gradient Descent (SGD) with momentum 0 .
9 and weight-decay of 1e − 4 and a batch size of 200 , with a learning rate of 0 . 01 .
Furthermore, we employ learning rate decay at every 30th epoch by a factor of 0 . 1 .
On CelebA, to learn target and adversary classiﬁers smoothly, we perform pre-training without adversary objective for 100 epochs.
This allows us to learn a stable representation crucial for gentle modiﬁcation, i.e., disentangling the information of the sensitive and the target variable.
Subsequently, the model is trained for another 1200 epochs, allowing for a slow “burn-in” of adversary objectives such it cannot be undone.
On CIFAR-100, the model is trained for 3000 epochs.
As for the trade-off parameters of Eq. 1, we employ the following scheme
CIFAR: equal weights for target loss and adversary: α S = α T = 1 , β T = β S = 1 , NN size of 5 .
CelebA: weighting according to number of objectives α T = 140 , α S = 1 . 0 , β T = 140 , β S = 1 . 0 .
For reconstructing weighting
we
always
assume λ = 1 . 0 .
For grouping in focal entropy
we assume the k − NN size of k = 16 .
[Figure]
4. P RIVACY S ANITIZATION A NALYSIS
We evaluated the privacy sanitization in terms of target and adversarial accuracy on two benchmarks:
CIFAR-100: As the ﬁrst testbed, we adopt the “simulated” privacy problem proposed by Roy &
Boddeti (2019) designed on the CIFAR-100 dataset.
We treat the coarse (superclass) and ﬁne (class) labels as the target and sensitive attribute, respectively.
The task is to learn the superclasses’ features while not revealing the information about the underlying classes.
Here we note that “ideally” we desire a predictor accuracy of 100%, an adversary accuracy of 1% (random chance for 100 classes).
In Tab. 1, we report the accuracy achieved by the attribute predictor and adversary.
From these results, we observe that with our proposed method, the representation achieves the best target accuracy while being comparable on adversary accuracy compared to the SOTA sanitization methods Roy & Boddeti (2019); Sadeghi et al.
Using conventional entropy for adversary instead of our proposed focal entropy results in a signiﬁcant performance drop (from 82% to 70% in terms of target accuracy at comparable adv. accuracy).
In Fig.
3b, we report the characteristics of the proposed approach in terms of trade-off curves that portray the correlation between privacy and target utility.
We compared with the most relevant works to us: MaxEnt-ARL and ML-ARL from Roy & Boddeti (2019), Kernel-SARL Sadeghi et al.
, Orthogonal Disentangled Representations (ODR) from
Sarhan et al.
(2020), and vanilla baseline (No Privacy) without sanitization.
As can be seen, the higher the correlation to privacy, the higher appears the loss of accuracy at a high level of sensitive accuracy.
Furthermore, the proposed approach features a signiﬁcantly better utility trade-off in the high target-accuracy domain.
Additionally, to assess the effect of our proposed focal entropy in terms of the adversarial component, comparing it with conventional entropy.
We report the results in Tab. 2.
CelebA: As the second testbed, we adopt the CelebA dataset, which has a richer structure to be utilized for privacy while being less structured in terms of similarity.
Speciﬁcally, we treat the attribute labels as target and celebrity identity (i.e., ID) as the source of sensitive information.
The task is to learn to classify the attributes while not revealing the information about the identities.
We note that ideally, we desire a lower adversary accuracy ( < 0.001) compared to the previous case, as the number of ID classes is an order of magnitude higher.
In Tab. 1 we report the target/adversary accuracy.
We observe that the representation we learn achieves a higher target accuracy and lower adversary accuracy than the strong baseline ML-VAE Bouchacourt et al.
Using standard entropy instead of our proposed focal entropy in CelebA shows a considerable higher privacy leakage (namely, 0.061 and < 0.01) - see Tab. 2.
Moreover, to analyze the sanitization of privacy in the latent representation, we visualize the t-SNE of the target and residual parts of the representation in
Fig. 3a.
For visualization, a subset of 200 IDs was chosen randomly from the test set.
As can be seen, the private class associations appear random and cannot be recovered from the target part.
This contrasts sharply with the residual part, where common IDs form clusters, giving rise to a proper margin, conﬁrming our quantitative results in terms of target/adversary accuracy.
Additionally, we performed a probing experiment to assess the classiﬁer capacity’s dependency regarding the learned representation’s privacy leakage potential.
Speciﬁcally, we determined the adversarial accuracy on the learned representation w.r.t.
to the classiﬁer’s strength.
The strong probing classiﬁer has approximately double the proxy classiﬁer’s capacity that was used for training - see Tab. 3.
4. H UB A NALYSIS
This section provides an analysis of how the application of focal entropy, with its integration of the notion of k − NN, promotes the formation of “hubs”.
By varying the neighborhood size k , focal entropy manifests itself between two extremes: i)
Choosing a small k , focal entropy in the limit ( k = 1) approaches conventional entropy - no hubs are formed - remapping is a “ one-toone ” correspondence.
This can be attributed to conventional entropy being invariant to random relabeling, inducing a bijective mapping, giving rise to information preservation.
This is prone to sub-optimal solutions since the forced equalization of classes by disregarding semantic similarity of classes makes the model susceptible to ﬁnd shortcuts such as label swapping.
In this regard, target accuracy oscillations co-occurring with degenerate ID-remappings such uniformity across all labels or temporary collapse to very few hubs were observed.
ii) Choosing a large k , focal entropy promotes the formation of a single dominant hub, which is also referred to as the classical hubness problem.
This phenomenon is related to the convergence of pairwise similarities between elements to a constant as the space’s dimensionality increases Radovanovi ´ c et al.
(2010) (collapsing on a single hub/trivial solution).
The single hub then manifests itself as the favored result of queries Dinu et al.
(2014) - giving rise to trivial solutions rather than deep sanitization.
Choosing a non-extreme k leads to the formation of numerous equisized hubs, inducing a surjective mapping.
As the formation of multi-hubs coincides with a collapse, less information is required to establish a mapping.
Hence, this characteristic gives rise to information removal and is thus imperative for proper sanitization.
Figure 4 depicts the graphs induced by remapping for four different neighborhood conﬁgurations.
Analyzing the nodes’ average degree in the corresponding graphs, we observe a continuous decrease with growing neighborhood size k .
Speciﬁcally, starting with entropy and increasing the increasing k for focal entropy, we yield the average degrees of: 13 . 91 , 7 . 51 , 7 . 2 , and 3 . 0 .
C ONCLUSION
In this paper, an adversarial representation learning method is proposed to deal with a setting where the target and sensitive attributes are related to each other to a large extent.
Training the representation entails decomposition into a target and a residual part.
Here, the target part is shareable without privacy infringement and facilitates applicability for a target task.
In contrast, the residual part subsumes all the private non-shareable information.
Our proposed adversarial learning method employs focal entropy for deep sanitization of privacy from the representation.
Subsequently, our experiments conﬁrm that our proposed method learns sanitized data representations using a manageable level of supervision.
Future work will entail adaptive and “ on-the-ﬂy ” similarity grouping during training.
Ablation Analysis on Loss Components
To assess the contribution of each component of our objective function, we evaluated each module’s performance separately, gradually adding components: reconstruction loss, target classiﬁcation loss, adversary loss .
For that, we report the ablation study of the loss components on CelebA in Tab. 1.
Furthermore, Fig.
1a shows the dependency between adversarial accuracy and the number of training epochs.
As can be seen, beyond 1000 epochs, the adversarial accuracy drops below < 0 .
01 , nearing chance level.
[Figure]
Adversarial classiﬁer
training time depen- dency
[Figure]
Neighborhood Size
Focal entropy entails a notion of similarity tied to the integration of k − NN.
Here, we study the eﬀect of varying k on focal entropy and the associated the adversary accuracy.
See Fig.for a visualization of this relationship on the CelebA dataset.
As can be seen, the adversary accuracy has oscillatory behavior with various local minima, reaching optimum around k = 16 .
This can be attributed to the superpositioning of diﬀerent hubs, each exhibiting a diﬀerent similarity pattern.
Analysis of hub formation is explained in Sec.
4.2 in the main paper and Fig.
4 in the main paper.
[Figure]
Sanitization Convergence Behaviour
This section explores the behavior of standard entropy and the proposed focal entropy for sanitization.
Fig.
3 depicts the classiﬁcation performance during the training of diﬀerent classiﬁers involved in the minimax optimization scheme: target classiﬁer accuracy, adversarial sensitive attribute accuracy, and sensitive attribute accuracy.
As can be seen, employing standard entropy for sanitization results in re-occurring patterns of oscillations.
This can be attributed to degenerate/trivial solutions and “shortcuts”.
In contrast to that, focal entropy shows a relatively smooth convergence behavior.
More details on the behavior can be found in Sec.
4.2 in the main paper.
[Figure]
Probing Analysis with Strong Classifier
This section provides more detail on assessing the classiﬁer strength in terms of privacy leakage and the dependence on training time.
We thereby largely follow the protocol of Harsh Jha et al.
; Sadeghi et al.
Speciﬁcally, we employed a stronger post-classiﬁer (Tab.
3 in the main paper) compared to the one used for learning the representation.
The stronger post-classiﬁer is endowed with additional layer stack (see Tab.
6c for architectural details), trained for 100 epochs.
The results in Tab.
3 of the main paper suggest no signiﬁcant changes in target and adversarial accuracy.
Figure 1b extends these results, depicting the relationship w.r.t.
the number of epochs.
As can be seen, the diﬀerence between the strong and normal classiﬁer is largely constant, independent of the epoch.
[Table]
al
[Table]
loss
[Table]
[full]
[Table]
Extended Hub Analysis
This section provides a visually more detailed analysis of how the application of focal entropy promotes the formation of “hubs” (explained in Sec.
4.2 in the main paper).
To study that, we analyzed the identity remapping of IDs on the CelebA dataset.
Employing focal entropy results in a surjective ID confusion pattern by taking similar IDs into account for privacy sanitization.
5. Visualization of Hub Faces:
To study hubs’ semantics, we visualize the CelebA identities of the network corresponding to focal entropy with k − nearest neighborhood size k = 5 .
See Fig.
4 for the visualization of the hub faces.
As can be seen, the hubs exhibit a rich diversity in facial properties.
5. Adversarial Identity Mapping:
Figure 5 is a zoom-in version of a graph as shown in Fig.
4 in the main paper, with k − nearest neighborhood size k = 5 .
This visualization provides a more in-depth view of how the adversarial process leads to a remapping of identities.
In order to avoid visual clutter, a subset of identities and targets was chosen.
As can be seen, instead of being a collapse of a facial stereotype, each hub is associated with a diverse looking set of identities, giving rise to the deep sanitization of the representation.
Qualitative Results
Figure 7 shows diﬀerent reconstructions of additional CelebA identities (equal male and female) at diﬀerent privacy levels.
Each column is two diﬀerent samples from CelebA (one male and one female), and from top to bottom, the privacy disclosure is decreasing for each.
It can be noticed that visualizations from residual latent part and target latent parts conﬁrm the sanitization visually.
M o u t h _ S li g h t l y _
O p e n
S m ili n g
H i g h
C h
e e k b o n e s W a v y _
H a i r
O v a l _ F a c e B l a c k _ H a
i r W e a r i n g _ N e c k l a c e W e a r
i n g _ L i p s t
i c k H
e a v y _ M a k e u p N o _ B e a r d S i d e b u r n s G r a y _ H
a i r M u s t a c h e
B a l d
M a l e 0.
Low privacy
Intermediate privacy
High privacy
Low
High
Correlation 0.
Privacy Correlation 0.
N o r m .
- A cc u r a c y
Attribute-level Privacy Analysis
In Tab. 2 we report numerous statistics on CelebA attributes.
Speciﬁcally, we analyze the attribute classiﬁcation accuracy behavior w.r.t.
varying level of privacy of attributes.
To our knowledge, this is the ﬁrst exploration of attribute-level privacy-preserving representation learning algorithms on the Celeb-A dataset.
The rich correlation structure amongst all attributes makes this a challenging privacy dataset; i.e., it is diﬃcult to achieve high accuracy for non-private attributes and low accuracy for private ones.
Therefore representative subsets of the original attributes were chosen for a more in-depth analysis as indicated by the ﬁrst column in Tab. 2.
The subsets were chosen on the grounds of diﬀerent values of correlation with IDs, reﬂecting diﬀerent privacy levels of each and, as such, exhibiting “relatively unbiasedness” in terms of frequency within the dataset.
Each of the three subsets (low, intermediate, and high privacy, resp.) consists of 5 attributes.
Data statistics reported comprise normalized accuracy (w.r.t.
prior) of the classiﬁers trained on the target representation z tar , the ∆ -accuracy for each attribute corresponding to the diﬀerence of the accuracy between two classiﬁers — the one trained on z tar , and the one trained on z res .
The last but one column corresponds to the correlation between the level of “privateness” and each attribute.
As it can be seen in the table, the more unrelated a variable is to the identity, the higher gains in accuracy manifest.
Finally, the last column corresponds to the frequency (prior) of the attribute in the dataset.
For a visualization of the privacy-attribute correlation, see Fig.
As can be seen, the higher the correlation to privacy, the higher appears the loss in accuracy.
For example, privacy-revealing attributes such as gender and facial attributes strongly correlate, therefore exhibiting a signiﬁcant loss in accuracy.
In contrast, attributes related to temporal facial features such as gestures feature low privacy correlation and therefore achieve strong accuracy.
Conversely, the more unrelated a variable is to the identity, the higher gains in accuracy manifest.
Architectural Details
We describe the architectures of each part of our model.
Table 5 shows the architectures of the VAE, i.e., the encoder and the decoder.
It should be noted that the last two layers of the encoder in Tab. 3 arise from layer splitting to accommodate for partitioning target and residual representations.
This is highlighted with dashed lines.
Furthermore, we provide the architectures of classiﬁers in Tab. 6.
Architectures for target and adversarial classiﬁers are identical.
[Table] [Table]
[Table] [Table]
#attributes
[Table] [Table]
Layer
[Table]