F AIR A TTRIBUTE C OMPLETION ON G RAPH WITH M ISSING A TTRIBUTES
A BSTRACT
Tackling unfairness in graph learning models is a challenging task, as the unfairness issues on graphs involve both attributes and topological structures.
Existing work on fair graph learning simply assumes that attributes of all nodes are available for model training and then makes fair predictions.
In practice, however, the attributes of some nodes might not be accessible due to missing data or privacy concerns, which makes fair graph learning even more challenging.
In this paper, we propose FairAC, a fair attribute completion method, to complement missing information and learn fair node embeddings for graphs with missing attributes.
FairAC adopts an attention mechanism to deal with the attribute missing problem and meanwhile, it mitigates two types of unfairness, i.e., feature unfairness from attributes and topological unfairness due to attribute completion.
FairAC can work on various types of homogeneous graphs and generate fair embeddings for them and thus can be applied to most downstream tasks to improve their fairness performance.
To our best knowledge, FairAC is the first method that jointly addresses the graph attribution completion and graph unfairness problems.
Experimental results on benchmark datasets show that our method achieves better fairness performance with less sacrifice in accuracy, compared with the state-of-the-art methods of fair graph learning.
Code is available at https://github.com/donglgcn/FairAC.
I NTRODUCTION
Graphs, such as social networks, biomedical networks, and traffic networks, are commonly observed in many real-world applications.
A lot of graph-based machine learning methods have been proposed in the past decades, and they have shown promising performance in tasks like node similarity measurement, node classification, graph regression, and community detection.
In recent years, graph neural networks (GNNs) have been actively studied (Scarselli et al., 2008; Wu et al., 2020;
Jiang et al., 2019; 2020; Zhu et al., 2021c;b;a; Hua et al., 2020; Chu et al., 2021), which can model graphs with high-dimensional attributes in the non-Euclidean space and have achieved great success in many areas such as recommender systems (Sheu et al., 2021).
However, it has been observed that many graphs are biased, and thus GNNs trained on the biased graphs may be unfair with respect to certain sensitive attributes such as demographic groups.
For example, in a social network, if the users with the same gender have more active connections, the GNNs tend to pay more attention to such gender information and lead to gender bias by recommending more friends to a user with the same gender identity while ignoring other attributes like interests.
And from the data privacy perspective, it is possible to infer one’s sensitive information from the results given by GNNs (Sun et al., 2018).
In a time when GNNs are widely deployed in the real world, this severe unfairness is unacceptable.
Thus, fairness in graph learning emerges and becomes notable very recently.
Existing work on fair graph learning mainly focuses on the pre-processing, in-processing, and postprocessing steps in the graph learning pipeline in order to mitigate the unfairness issues.
The preprocessing approaches modify the original data to conceal sensitive attributes.
Fairwalk (Rahman et al., 2019) is a representative pre-processing method, which enforces each group of neighboring nodes an equal chance to be chosen in the sampling process.
In many in-processing methods, the most popular way is to add a sensitive discriminator as a constraint, in order to filter out sensitive information from original data.
For example, FairGNN (Dai & Wang, 2021) adopts a sensitive classifier to filter node embeddings.
CFC (Bose & Hamilton, 2019) directly adds a filter layer to deal with unfairness issues.
The post-processing methods directly force the final prediction to satisfy fairness constraints, such as (Hardt et al., 2016).
When the graphs have complete node attributes, existing fair graph learning methods could obtain promising performance on both fairness and accuracy.
However, in practice, graphs may contain nodes whose attributes are entirely missing due to various reasons (e.g., newly added nodes, and data privacy concerns).
Taking social networks as an example, a newly registered user may have incomplete profiles.
Given such incomplete graphs, existing fair graph learning methods would fail, as they assume all the nodes have attributes for model training.
Although FairGNN (Dai &
Wang, 2021) also involves the missing attribute problem, it only assumes that a part of the sensitive attributes are missing.
To the best of our knowledge, addressing the unfairness issue on graphs with some nodes whose attributes are entirely missing has not been investigated before.
Another relevant topic is graph attribute completion (Jin et al., 2021; Chen et al., 2020).
It mainly focuses on completing a precise graph but ignores the unfairness issues.
In this work, we aim to jointly complete a graph with missing attributes and mitigate unfairness at both feature and topology levels.
In this paper, we study the new problem of learning fair feature embeddings for graphs with missing attributes.
Specifically, we aim to address two major challenges: (1) how to obtain meaningful node embeddings for graphs with missing attributes, and (2) how to enhance fairness of node embeddings with respect to sensitive attributes.
To address these two challenges, we propose a fair attribute completion framework named FairAC.
For the first challenge, we adopt an autoencoder to obtain feature embeddings for nodes with attributes and meanwhile we adopt an attention mechanism to aggregate feature information of nodes with missing attributes from their direct neighbors.
Then, we address the second challenge by mitigating two kinds of unfairness, i.e., feature unfairness and topological unfairness.
We adopt a sensitive discriminator to regulate feature embeddings and create a bias-free graph.
The main contributions of this paper are as follows: (1) We present a new problem of achieving fairness on a graph with missing attributes.
Different from the existing work, we assume that the attributes of some nodes are entirely missing.
(2) We propose a new framework, FairAC, for fair graph attribute completion, which jointly addresses unfairness issues from the feature and topology perspectives.
(3) FairAC is a generic approach to complete fair graph attributes, and thus can be used in many graph-based downstream tasks.
(4) Extensive experiments on benchmark datasets demonstrate the effectiveness of FairAC in eliminating unfairness and maintaining comparable accuracy.
R ELATED W ORK 2. F AIRNESS IN G RAPH L EARNING
Recent work promotes fairness in graph-based machine learning (Bose & Hamilton, 2019; Rahman et al., 2019; Dai & Wang, 2021;
Wang et al., 2022).
They can be roughly divided into three categories, i.e., the pre-processing methods, in-processing methods, and post-processing methods.
The pre-processing methods are applied before training downstream tasks by modifying training data.
For instance, Fairwalk (Rahman et al., 2019) improves the sampling procedure of node2vec (Grover & Leskovec, 2016).
Our FairAC framework can be viewed as a pre-processing method, as it seeks to complete node attributes and use them as input of graph neural networks.
However, our problem is much harder than existing problems, because the attributes of some nodes in the graph are entirely missing, including both the sensitive ones and non-sensitive ones.
Given an input graph with missing attributes, FairAC generates fair and complete feature embeddings and thus can be applied to many downstream tasks, such as node classification, link prediction (LibenNowell & Kleinberg, 2007;
Taskar et al., 2003), PageRank (Haveliwala, 2003), etc.
Graph learning models trained on the refined feature embeddings would make fair predictions in downstream tasks.
There are plenty of fair graph learning methods as in-processing solutions.
Some work focus on dealing with unfairness issues on graphs with complete features.
For example, GEAR (Ma et al., 2022) mitigates graph unfairness by counterfactual graph augmentation and an adversarial learning method to learn sensitive-invariant embeddings.
However, in order to generate counterfactual subgraphs, they need precise and entire features for every node.
In other words, it cannot work well if it encounters a graph with full missing nodes since it cannot generate counterfactual subgraph based on a blank node.
But we can deal with the situation.
The most related work is FairGNN (Dai &
Wang, 2021).
Different from the majority of problem settings on graph fairness.
It learns fair GNNs for node classification in a graph where only a limited number of nodes are provided with sensitive attributes.
FairGNN adopts a sensitive classifier to predict the missing sensitive labels.
After that, it employs a classic adversarial model to mitigate unfairness.
Specifically, a sensitive discriminator aims to predict the known or estimated sensitive attributes, while a GNN model tries to fool the sensitive discriminator and meanwhile predicts node labels.
However, it cannot predict sensitive information if a node misses all features in the first place and thus will fail to achieve its final goal.
Our FairAC can get rid of the problem because we recover the node embeddings from their neighbors.
FairAC learns attention between neighbors according to existing full attribute nodes, so we can recover the node embeddings for missing nodes from their neighbors by aggregating the embeddings of neighbors.
With the help of the adversarial learning method, it can also remove sensitive information.
In addition to attribute completion, we have also designed novel de-biasing strategies to mitigate feature unfairness and topological unfairness.
2. A TTRIBUTION C OMPLETION ON G RAPHS
The problem of missing attributes is ubiquitous in reality.
Several methods (Liao et al., 2016;
You et al., 2020; Chen et al., 2020; He et al., 2022; Jin et al., 2021; 2022;
Tu et al., 2022; Taguchi et al., 2021) have been proposed to address this problem.
GRAPE (You et al., 2020) tackles the problem of missing attributes in tabular data using a graph-based approach.
SAT (Chen et al., 2020) assumes that the topology representation and attributes share a common latent space, and thus the missing attributes can be recovered by aligning the paired latent space.
He et al.
(2022) and Jin et al.
(2021) extend such problem settings to heterogeneous graphs.
HGNN-AC (Jin et al., 2021) is an end-to-end model, which does not recover the original attributes but generates attribute representations that have sufficient information for the final prediction task.
It is worth noting that existing methods on graph attribute completion only focus on the attribute completion accuracy or performance of downstream tasks, but none of them takes fairness into consideration.
Instead, our work pays attention to the unfairness issue in graph learning, and we aim to generate fair feature embeddings for each node by attribute completion, which contain the majority of information inherited from original attributes but disentangle the sensitive information.
M ETHODOLOGY 3. P ROBLEM D EFINITION
Let G =
( V , E , X ) denote an undirected graph, where V = { v 1 , v 2 , ..., v N } is the set of N nodes,
E ⊆
V × V is the set of undirected edges in the graph, X ∈ R N × D is the node attribute matrix, and D is the dimension of attributes.
A ∈ R N × N is the adjacency matrix of the graph G , where
A ij = 1 if nodes v i and v j are connected; otherwise, A ij = 0 .
In addition, S = { s 1 , s 2 , ..., s N }
Input : G =
( V , E , X ) , S
Output :
Autoencoder f AE ,
Sensitive classifier
C s ,
Attribute completion f AC 1: Obtain topological embedding T with DeepWalk 2: repeat 3:
Obtain the feature embeddings H with f AE 4:
Optimize the C s by Equation5:
Optimize f AE to mitigate feature unfairness by loss L F 6:
Divide V + into V keep and V drop based on α 7:
Obtain the feature embeddings of nodes with missing attributes V drop by f AC 8:
Optimize f AC to achieve attribute completion by loss L C 9:
Optimize f AC to mitigate topological unfairness by loss L T 10: until convergence 11: return f AE , C s , f AC denotes a set of sensitive attributes (e.g., age or gender) of N nodes, and Y =
{ y 1 , y 2 , ..., y N } denotes the node labels.
The goal of fair graph learning is to make fair predictions of node labels with respect to the sensitive attribute, which is usually measured by certain fairness notations like statistical parity (Dwork et al., 2012) and equal opportunity (Hardt et al., 2016).
Statistical Parity and Equal Opportunity are two group fairness definitions.
Their detailed formulations are presented below.
The label y denotes the ground-truth node label, and the sensitive attribute s indicates one’s sensitive group.
For example, for binary node classification task, y only has two labels.
Here we consider two sensitive groups, i.e. s ∈ { 0 , 1 } .
• Statistical Parity (Dwork et al., 2012).
It refers to the equal acceptance rate, which can be formulated
as:
[Equation]
where P ( · ) denotes the probability that · occurs.
• Equal Opportunity
(Hardt et al., 2016).
It means the probability of a node in a positive class being classified as a positive outcome should be equal for both sensitive group nodes.
It mathematically requires an equal true positive rate for each subgroup.
[Equation]
In this work, we mainly focus on addressing unfairness issues on graphs with missing attributes, i.e., attributes of some nodes are totally missing.
Let V + denote the set of nodes whose attributes are available, and V − denote the set of nodes whose attributes are missing,
V =
{V + , V − } .
If v i ∈ V − , both X i and s i are unavailable during model training.
With the notations given below, the fair attribute completion problem is formally defined as:
Problem 1 .
Given a graph G =
( V , E , X ) , where node set V + ∈ V with the corresponding attributes available and the corresponding sensitive attributes in S , learn a fair attribute completion model to generate fair feature embeddings H for each node in V , i.e.,
[Equation]
where f is the function we aim to learn.
H should exclude any sensitive information while preserve non-sensitive information.
3. F AIR A TTRIBUTE C OMPLETION (F AIR AC) F RAMEWORK
We propose a fair attribute completion (FairAC) framework to address Problem 1.
Existing fair graph learning methods tackle unfairness issues by training fair graph neural networks in an endto-end fashion, but they cannot effectively handle graphs that are severely biased due to missing attributes.
Our FairAC framework, as a data-centric approach, deals with the unfairness issue from a new perspective, by explicitly debiasing the graph with feature unfairness mitigation and fairnessaware attribute completion.
Eventually, FairAC generates fair embeddings for all nodes including the ones without any attributes.
The training algorithms are shown in Algorithm 1.
To train the graph attribute completion model, we follow the setting in (Jin et al., 2021) and divide the nodes with attributes (i.e., V + ) into two sets: V keep and V drop .
For nodes in V keep , we keep their attributes, while for nodes in V drop , we temporally drop their attributes and try to recover them using our attribute completion model.
Although the nodes are randomly assigned to V keep and V drop , the proportion of V drop is consistent with the attribute missing rate α of graph G , i.e., α = |V − | |V| =
|V drop | |V
+ | .
Different from existing work on fair graph learning, we consider unfairness from two sources.
The first one is from node features.
For example, we can roughly infer one’s sensitive information, like gender, from some non-sensitive attributes like hobbies.
It means that non-sensitive attributes may imply sensitive attributes and thus lead to unfairness in model prediction.
We adopt a sensitive discriminator to mitigate feature unfairness.
The other source is topological unfairness introduced by graph topological embeddings and node attribute completion.
To deal with the topological unfairness, we force the estimated feature embeddings to fool the sensitive discriminator, by updating attention parameters during the attribute completion process.
As illustrated in Figure 1, our FairAC framework first mitigates feature unfairness for nodes with attributes (i.e., V keep ) by removing sensitive information implicitly contained in non-sensitive attributes with an auto-encoder and sensitive classifier (Section 3.2.1).
For nodes without features (i.e., V drop ), FairAC performs attribute completion with an attention mechanism (Section 3.2.2) and meanwhile mitigates the topological unfairness (Section 3.2.3).
Finally, the FairAC model trained on V keep and V drop can be used to infer fair embeddings for nodes in V − .
The overall loss function of FairAC is formulated as:
[Equation]
where L F represents the loss for mitigating feature unfairness, L C is the loss for attribute completion, and L T is the loss for mitigating topological unfairness.
β is a trade-off hyperparameter.
3.2. M ITIGATING FEATURE UNFAIRNESS
The nodes in V keep have full attributes X , while some attributes may implicitly encode information about sensitive attributes S and thus lead to unfair predictions.
To address this issue, FairAC aims to encode the attributes X ⟩ of node i into a fair feature embedding H i .
Specifically, we use a simple autoencoder framework together with a sensitive classifier.
The autoencoder maps X i into embedding H i , and meanwhile the sensitive classifier C s is trained in an adversarial way, such that the embeddings are invariant to sensitive attributes.
Autoencoder.
The autoencoder contains an encoder f E and a decoder f D .
f E encodes the original attributes X i to feature embeddings
H i , i.e., H i =
f E ( X i ) , and f D reconstructs attributes from the latent embeddings, i.e., ˆ X i =
f D ( H i ) , where the reconstructed attributes ˆ X should be close to X i as possible.
The loss function of the autoencoder is written as:
[Equation]
Sensitive classifier
The sensitive classifier C s is a simple multilayer perceptron (MLP) model.
It takes the feature embedding H i as input and predicts the sensitive attribute ˆ s i , i.e., ˆ s i
=
C s ( H i ) .
When the sensitive attributes are binary, we can use the binary cross entropy loss to optimize C s :
[Equation]
With the sensitive classifier C s , we could leverage it to adversarially train the autoencoder, such that f E is able to generate fair feature embeddings that can fool C s .
The loss L F is written as:
L F = L ae − β L C s .
3.2. C OMPLETING NODE EMBEDDINGS VIA ATTENTION MECHANISM
For nodes without attributes ( V drop ), FairAC makes use of topological embeddings and completes the node embeddings H drop with an attention mechanism.
Topological embeddings.
Recent studies reveal that the topology of graphs has similar semantic information as the attributes (Chen et al., 2020; McPherson et al., 2001;
Pei et al., 2020; Zhu et al., 2020).
Inspired by this observation, we assume that the nodes’ topological information can reflect the relationship between nodes’ attributes and the attributes of their neighbors.
There are a lot of off-the-shelf node topological embedding methods, such as DeepWalk (Perozzi et al., 2014) and node2vec (Grover & Leskovec, 2016).
For simplicity, we adopt the DeepWalk method to extract topological embeddings for nodes in V .
Attention mechanism.
For graphs with missing attributes, a commonly used strategy is to use average attributes of the one-hop neighbors.
This strategy works in some cases, however, simply averaging information from neighbors might be biased, as the results might be dominated by some high-degree nodes.
In fact, different neighbors should have varying contributions to the aggregation process in the context of fairness.
To this end, FairAC adopts an attention mechanism (Vaswani et al., 2017) to learn the influence of different neighbors or edges with the awareness of fairness, and then aggregates attributes information for nodes in V drop .
Given a pair of nodes ( u, v ) which are neighbors, the contribution of node v is the attention att u,v , which is defined as: att u,v = Attention ( T u , T v ) , where T u , T v are the topological embeddings of nodes u and v , respectively.
Specifically, we only focus on the neighbor pairs and ignore those node pairs that are not directly connected.
Attention ( · , · ) denotes the attention between two topological embeddings, i.e., Attention ( T u , T v )
=
σ ( T Tu WT v ) , where W is the learnable parametric matrix, and σ is an activation function.
After we get all the attention scores between one node and its neighbors, we can get the coefficient of each pair by applying the softmax function:
[Equation]
where c u,v is the coefficient of node pair ( u, v ) , and N u is the set of neighbors of node u .
For node u ,
FairAC calculates its feature embedding ˆ H u by the weighted aggregation with multi-head attention:
[Equation]
where K is the number of attention heads.
The loss for attribute completion with topological embedding and attention mechanism is formulated as:
[Equation]
[Equation]
M ITIGATING TOPOLOGICAL UNFAIRNESS
The attribute completion procedure may introduce topological unfairness since we assume that topology information is similar to attributes relation.
It is possible that the completed feature embeddings of V drop would be unfair with respect to sensitive attributes S .
To address this issue,
FairAC leverages sensitive classifier C s to help mitigate topological unfairness by further updating the attention parameter matrix W and thus obtaining fair feature embeddings H .
Inspired by (Gong et al., 2020), we expect that the feature embeddings can fool the sensitive classifier C s to predict the probability distribution close to the uniform distribution over the sensitive category, by minimizing the loss: [Equation]
[Equation]
F AIR AC FOR N ODE C LASSIFICATION
The proposed FairAC framework could be viewed as a generic data debiasing approach, which achieves fairness-aware attribute completion and node embedding for graphs with missing attributes.
It can be easily integrated with many existing graph neural networks (e.g., GCN (Kipf & Welling, 2016), GAT (Veliˇckovi´c et al., 2018), and GraphSAGE (Hamilton et al., 2017)) for tasks like node classification.
In this work, we choose the basic GCN model for node classification and assess how
FairAC enhances model performance in terms of accuracy and fairness.
[Table]
E XPERIMENTS
In this section
[Table]
we evaluate the performance of the proposed FairAC framework on three benchmark datasets in terms of node classification accuracy and fairness w
[Table]
r
[Table]
t. sensitive attributes.
We compare
FairAC with other baseline methods in settings with various sensitive attributes or different attribute missing rates.
Ablation studies are also provided and discussed.
4. D ATASETS AND S ETTINGS
Datasets.
In the experiments, we use three public graph datasets, NBA , Pokec-z , and Pokec-n .
A detailed description is shown in supplementary materials.
Baselines.
We compare our FairAC method with the following baseline methods: GCN (Kipf &
Welling, 2016), ALFR (Edwards & Storkey, 2015), ALFR-e, Debias (Zhang et al., 2018), Debiase, FCGE (Bose & Hamilton, 2019)
[Table]
and FairGNN (Dai & Wang, 2021).
ALFR-e concatenates the feature embeddings produced by ALFR with topological embeddings learned by DeepWalk (Perozzi et al., 2014).
Debias-e also concatenates the topological embeddings learned by DeepWalk with feature embeddings learned by Debias.
FairGNN is an end-to-end debias method which aims to mitigate unfairness in label prediction task.
GCN and FairGNN uses the average attribute completion method, while other baselines use original complete attributes.
Evaluation Metrics.
We evaluate the proposed framework with respect to two aspects: classification performance and fairness performance.
For classification, we use accuracy and AUC scores.
As for fairness, we adopt ∆ SP and ∆ EO as evaluation metrics, which can be defined as:
[Equation]
The smaller ∆ SP and ∆ EO are, the more fair the model is.
In addition, we use ∆ SP + ∆ EO as an overall indicator of a model’s performance on fairness.
[Table]
4. R ESULTS AND A NALYSIS 4.2. U NFAIRNESS ISSUES IN G RAPH N EURAL N ETWORKS
According to the results showed in Table 1, they reveal several unfairness issues in Graph Neural
Networks.
We divided them into two categories.
• Feature unfairness Feature unfairness is that some non-sensitive attributes could infer sensitive information.
Hence, some Graph Neural Networks may learn this relation and make unfair prediction.
In most cases, ALFR and Debias and FCGE have better fairness performance than GCN method.
It is as expected because the non-sensitive features may contain proxy variables of sensitive attributes which would lead to biased prediction.
Thus, ALFR and Debias methods that try to break up these connections are able to mitigate feature unfairness and obtain better fairness performance.
These results further prove the existence of feature unfairness.
• Topological unfairness
Topological unfairness is sourced from graph structure.
In other words, edges in graph, i e. the misrepresentation due to the connection(Mehrabi et al., 2021) can bring topological unfairness.
From the experiments, ALFR-e and Debias-e have worse fairness performance than ALFR and Debias, respectively.
It shows that although graph structure can improve the classification performance, it will bring topological unfairness consequently.
The worse performance on fairness verifies that topological unfairness exists in GNNs and graph topological information could magnify the discrimination.
4.2. E FFECTIVENESS OF F AIR AC ON MITIGATING FEATURE AND TOPOLOGICAL UNFAIRNESS
The results of our FairAC method and baselines in terms of the node classification accuracy and fairness metrics on three datasets are shown in Table 1.
The best results are shown in bold.
Generally speaking, we have the following observations.
The proposed method FairAC shows comparable classification performance with these baselines, GCN and FairGNN.
This suggests that our attribute completion method is able to preserve useful information contained in the original attributes.
FairAC outperforms all baselines regarding fairness metrics, especially in ∆ SP + ∆ EO .
FairAC outperform baselines that focus on mitigate feature fairness, like ALFR, which proves that FairAC also mitigate topological unfairness.
Besides, it is better than those who take topological fairness into consideration, like FCGE, which also validates the effectiveness of FairAC.
FairGNN also has good performance on fairness, because it adopts a discriminator to deal with the unfairness issue.
Our method performs better than FairGNN in most cases.
For example, our FairAC method can significantly improve the performance in terms of the fairness metric ∆ SP +∆ EO , i.e., 65 % , 87 % , and 67 % improvement over FairGNN on the NBA, pokec-z, pokec-n datasets, respectively.
Overall, the results in Table 1 validate the effectiveness of FairAC in mitigating unfairness issues.
4. A BLATION S TUDIES
Attribute missing rate In our proposed framework, the attribute missing rate indicates the integrity of node attribute matrix, which has a great impact on model performance.
Here we investigate the performance of our FairAC method and baselines on dealing with graphs with varying degrees of missing attributes.
In particular, we set the attribute missing rate to 0.1, 0.3, 0.5 and 0.8, and evaluate
FairAC and baselines on the pokec-z dataset.
The detailed results are presented in Table 2.
From the table, we have the following observation that with varying values of α , FairAC is able to maintain its high fairness performance.
Especially when α reaches 0.8, FairAC can greatly outperform other methods.
It proves that FairAC is effective even if the attributes are largely missing.
The effectiveness of adversarial learning A key module in FairAC is adversarial learning, which is used to mitigate feature unfairness and topological unfairness.
To investigate the contribution of adversarial learning in FairAC, we implement a BaseAC model, which only has the attention-based attribute completion module, but does not contain the adversarial learning loss terms.
Comparing
BaseAC with FairAC in Table 2, we can find that the fairness performance drops desperately when the adversarial training loss is removed.
Since BaseAC does not have an adversarial discriminator to regulate feature encoder as well as attribute completion parameters, it is unable to mitigate unfairness.
Overall, the results confirm the effectiveness of the adversarial learning module
Parameter analysis We investigate how the hyperparameters affect the performance of FairAC.
The most important hyperparameter in FairAC is β , which adjusts the trade-off between fairness and attribute completion.
We report the results with different hyperparameter values.
We set β to 0.2, 0.4, 0.7, 0.8 and 0 that is equivalent to the BaseAC.
We also fix other hyperparameters by setting α to 0.3.
As shown in Figure 2, we can find that, as β increases, the fairness performance improves while the accuracy of node classification slightly declined.
Therefore, it validates our assumption that there is a tradeoff between fairness and attribute completion, and our FairAC is able to enhance fairness without compromising too much on accuracy.
C ONCLUSIONS
In this paper, we presented a novel problem, i.e., fair attribute completion on graphs with missing attributes.
To address this problem, we proposed the FairAC framework, which jointly completes the missing features and mitigates unfairness.
FairAC leverages the attention mechanism to complete missing attributes and adopts a sensitive classifier to mitigate implicit feature unfairness as well as topological unfairness on graphs.
Experimental results on three real-world datasets demonstrate the superiority of the proposed FairAC framework over baselines in terms of both node classification performance and fairness performance.
As a generic fair graph attributes completion approach,
FairAC can also be used in other graph-based downstream tasks, such as link prediction, graph regression, pagerank, and clustering.
A CKNOWLEDGEMENT
A A PPENDIX A. D ATASETS AND S ETTINGS
Datasets.
In the experiments, we use three public graph datasets, NBA , Pokec-z , and Pokec-n .
The detailed explanation is shown in supplementary materials.
The NBA dataset (Dai & Wang, 2021) is extended from a Kaggle dataset containing around 400 NBA basketball players.
It provides the performance statistics of those players in the 2016-2017 season and their personal profiles, e.g., nationality, age, and salary.
Their relationships are obtained from Twitter.
We use their nationality, whether one is U.S. player or oversea player, as the sensitive attribute.
The node label is binary, indicating whether the salary of the player is over median or not.
Pokec (Takac & Zabovsky, 2012) is an online social network in Slovakia, which contains millions of anonymized data of users.
It has a variety of attributes, such as gender, age, education, region, etc.
Based on the region where users belong to, (Dai & Wang, 2021) sampled two datasets named as: Pokec-z and Pokec-n. In our experiments, we consider the region or gender as sensitive attribute, and working field as label for node classification.
The statistics of three datasets are summarized in supplementary materials.
The statistics of three datasets are summarized in Table 3.
Baselines.
We compare our FairAC method with the following baseline methods:
• GCN (Kipf & Welling, 2016) with average attribute completion.
GCN is a classical graph neural network model, which has obtained very promising performance in numerous applications.
The standard GCN cannot handle graphs with missing attributes.
In the experiments, we use the average attribute completion strategy to preprocess the feature matrix, by using the averaged attributes of one’s neighbors to approximate the missing attributes.
After average attribute completion, GCN takes the graph with completed feature matrix as inputs to learn node embeddings and predict node labels.
• ALFR (Edwards & Storkey, 2015) with full attributes.
This is a pre-processing method.
It utilize a discriminator to remove the sensitive feature information in feature embeddings produced by an Autoencoder.
Since this method need full sensitive attributes and full features, we give them complete information.
In other words, the missing rate α is set to 0.
• ALFR-e with full attributes.
Based on ALFR, ALFR-e utilize the topological information.
It concatenates the feature embeddings produced by ALFR with topological embeddings learned by DeepWalk (Perozzi et al., 2014).
It also relys on complete information.
Debias (Zhang et al., 2018) with full attributes.
This is an in-processing method.
It applies a discriminator on node classifier in order to make the probability distribution be the same w.r.t.
sensitive attribute.
Since the discriminator needs the full sensitive attributes, we provide full node features.
• Debias-e with full attributes.
Similar to ALFR-e.
It also concatenates the topological embeddings learned by DeepWalk (Perozzi et al., 2014) with feature embeddings learned by Debias.
• FCGE (Bose & Hamilton, 2019) with full attributes.
It learns fair node embeddings in graph without node features through edge prediction only.
An discriminator is also applied to mitigate sensitive information in topological perspective.
• FairGNN (Dai & Wang, 2021) with average attribute completion.
Although FairGNN trains a sensitive attribute discriminator as an adversarial regularizer to enhance the fairness
[Table]
of GNNs
, it still cannot deal with graphs with missing attributes.
Thus [Table] we use the average attribute completion method to complete the feature matrix, and then train a FairGNN model for node classification.
Implementation Details.
Each dataset is randomly split into 75%/25% training/test set as (Dai & Wang, 2021).
Besides, we randomly drop node attributes based on the attribute missing rate, α , which means the attributes of α × |V| nodes will be unavailable.
For each datasets, we choose a specific attribute as the sensitive attribute.
In particular, region
[Table]
and nation are selected as the sensitive attribute for the pokec, and nba datasets, respectively.
Unless otherwise specified, we generate 128-dimension node embeddings and set the attribute missing rate α to 0.3, and set the hyperparameters of FairAC as: β = 1 for pokec-z and nba datasets, and β = 0 .
5 for pokec-n dataset.
We adopt Adam (Kingma & Ba, 2014) with the learning rate of 0 .
001 and weight decay as 1 e − 5 .
We adopt the DeepWalk (Perozzi et al., 2014) method to generate topological embedding for each node.
Specifically, we use the DeepWalk implementation provided by the Karate Club library (Rozemberczki et al., 2020).
We set walk length as 100, embedding dimension as 64, window size as 5, and epochs as 10.
To evaluate fairness of compared methods, we follow the widely used evaluation protocol in fair graph learning and set a threshold for accuracy, because there is a trade-off between accuracy and fairness.
Since we mainly focus on the fairness metric, we set the accuracy threshold that all methods can satisfy.
we evaluated our models three times and calculated the mean and standard deviation(std).
We estimate the std of ∆ SP +∆ EO by adding std of ∆ SP and ∆ EO , because for some methods, we use the reported data from (Dai & Wang, 2021) which does not provide the metric.
A. A DDITIONAL E XPERIMENTS
Evaluations on GAT (Veliˇckovi´c et al., 2018) model.
As discussed in the main paper, the proposed FairAC method can be easily integrated with existing graph neural networks.
Extensive results in Section 4 of the main paper demonstrate that the combination of FairAC and GCN performs very well.
In this section, we integrate FairAC with another representative graph neural network model, GAT (Veliˇckovi´c et al., 2018).
The results of our method and two main baselines in terms of the node classification accuracy and fairness metrics are shown in Table 4.
In these experiments,
FairAC generates fair and complete node features, and then GAT is trained for node classification.
We also investigate the performance of our FairAC method and baselines on dealing with graphs with varying degrees of missing attributes.
We set the attribute missing rate to 0.1, 0.3, 0.5 and 0.7, and evaluate FairAC and baselines on the Pokec-n dataset.
In addition, we set β to 1.0.
The best results are shown in bold.
Generally speaking, we have the following observations.
The proposed method FairAC shows comparable classification performance with two baselines, GAT and
FairGNN.
This suggests that our attribute completion method is able to work well under different downstream models.
It further demonstrates that FairAC can preserve useful information implied in the original attributes.
FairAC has comparable results with two baselines regarding fairness metrics.
Especially when α is greater than 0.3, FairAC can greatly outperform other methods, which proves that FairAC is effective even if the attributes are largely missing.
Overall, the results in Table 4 validate the effectiveness of FairAC in mitigating unfairness issues and show the compatibility with varying downstream models.