We lifted 1 functions out of this paper's own repositories and ran 0 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| xiaolin-cs/bemap | reimplementation | 0 of 1 |
| Function | Status | Where it lives |
|---|---|---|
| test | Not yet run | xiaolin-cs/bemap/train_bemap.py code served (permissive licence) · get_code("1356322f7eb2e55d") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
As the representations output by Graph Neural Networks (GNNs) are increasingly employed in real-world applications, it becomes important to ensure that these representations are fair and stable. In this work, we establish a key connection between counterfactual fairness and stability and leverage it to propose a novel framework, NIFTY (uNIfying Fairness and stabiliTY), which can be used with any GNN to learn fair and stable representations. We introduce a novel objective function that simultaneously accounts for fairness and stability and develop a layer-wise weight normalization using the Lipschitz constant to enhance neural message passing in GNNs. In doing so, we enforce fairness and stability both in the objective function as well as in the GNN architecture. Further, we show theoretically that our layer-wise weight normalization promotes counterfactual fairness and stability in the resulting representations. We introduce three new graph datasets comprising of high-stakes decisions in criminal justice and financial lending domains. Extensive experimentation with the above datasets demonstrates the efficacy of our framework.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2102.13186")
get_code_for_paper("2102.13186")
have("2102.13186")
Connect an agent — have() is free.