{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T20:27:10Z","timestamp":1772483230899,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":55,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,4,30]],"date-time":"2023-04-30T00:00:00Z","timestamp":1682812800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CMMI-2146076"],"award-info":[{"award-number":["CMMI-2146076"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,4,30]]},"DOI":"10.1145\/3543507.3583207","type":"proceedings-article","created":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T23:30:25Z","timestamp":1682551825000},"page":"28-38","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Fair Graph Representation Learning via Diverse Mixture-of-Experts"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7809-4586","authenticated-orcid":false,"given":"Zheyuan","family":"Liu","sequence":"first","affiliation":[{"name":"Brandeis University, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6380-3340","authenticated-orcid":false,"given":"Chunhui","family":"Zhang","sequence":"additional","affiliation":[{"name":"Brandeis University, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2795-6080","authenticated-orcid":false,"given":"Yijun","family":"Tian","sequence":"additional","affiliation":[{"name":"University of Notre Dame, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4911-2970","authenticated-orcid":false,"given":"Erchi","family":"Zhang","sequence":"additional","affiliation":[{"name":"Brandeis University, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2062-1512","authenticated-orcid":false,"given":"Chao","family":"Huang","sequence":"additional","affiliation":[{"name":"University of Hong Kong, Hong Kong"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6038-2173","authenticated-orcid":false,"given":"Yanfang","family":"Ye","sequence":"additional","affiliation":[{"name":"University of Notre Dame, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8349-7926","authenticated-orcid":false,"given":"Chuxu","family":"Zhang","sequence":"additional","affiliation":[{"name":"Brandeis University, USA"}]}],"member":"320","published-online":{"date-parts":[[2023,4,30]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Yahav Bechavod Christopher Jung and Steven\u00a0Z Wu. 2020. Metric-free individual fairness in online learning. In NeurIPS."},{"key":"e_1_3_2_1_2_1","volume-title":"Data decisions and theoretical implications when adversarially learning fair representations. arXiv preprint arXiv:1707.00075","author":"Beutel Alex","year":"2017","unstructured":"Alex Beutel, Jilin Chen, Zhe Zhao, and Ed\u00a0H Chi. 2017. Data decisions and theoretical implications when adversarially learning fair representations. arXiv preprint arXiv:1707.00075 (2017)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Reuben Binns. 2020. On the apparent conflict between individual and group fairness. In FAccT.","DOI":"10.1145\/3351095.3372864"},{"key":"e_1_3_2_1_4_1","volume-title":"Multisided fairness for recommendation. arXiv preprint arXiv:1707.00093","author":"Burke Robin","year":"2017","unstructured":"Robin Burke. 2017. Multisided fairness for recommendation. arXiv preprint arXiv:1707.00093 (2017)."},{"key":"e_1_3_2_1_5_1","unstructured":"Ming Chen Zhewei Wei Zengfeng Huang Bolin Ding and Yaliang Li. 2020. Simple and deep graph convolutional networks. In ICML."},{"key":"e_1_3_2_1_6_1","volume-title":"FairMod: Fair Link Prediction and Recommendation via Graph Modification. arXiv preprint arXiv:2201.11596","author":"Current Sean","year":"2022","unstructured":"Sean Current, Yuntian He, Saket Gurukar, and Srinivasan Parthasarathy. 2022. FairMod: Fair Link Prediction and Recommendation via Graph Modification. arXiv preprint arXiv:2201.11596 (2022)."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Enyan Dai and Suhang Wang. 2021. Say no to the discrimination: Learning fair graph neural networks with limited sensitive attribute information. In WSDM.","DOI":"10.1145\/3437963.3441752"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Yushun Dong Song Wang Yu Wang Tyler Derr and Jundong Li. 2022. On Structural Explanation of Bias in Graph Neural Networks. In KDD.","DOI":"10.1145\/3534678.3539319"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Cynthia Dwork Moritz Hardt Toniann Pitassi Omer Reingold and Richard Zemel. 2012. Fairness through awareness. In ITCS.","DOI":"10.1145\/2090236.2090255"},{"key":"e_1_3_2_1_10_1","volume-title":"Censoring representations with an adversary. arXiv preprint arXiv:1511.05897","author":"Edwards Harrison","year":"2015","unstructured":"Harrison Edwards and Amos Storkey. 2015. Censoring representations with an adversary. arXiv preprint arXiv:1511.05897 (2015)."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Wenqi Fan Yao Ma Qing Li Yuan He Eric Zhao Jiliang Tang and Dawei Yin. 2019. Graph neural networks for social recommendation. In WWW.","DOI":"10.1145\/3308558.3313488"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Yujie Fan Mingxuan Ju Chuxu Zhang and Yanfang Ye. 2022. Heterogeneous temporal graph neural network. In SDM.","DOI":"10.1137\/1.9781611977172.74"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Will Fleisher. 2021. What\u2019s Fair about Individual Fairness?. In AAAI.","DOI":"10.2139\/ssrn.3819799"},{"key":"e_1_3_2_1_14_1","volume-title":"Inferential privacy guarantees for differentially private mechanisms. arXiv preprint arXiv:1603.01508","author":"Ghosh Arpita","year":"2016","unstructured":"Arpita Ghosh and Robert Kleinberg. 2016. Inferential privacy guarantees for differentially private mechanisms. arXiv preprint arXiv:1603.01508 (2016)."},{"key":"e_1_3_2_1_15_1","unstructured":"Justin Gilmer Samuel\u00a0S Schoenholz Patrick\u00a0F Riley Oriol Vinyals and George\u00a0E Dahl. 2017. Neural message passing for quantum chemistry. In ICML."},{"key":"e_1_3_2_1_16_1","volume-title":"Generative adversarial networks. Commun. ACM","author":"Goodfellow Ian","year":"2020","unstructured":"Ian Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio. 2020. Generative adversarial networks. Commun. ACM (2020)."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable feature learning for networks. In KDD.","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_2_1_18_1","unstructured":"Will Hamilton Zhitao Ying and Jure Leskovec. 2017. Inductive Representation Learning on Large Graphs. In NeurIPS."},{"key":"e_1_3_2_1_19_1","unstructured":"Moritz Hardt Eric Price and Nati Srebro. 2016. Equality of opportunity in supervised learning. In NeurIPS."},{"key":"e_1_3_2_1_20_1","unstructured":"Zhimeng Jiang Xiaotian Han Chao Fan Fan Yang Ali Mostafavi and Xia Hu. 2022. Generalized Demographic Parity for Group Fairness. In ICLR."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Jian Kang and Hanghang Tong. 2021. Fair graph mining. In ICDM.","DOI":"10.1145\/3459637.3482030"},{"key":"e_1_3_2_1_22_1","volume-title":"MultiFair: Multi-Group Fairness in Machine Learning. arXiv preprint arXiv:2105.11069","author":"Kang Jian","year":"2021","unstructured":"Jian Kang, Tiankai Xie, Xintao Wu, Ross Maciejewski, and Hanghang Tong. 2021. MultiFair: Multi-Group Fairness in Machine Learning. arXiv preprint arXiv:2105.11069 (2021)."},{"key":"e_1_3_2_1_23_1","volume-title":"A Survey on Graph Representation Learning Methods. arXiv preprint arXiv:2204.01855","author":"Khoshraftar Shima","year":"2022","unstructured":"Shima Khoshraftar and Aijun An. 2022. A Survey on Graph Representation Learning Methods. arXiv preprint arXiv:2204.01855 (2022)."},{"key":"e_1_3_2_1_24_1","volume-title":"Kingma and Jimmy Ba","author":"P.","year":"2015","unstructured":"Diederik\u00a0P. Kingma and Jimmy Ba. 2015. Adam: A Method for Stochastic Optimization. In ICLR."},{"key":"e_1_3_2_1_25_1","volume-title":"Variational graph auto-encoders. arXiv preprint arXiv:1611.07308","author":"Kipf N","year":"2016","unstructured":"Thomas\u00a0N Kipf and Max Welling. 2016. Variational graph auto-encoders. arXiv preprint arXiv:1611.07308 (2016)."},{"key":"e_1_3_2_1_26_1","volume-title":"Kipf and Max Welling","author":"N.","year":"2017","unstructured":"Thomas\u00a0N. Kipf and Max Welling. 2017. Semi-Supervised Classification with Graph Convolutional Networks. In ICLR."},{"key":"e_1_3_2_1_27_1","volume-title":"Deepgcns: Can gcns go as deep as cnns?. In ICCV.","author":"Li Guohao","year":"2019","unstructured":"Guohao Li, Matthias Muller, Ali Thabet, and Bernard Ghanem. 2019. Deepgcns: Can gcns go as deep as cnns?. In ICCV."},{"key":"e_1_3_2_1_28_1","unstructured":"Hao Li Zheng Xu Gavin Taylor Christoph Studer and Tom Goldstein. 2018. Visualizing the loss landscape of neural nets. In NeurIPS."},{"key":"e_1_3_2_1_29_1","unstructured":"Peizhao Li Yifei Wang Han Zhao Pengyu Hong and Hongfu Liu. 2021. On dyadic fairness: Exploring and mitigating bias in graph connections. In ICLR."},{"key":"e_1_3_2_1_30_1","unstructured":"Peiyuan Liao Han Zhao Keyulu Xu Tommi Jaakkola Geoffrey\u00a0J Gordon Stefanie Jegelka and Ruslan Salakhutdinov. 2021. Information obfuscation of graph neural networks. In ICML."},{"key":"e_1_3_2_1_31_1","unstructured":"Weiyang Liu Rongmei Lin Zhen Liu Li Xiong Bernhard Sch\u00f6lkopf and Adrian Weller. 2021. Learning with hyperspherical uniformity. In AISTATS."},{"key":"e_1_3_2_1_32_1","unstructured":"Sepideh Mahabadi and Ali Vakilian. 2020. Individual fairness for k-clustering. In ICML."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Farzan Masrour Tyler Wilson Heng Yan Pang-Ning Tan and Abdol Esfahanian. 2020. Bursting the filter bubble: Fairness-aware network link prediction. In AAAI.","DOI":"10.1609\/aaai.v34i01.5429"},{"key":"e_1_3_2_1_34_1","volume-title":"A Review on Fairness in Machine Learning. Comput. Surveys","author":"Pessach Dana","year":"2022","unstructured":"Dana Pessach and Erez Shmueli. 2022. A Review on Fairness in Machine Learning. Comput. Surveys (2022)."},{"key":"e_1_3_2_1_35_1","volume-title":"Fairwalk: Towards fair graph embedding. In IJCAI.","author":"Rahman Tahleen","year":"2019","unstructured":"Tahleen Rahman, Bartlomiej Surma, Michael Backes, and Yang Zhang. 2019. Fairwalk: Towards fair graph embedding. In IJCAI."},{"key":"e_1_3_2_1_36_1","unstructured":"Yu Rong Wenbing Huang Tingyang Xu and Junzhou Huang. 2020. DropEdge: Towards Deep Graph Convolutional Networks on Node Classification. In ICLR."},{"key":"e_1_3_2_1_37_1","unstructured":"Noam Shazeer *Azalia Mirhoseini *Krzysztof Maziarz Andy Davis Quoc Le Geoffrey Hinton and Jeff Dean. 2017. Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer. In ICLR."},{"key":"e_1_3_2_1_38_1","volume-title":"Fairdrop: Biased edge dropout for enhancing fairness in graph representation learning","author":"Spinelli Indro","year":"2021","unstructured":"Indro Spinelli, Simone Scardapane, Amir Hussain, and Aurelio Uncini. 2021. Fairdrop: Biased edge dropout for enhancing fairness in graph representation learning. IEEE Transactions on Artificial Intelligence (2021)."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","unstructured":"Yijun Tian Kaiwen Dong Chunhui Zhang Chuxu Zhang and Nitesh\u00a0V Chawla. 2023. Heterogeneous Graph Masked Autoencoders. In AAAI.","DOI":"10.1609\/aaai.v37i8.26192"},{"key":"e_1_3_2_1_40_1","unstructured":"Yijun Tian Chuxu Zhang Zhichun Guo Xiangliang Zhang and Nitesh Chawla. 2023. Learning MLPs on Graphs: A Unified View of Effectiveness Robustness and Efficiency. In ICLR."},{"key":"e_1_3_2_1_41_1","volume-title":"Visualizing data using t-SNE.Journal of Machine Learning Research","author":"Maaten Laurens Van\u00a0der","year":"2008","unstructured":"Laurens Van\u00a0der Maaten and Geoffrey Hinton. 2008. Visualizing data using t-SNE.Journal of Machine Learning Research (2008)."},{"key":"e_1_3_2_1_42_1","unstructured":"Petar Veli\u010dkovi\u0107 Guillem Cucurull Arantxa Casanova Adriana Romero Pietro Li\u00f2 and Yoshua Bengio. 2018. Graph Attention Networks. In ICLR."},{"key":"e_1_3_2_1_43_1","unstructured":"Petar Veli\u010dkovi\u0107 William Fedus William\u00a0L. Hamilton Pietro Li\u00f2 Yoshua Bengio and R\u00a0Devon Hjelm. 2019. Deep Graph Infomax. In ICLR."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"crossref","unstructured":"Le Wu Lei Chen Pengyang Shao Richang Hong Xiting Wang and Meng Wang. 2021. Learning fair representations for recommendation: A graph-based perspective. In WWW.","DOI":"10.1145\/3442381.3450015"},{"key":"e_1_3_2_1_45_1","volume-title":"Graph neural networks in recommender systems: a survey. Comput. Surveys","author":"Wu Shiwen","year":"2020","unstructured":"Shiwen Wu, Fei Sun, Wentao Zhang, Xu Xie, and Bin Cui. 2020. Graph neural networks in recommender systems: a survey. Comput. Surveys (2020)."},{"key":"e_1_3_2_1_46_1","unstructured":"Lianghao Xia Chao Huang and Chuxu Zhang. 2022. Self-supervised hypergraph transformer for recommender systems. In KDD."},{"key":"e_1_3_2_1_47_1","unstructured":"Keyulu Xu Weihua Hu Jure Leskovec and Stefanie Jegelka. 2019. How Powerful are Graph Neural Networks?. In ICLR."},{"key":"e_1_3_2_1_48_1","volume-title":"Obtaining Dyadic Fairness by Optimal Transport. arXiv preprint arXiv:2202.04520","author":"Yang Moyi","year":"2022","unstructured":"Moyi Yang, Junjie Sheng, Xiangfeng Wang, Wenyan Liu, Bo Jin, Jun Wang, and Hongyuan Zha. 2022. Obtaining Dyadic Fairness by Optimal Transport. arXiv preprint arXiv:2202.04520 (2022)."},{"key":"e_1_3_2_1_49_1","unstructured":"Sirui Yao and Bert Huang. 2017. Beyond parity: Fairness objectives for collaborative filtering. In NeurIPS."},{"key":"e_1_3_2_1_50_1","unstructured":"Muhammad\u00a0Bilal Zafar Isabel Valera Manuel Gomez\u00a0Rodriguez and Krishna\u00a0P Gummadi. 2017. Fairness beyond disparate treatment & disparate impact: Learning classification without disparate mistreatment. In WWW."},{"key":"e_1_3_2_1_51_1","volume-title":"Fairness constraints: A flexible approach for fair classification. Journal of Machine Learning Research","author":"Zafar Muhammad\u00a0Bilal","year":"2019","unstructured":"Muhammad\u00a0Bilal Zafar, Isabel Valera, Manuel Gomez-Rodriguez, and Krishna\u00a0P Gummadi. 2019. Fairness constraints: A flexible approach for fair classification. Journal of Machine Learning Research (2019)."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"crossref","unstructured":"Chuxu Zhang Dongjin Song Chao Huang Ananthram Swami and Nitesh\u00a0V Chawla. 2019. Heterogeneous graph neural network. In KDD.","DOI":"10.1145\/3292500.3330961"},{"key":"e_1_3_2_1_53_1","unstructured":"Chunhui Zhang Yijun Tian Mingxuan Ju Zheyuan Liu Yanfang Ye Nitesh Chawla and Chuxu Zhang. 2023. Chasing All-Round Graph Representation Robustness: Model Training and Optimization. In ICLR."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"crossref","unstructured":"Chuxu Zhang Huaxiu Yao Chao Huang Meng Jiang Zhenhui Li and Nitesh\u00a0V Chawla. 2020. Few-shot knowledge graph completion. In AAAI.","DOI":"10.1609\/aaai.v34i03.5698"},{"key":"e_1_3_2_1_55_1","unstructured":"Muhan Zhang and Yixin Chen. 2018. Link prediction based on graph neural networks. In NeurIPS."}],"event":{"name":"WWW '23: The ACM Web Conference 2023","location":"Austin TX USA","acronym":"WWW '23","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM Web Conference 2023"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543507.3583207","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3543507.3583207","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3543507.3583207","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3543507.3583207","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:09:18Z","timestamp":1750183758000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543507.3583207"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,30]]},"references-count":55,"alternative-id":["10.1145\/3543507.3583207","10.1145\/3543507"],"URL":"https:\/\/doi.org\/10.1145\/3543507.3583207","relation":{},"subject":[],"published":{"date-parts":[[2023,4,30]]},"assertion":[{"value":"2023-04-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}