{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T15:56:21Z","timestamp":1774540581141,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":77,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,8,3]]},"DOI":"10.1145\/3711896.3737229","type":"proceedings-article","created":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T21:07:39Z","timestamp":1754255259000},"page":"5225-5236","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["GiGL: Large-Scale Graph Neural Networks at Snapchat"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7660-1732","authenticated-orcid":false,"given":"Tong","family":"Zhao","sequence":"first","affiliation":[{"name":"Snap Inc., Bellevue, WA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2107-504X","authenticated-orcid":false,"given":"Yozen","family":"Liu","sequence":"additional","affiliation":[{"name":"Snap Inc., Santa Monica, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6095-5894","authenticated-orcid":false,"given":"Matthew","family":"Kolodner","sequence":"additional","affiliation":[{"name":"Snap Inc., Bellevue, WA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-1237-4494","authenticated-orcid":false,"given":"Kyle","family":"Montemayor","sequence":"additional","affiliation":[{"name":"Snap Inc., Bellevue, WA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6778-6392","authenticated-orcid":false,"given":"Elham","family":"Ghazizadeh","sequence":"additional","affiliation":[{"name":"Snap Inc., New York, NY, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9980-9843","authenticated-orcid":false,"given":"Ankit","family":"Batra","sequence":"additional","affiliation":[{"name":"Snap Inc., Bellevue, WA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-1467-5073","authenticated-orcid":false,"given":"Zihao","family":"Fan","sequence":"additional","affiliation":[{"name":"Snap Inc., Palo Alto, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-9625-0470","authenticated-orcid":false,"given":"Xiaobin","family":"Gao","sequence":"additional","affiliation":[{"name":"Snap Inc., Bellevue, WA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-9464-6608","authenticated-orcid":false,"given":"Xuan","family":"Guo","sequence":"additional","affiliation":[{"name":"Snap Inc., Palo Alto, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-1383-7915","authenticated-orcid":false,"given":"Jiwen","family":"Ren","sequence":"additional","affiliation":[{"name":"Snap Inc., New York, NY, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-0131-245X","authenticated-orcid":false,"given":"Serim","family":"Park","sequence":"additional","affiliation":[{"name":"Snap Inc., San Francisco, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2286-3152","authenticated-orcid":false,"given":"Peicheng","family":"Yu","sequence":"additional","affiliation":[{"name":"Snap Inc., Bellevue, WA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-3985-6466","authenticated-orcid":false,"given":"Jun","family":"Yu","sequence":"additional","affiliation":[{"name":"Snap Inc., Bellevue, WA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-5524-4232","authenticated-orcid":false,"given":"Shubham","family":"Vij","sequence":"additional","affiliation":[{"name":"Snap Inc., Bellevue, WA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3261-8430","authenticated-orcid":false,"given":"Neil","family":"Shah","sequence":"additional","affiliation":[{"name":"Snap Inc., Bellevue, WA, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,8,3]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3637528.3671566"},{"key":"e_1_3_2_1_2_1","volume-title":"How attentive are graph attention networks? arXiv preprint arXiv:2105.14491","author":"Brody Shaked","year":"2021","unstructured":"Shaked Brody, Uri Alon, and Eran Yahav. 2021. How attentive are graph attention networks? arXiv preprint arXiv:2105.14491 (2021)."},{"key":"e_1_3_2_1_3_1","volume-title":"Fastgcn: fast learning with graph convolutional networks via importance sampling. arXiv preprint arXiv:1801.10247","author":"Chen Jie","year":"2018","unstructured":"Jie Chen, Tengfei Ma, and Cao Xiao. 2018. Fastgcn: fast learning with graph convolutional networks via importance sampling. arXiv preprint arXiv:1801.10247 (2018)."},{"key":"e_1_3_2_1_4_1","volume-title":"LLaGA: Large Language and Graph Assistant. In Forty-first International Conference on Machine Learning.","author":"Chen Runjin","year":"2024","unstructured":"Runjin Chen, Tong Zhao, AJAY KUMAR JAISWAL, Neil Shah, and Zhangyang Wang. 2024. LLaGA: Large Language and Graph Assistant. In Forty-first International Conference on Machine Learning."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330925"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824077"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3481916"},{"key":"e_1_3_2_1_8_1","first-page":"6733","article-title":"VQ-GNN: A universal framework to scale up graph neural networks using vector quantization","volume":"34","author":"Ding Mucong","year":"2021","unstructured":"Mucong Ding, Kezhi Kong, Jingling Li, Chen Zhu, John Dickerson, Furong Huang, and Tom Goldstein. 2021. VQ-GNN: A universal framework to scale up graph neural networks using vector quantization. Advances in Neural Information Processing Systems, Vol. 34 (2021), 6733-6746.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_9_1","volume-title":"SEESAW: Do Graph Neural Networks Improve Node Representation Learning for All?","author":"Dong Yushun","year":"2023","unstructured":"Yushun Dong, William Shiao, Yozen Liu, Jundong Li, Neil Shah, and Tong Zhao. 2023. SEESAW: Do Graph Neural Networks Improve Node Representation Learning for All? (2023)."},{"key":"e_1_3_2_1_10_1","first-page":"5376","article-title":"A comprehensive study on large-scale graph training: Benchmarking and rethinking","volume":"35","author":"Duan Keyu","year":"2022","unstructured":"Keyu Duan, Zirui Liu, Peihao Wang, Wenqing Zheng, Kaixiong Zhou, Tianlong Chen, Xia Hu, and Zhangyang Wang. 2022. A comprehensive study on large-scale graph training: Benchmarking and rethinking. Advances in Neural Information Processing Systems, Vol. 35 (2022), 5376-5389.","journal-title":"Advances in Neural Information Processing Systems"},{"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 The world wide web conference.","DOI":"10.1145\/3308558.3313488"},{"key":"e_1_3_2_1_12_1","volume-title":"Sami Abu-El-Haija, Peter Battaglia, Neslihan Bulut, et al.","author":"Ferludin Oleksandr","year":"2022","unstructured":"Oleksandr Ferludin, Arno Eigenwillig, Martin Blais, Dustin Zelle, Jan Pfeifer, Alvaro Sanchez-Gonzalez, Wai Lok Sibon Li, Sami Abu-El-Haija, Peter Battaglia, Neslihan Bulut, et al. 2022. Tf-gnn: Graph neural networks in tensorflow. arXiv preprint arXiv:2207.03522 (2022)."},{"key":"e_1_3_2_1_13_1","volume-title":"Fast Graph Representation Learning with PyTorch Geometric. In ICLR Workshop on Representation Learning on Graphs and Manifolds.","author":"Fey Matthias","unstructured":"Matthias Fey and Jan E. Lenssen. 2019. Fast Graph Representation Learning with PyTorch Geometric. In ICLR Workshop on Representation Learning on Graphs and Manifolds."},{"key":"e_1_3_2_1_14_1","volume-title":"International conference on machine learning.","author":"Fey Matthias","year":"2021","unstructured":"Matthias Fey, Jan E Lenssen, Frank Weichert, and Jure Leskovec. 2021. Gnnautoscale: Scalable and expressive graph neural networks via historical embeddings. In International conference on machine learning."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219947"},{"key":"e_1_3_2_1_16_1","volume-title":"International Conference on Machine Learning.","author":"Guo Zhichun","year":"2023","unstructured":"Zhichun Guo, William Shiao, Shichang Zhang, Yozen Liu, Nitesh V Chawla, Neil Shah, and Tong Zhao. 2023. Linkless link prediction via relational distillation. In International Conference on Machine Learning."},{"key":"e_1_3_2_1_17_1","volume-title":"Node duplication improves cold-start link prediction. arXiv preprint arXiv:2402.09711","author":"Guo Zhichun","year":"2024","unstructured":"Zhichun Guo, Tong Zhao, Yozen Liu, Kaiwen Dong, William Shiao, Neil Shah, and Nitesh V Chawla. 2024. Node duplication improves cold-start link prediction. arXiv preprint arXiv:2402.09711 (2024)."},{"key":"e_1_3_2_1_18_1","unstructured":"Will Hamilton Zhitao Ying and Jure Leskovec. 2017. Inductive representation learning on large graphs. In Advances in neural information processing systems."},{"key":"e_1_3_2_1_19_1","volume-title":"International Conference on Machine Learning. PMLR, 8230-8248","author":"Han Xiaotian","year":"2022","unstructured":"Xiaotian Han, Zhimeng Jiang, Ninghao Liu, and Xia Hu. 2022a. G-mixup: Graph data augmentation for graph classification. In International Conference on Machine Learning. PMLR, 8230-8248."},{"key":"e_1_3_2_1_20_1","volume-title":"Mlpinit: Embarrassingly simple gnn training acceleration with mlp initialization. arXiv preprint arXiv:2210.00102","author":"Han Xiaotian","year":"2022","unstructured":"Xiaotian Han, Tong Zhao, Yozen Liu, Xia Hu, and Neil Shah. 2022b. Mlpinit: Embarrassingly simple gnn training acceleration with mlp initialization. arXiv preprint arXiv:2210.00102 (2022)."},{"key":"e_1_3_2_1_21_1","volume-title":"OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs. arXiv preprint arXiv:2103.09430","author":"Hu Weihua","year":"2021","unstructured":"Weihua Hu, Matthias Fey, Hongyu Ren, Maho Nakata, Yuxiao Dong, and Jure Leskovec. 2021. OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs. arXiv preprint arXiv:2103.09430 (2021)."},{"key":"e_1_3_2_1_22_1","volume-title":"Open graph benchmark: Datasets for machine learning on graphs. Advances in neural information processing systems","author":"Hu Weihua","year":"2020","unstructured":"Weihua Hu, Matthias Fey, Marinka Zitnik, Yuxiao Dong, Hongyu Ren, Bowen Liu, Michele Catasta, and Jure Leskovec. 2020a. Open graph benchmark: Datasets for machine learning on graphs. Advances in neural information processing systems, Vol. 33 (2020), 22118-22133."},{"key":"e_1_3_2_1_23_1","volume-title":"Open Graph Benchmark: Datasets for Machine Learning on Graphs. arXiv preprint arXiv:2005.00687","author":"Hu Weihua","year":"2020","unstructured":"Weihua Hu, Matthias Fey, Marinka Zitnik, Yuxiao Dong, Hongyu Ren, Bowen Liu, Michele Catasta, and Jure Leskovec. 2020b. Open Graph Benchmark: Datasets for Machine Learning on Graphs. arXiv preprint arXiv:2005.00687 (2020)."},{"key":"e_1_3_2_1_24_1","volume-title":"Food discovery with uber eats: Using graph learning to power recommendations. Accessed","author":"Jain Ankit","year":"2019","unstructured":"Ankit Jain, Isaac Liu, Ankur Sarda, and Piero Molino. 2019. Food discovery with uber eats: Using graph learning to power recommendations. Accessed (2019)."},{"key":"e_1_3_2_1_25_1","volume-title":"On using very large target vocabulary for neural machine translation. arXiv preprint arXiv:1412.2007","author":"Jean S\u00e9bastien","year":"2014","unstructured":"S\u00e9bastien Jean, Kyunghyun Cho, Roland Memisevic, and Yoshua Bengio. 2014. On using very large target vocabulary for neural machine translation. arXiv preprint arXiv:1412.2007 (2014)."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403049"},{"key":"e_1_3_2_1_27_1","volume-title":"Graph condensation for graph neural networks. arXiv preprint arXiv:2110.07580","author":"Jin Wei","year":"2021","unstructured":"Wei Jin, Lingxiao Zhao, Shichang Zhang, Yozen Liu, Jiliang Tang, and Neil Shah. 2021. Graph condensation for graph neural networks. arXiv preprint arXiv:2110.07580 (2021)."},{"key":"e_1_3_2_1_28_1","volume-title":"Multi-task self-supervised graph neural networks enable stronger task generalization. arXiv preprint arXiv:2210.02016","author":"Ju Mingxuan","year":"2022","unstructured":"Mingxuan Ju, Tong Zhao, Qianlong Wen, Wenhao Yu, Neil Shah, Yanfang Ye, and Chuxu Zhang. 2022. Multi-task self-supervised graph neural networks enable stronger task generalization. arXiv preprint arXiv:2210.02016 (2022)."},{"key":"e_1_3_2_1_29_1","volume-title":"METIS: A software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices.","author":"Karypis George","year":"1997","unstructured":"George Karypis and Vipin Kumar. 1997. METIS: A software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices. (1997)."},{"key":"e_1_3_2_1_30_1","volume-title":"Semi-Supervised Classification with Graph Convolutional Networks. In International Conference on Learning Representations.","author":"Kipf Thomas N","year":"2016","unstructured":"Thomas N Kipf and Max Welling. 2016. Semi-Supervised Classification with Graph Convolutional Networks. In International Conference on Learning Representations."},{"key":"e_1_3_2_1_31_1","volume-title":"Robust training objectives improve embedding-based retrieval in industrial recommendation systems. arXiv preprint arXiv:2409.14682","author":"Kolodner Matthew","year":"2024","unstructured":"Matthew Kolodner, Mingxuan Ju, Zihao Fan, Tong Zhao, Elham Ghazizadeh, Yan Wu, Neil Shah, and Yozen Liu. 2024. Robust training objectives improve embedding-based retrieval in industrial recommendation systems. arXiv preprint arXiv:2409.14682 (2024)."},{"key":"e_1_3_2_1_32_1","volume-title":"Proceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval. 2930-2934","author":"Perng-Hwa Kung Pau","year":"2024","unstructured":"Pau Perng-Hwa Kung, Zihao Fan, Tong Zhao, Yozen Liu, Zhixin Lai, Jiahui Shi, Yan Wu, Jun Yu, Neil Shah, and Ganesh Venkataraman. 2024. Improving embedding-based retrieval in friend recommendation with ann query expansion. In Proceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval. 2930-2934."},{"key":"e_1_3_2_1_33_1","volume-title":"A comprehensive survey on distributed training of graph neural networks. Proc","author":"Lin Haiyang","year":"2023","unstructured":"Haiyang Lin, Mingyu Yan, Xiaochun Ye, Dongrui Fan, Shirui Pan, Wenguang Chen, and Yuan Xie. 2023. A comprehensive survey on distributed training of graph neural networks. Proc. IEEE (2023)."},{"key":"e_1_3_2_1_34_1","volume-title":"Zhujun Chen, Fedor Borisyuk, Daniel Hewlett, Liang Wu, et al.","author":"Liu Ping","year":"2024","unstructured":"Ping Liu, Haichao Wei, Xiaochen Hou, Jianqiang Shen, Shihai He, Kay Qianqi Shen, Zhujun Chen, Fedor Borisyuk, Daniel Hewlett, Liang Wu, et al. 2024. LinkSAGE: Optimizing Job Matching Using Graph Neural Networks. arXiv preprint arXiv:2402.13430 (2024)."},{"key":"e_1_3_2_1_35_1","volume-title":"Mixture of Link Predictors on Graphs. In Annual Conference on Neural Information Processing Systems.","author":"Ma Li","year":"2024","unstructured":"Li Ma, Haoyu Han, Juanhui Li, Harry Shomer, Hui Liu, Xiaofeng Gao, and Jiliang Tang. 2024. Mixture of Link Predictors on Graphs. In Annual Conference on Neural Information Processing Systems."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482225"},{"key":"e_1_3_2_1_37_1","volume-title":"Demystifying structural disparity in graph neural networks: Can one size fit all? Advances in neural information processing systems","author":"Mao Haitao","year":"2024","unstructured":"Haitao Mao, Zhikai Chen, Wei Jin, Haoyu Han, Yao Ma, Tong Zhao, Neil Shah, and Jiliang Tang. 2024. Demystifying structural disparity in graph neural networks: Can one size fit all? Advances in neural information processing systems, Vol. 36 (2024)."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3458817.3480856"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539203"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3637528.3671460"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41060-016-0027-9"},{"key":"e_1_3_2_1_43_1","unstructured":"Alex Samylkin. 2022. DeepGNN is a framework for training machine learning models on large scale graph data. https:\/\/github.com\/microsoft\/DeepGNN."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450120"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3539618.3591848"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3488560.3498398"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403276"},{"key":"e_1_3_2_1_49_1","volume-title":"The graph lottery ticket hypothesis: Finding sparse, informative graph structure. arXiv preprint arXiv:2312.04762","author":"Tsitsulin Anton","year":"2023","unstructured":"Anton Tsitsulin and Bryan Perozzi. 2023. The graph lottery ticket hypothesis: Finding sparse, informative graph structure. arXiv preprint arXiv:2312.04762 (2023)."},{"key":"e_1_3_2_1_50_1","volume-title":"Graph attention networks. arXiv preprint arXiv:1710.10903","author":"Veli\u010dkovi\u0107 Petar","year":"2017","unstructured":"Petar Veli\u010dkovi\u0107, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Lio, and Yoshua Bengio. 2017. Graph attention networks. arXiv preprint arXiv:1710.10903 (2017)."},{"key":"e_1_3_2_1_51_1","volume-title":"Graph Attention Networks. In International Conference on Learning Representations.","author":"Velickovic Petar","year":"2018","unstructured":"Petar Velickovic, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Li\u00f2, and Yoshua Bengio. 2018. Graph Attention Networks. In International Conference on Learning Representations."},{"key":"e_1_3_2_1_52_1","volume-title":"Highly-Performant Package for Graph Neural Networks. arXiv preprint arXiv:1909.01315","author":"Wang Minjie","year":"2019","unstructured":"Minjie Wang, Da Zheng, Zihao Ye, Quan Gan, Mufei Li, Xiang Song, Jinjing Zhou, Chao Ma, Lingfan Yu, Yu Gai, Tianjun Xiao, Tong He, George Karypis, Jinyang Li, and Zheng Zhang. 2019. Deep Graph Library: A Graph-Centric, Highly-Performant Package for Graph Neural Networks. arXiv preprint arXiv:1909.01315 (2019)."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3124749.3124754"},{"key":"e_1_3_2_1_54_1","volume-title":"A topological perspective on demystifying gnn-based link prediction performance. arXiv preprint arXiv:2310.04612","author":"Wang Yu","year":"2023","unstructured":"Yu Wang, Tong Zhao, Yuying Zhao, Yunchao Liu, Xueqi Cheng, Neil Shah, and Tyler Derr. 2023. A topological perspective on demystifying gnn-based link prediction performance. arXiv preprint arXiv:2310.04612 (2023)."},{"key":"e_1_3_2_1_55_1","volume-title":"On the effectiveness of sampled softmax loss for item recommendation. ACM Transactions on Information Systems","author":"Wu Jiancan","year":"2024","unstructured":"Jiancan Wu, Xiang Wang, Xingyu Gao, Jiawei Chen, Hongcheng Fu, and Tianyu Qiu. 2024. On the effectiveness of sampled softmax loss for item recommendation. ACM Transactions on Information Systems (2024)."},{"key":"e_1_3_2_1_56_1","volume-title":"Nebula Graph: An open source distributed graph database. arXiv preprint arXiv:2206.07278","author":"Wu Min","year":"2022","unstructured":"Min Wu, Xinglu Yi, Hui Yu, Yu Liu, and Yujue Wang. 2022. Nebula Graph: An open source distributed graph database. arXiv preprint arXiv:2206.07278 (2022)."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"e_1_3_2_1_58_1","volume-title":"How powerful are graph neural networks? arXiv preprint arXiv:1810.00826","author":"Xu Keyulu","year":"2018","unstructured":"Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka. 2018. How powerful are graph neural networks? arXiv preprint arXiv:1810.00826 (2018)."},{"key":"e_1_3_2_1_59_1","volume-title":"Large-Scale Graph Neural Networks: Navigating the Past and Pioneering New Horizons. AAAI Tutorial","author":"Xue Rui","year":"2024","unstructured":"Rui Xue, Haoyu Han, Tong Zhao, Neil Shah, Jiliang Tang, and Xiaorui Liu. 2024a. Large-Scale Graph Neural Networks: Navigating the Past and Pioneering New Horizons. AAAI Tutorial (2024)."},{"key":"e_1_3_2_1_60_1","volume-title":"Haste Makes Waste: A Simple Approach for Scaling Graph Neural Networks. arXiv preprint arXiv:2410.05416","author":"Xue Rui","year":"2024","unstructured":"Rui Xue, Tong Zhao, Neil Shah, and Xiaorui Liu. 2024b. Haste Makes Waste: A Simple Approach for Scaling Graph Neural Networks. arXiv preprint arXiv:2410.05416 (2024)."},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403293"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/3298689.3346996"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219890"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467284"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.14778\/3415478.3415539"},{"key":"e_1_3_2_1_66_1","volume-title":"Link prediction based on graph neural networks. Advances in neural information processing systems","author":"Zhang Muhan","year":"2018","unstructured":"Muhan Zhang and Yixin Chen. 2018. Link prediction based on graph neural networks. Advances in neural information processing systems, Vol. 31 (2018)."},{"key":"e_1_3_2_1_67_1","volume-title":"Graph-less neural networks: Teaching old mlps new tricks via distillation. arXiv preprint arXiv:2110.08727","author":"Zhang Shichang","year":"2021","unstructured":"Shichang Zhang, Yozen Liu, Yizhou Sun, and Neil Shah. 2021. Graph-less neural networks: Teaching old mlps new tricks via distillation. arXiv preprint arXiv:2110.08727 (2021)."},{"key":"e_1_3_2_1_68_1","volume-title":"International Conference on Learning Representations","author":"Zhao Lingxiao","year":"2022","unstructured":"Lingxiao Zhao, Wei Jin, Leman Akoglu, and Neil Shah. 2022a. From stars to subgraphs: Uplifting any GNN with local structure awareness. International Conference on Learning Representations (2022)."},{"key":"e_1_3_2_1_69_1","volume-title":"Graph Data Augmentation for Graph Machine Learning: A Survey. Data Engineering","author":"Zhao Tong","year":"2022","unstructured":"Tong Zhao, Wei Jin, Yozen Liu, Yingheng Wang, Gang Liu, Stephan G\u00fcnnemann, Neil Shah, and Meng Jiang. 2022b. Graph Data Augmentation for Graph Machine Learning: A Survey. Data Engineering (2022)."},{"key":"e_1_3_2_1_70_1","volume-title":"International Conference on Machine Learning.","author":"Zhao Tong","year":"2022","unstructured":"Tong Zhao, Gang Liu, Daheng Wang, Wenhao Yu, and Meng Jiang. 2022c. Learning from counterfactual links for link prediction. In International Conference on Machine Learning."},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i12.17315"},{"key":"e_1_3_2_1_72_1","volume-title":"The Second Tiny Papers Track at ICLR","author":"Zhao Tong","year":"2024","unstructured":"Tong Zhao, Neil Shah, and Elham Ghazizadeh. 2024. Learning from graphs beyond message passing neural networks. In The Second Tiny Papers Track at ICLR 2024."},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.14778\/3514061.3514069"},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"crossref","unstructured":"Da Zheng Xiang Song Qi Zhu Jian Zhang Theodore Vasiloudis Runjie Ma Houyu Zhang Zichen Wang Soji Adeshina Israt Nisa et al. 2024. GraphStorm: all-in-one graph machine learning framework for industry applications. arXiv preprint arXiv:2406.06022 (2024).","DOI":"10.1145\/3637528.3671603"},{"key":"e_1_3_2_1_75_1","volume-title":"Cross-domain recommendation: challenges, progress, and prospects. IJCAI","author":"Zhu Feng","year":"2021","unstructured":"Feng Zhu, Yan Wang, Chaochao Chen, Jun Zhou, Longfei Li, and Guanfeng Liu. 2021a. Cross-domain recommendation: challenges, progress, and prospects. IJCAI (2021)."},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.14778\/3352063.3352127"},{"key":"e_1_3_2_1_77_1","volume-title":"Neural bellman-ford networks: A general graph neural network framework for link prediction. Advances in Neural Information Processing Systems","author":"Zhu Zhaocheng","year":"2021","unstructured":"Zhaocheng Zhu, Zuobai Zhang, Louis-Pascal Xhonneux, and Jian Tang. 2021b. Neural bellman-ford networks: A general graph neural network framework for link prediction. Advances in Neural Information Processing Systems (2021)."}],"event":{"name":"KDD '25: The 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Toronto ON Canada","acronym":"KDD '25","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3711896.3737229","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T14:38:29Z","timestamp":1755355109000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3711896.3737229"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,3]]},"references-count":77,"alternative-id":["10.1145\/3711896.3737229","10.1145\/3711896"],"URL":"https:\/\/doi.org\/10.1145\/3711896.3737229","relation":{},"subject":[],"published":{"date-parts":[[2025,8,3]]},"assertion":[{"value":"2025-08-03","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}