{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,9]],"date-time":"2026-10-09T17:24:46Z","timestamp":1791566686473,"version":"4.3.4"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T00:00:00Z","timestamp":1597881600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,8,23]]},"DOI":"10.1145\/3394486.3403192","type":"proceedings-article","created":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T19:18:56Z","timestamp":1597951136000},"page":"1393-1403","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":61,"title":["Minimal Variance Sampling with Provable Guarantees for Fast Training of Graph Neural Networks"],"prefix":"10.1145","author":[{"given":"Weilin","family":"Cong","sequence":"first","affiliation":[{"name":"The Pennsylvania State University, State College, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rana","family":"Forsati","sequence":"additional","affiliation":[{"name":"Microsoft Bing, Redmond, WA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mahmut","family":"Kandemir","sequence":"additional","affiliation":[{"name":"The Pennsylvania State University, State College, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mehrdad","family":"Mahdavi","sequence":"additional","affiliation":[{"name":"The Pennsylvania State University, State College, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,8,20]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"12th USENIX Symposium on Operating Systems Design and Implementation (OSDI 16)","author":"Abadi Mart'in","year":"2016","unstructured":"Mart'in Abadi , Paul Barham , Jianmin Chen , Zhifeng Chen , Andy Davis , Jeffrey Dean , Matthieu Devin , Sanjay Ghemawat , Geoffrey Irving , Michael Isard , 2016 . Tensorflow: A system for large-scale machine learning . In 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI 16) . 265--283. Mart'in Abadi, Paul Barham, Jianmin Chen, Zhifeng Chen, Andy Davis, Jeffrey Dean, Matthieu Devin, Sanjay Ghemawat, Geoffrey Irving, Michael Isard, et al. 2016. Tensorflow: A system for large-scale machine learning. In 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI 16). 265--283."},{"key":"e_1_3_2_1_2_1","volume-title":"Graph convolutional matrix completion. arXiv preprint arXiv:1706.02263","author":"van den Berg Rianne","year":"2017","unstructured":"Rianne van den Berg , Thomas N Kipf , and Max Welling . 2017. Graph convolutional matrix completion. arXiv preprint arXiv:1706.02263 ( 2017 ). Rianne van den Berg, Thomas N Kipf, and Max Welling. 2017. Graph convolutional matrix completion. arXiv preprint arXiv:1706.02263 (2017)."},{"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 ). 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":"Stochastic training of graph convolutional networks with variance reduction. arXiv preprint arXiv:1710.10568","author":"Chen Jianfei","year":"2017","unstructured":"Jianfei Chen , Jun Zhu , and Le Song . 2017. Stochastic training of graph convolutional networks with variance reduction. arXiv preprint arXiv:1710.10568 ( 2017 ). Jianfei Chen, Jun Zhu, and Le Song. 2017. Stochastic training of graph convolutional networks with variance reduction. arXiv preprint arXiv:1710.10568 (2017)."},{"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","unstructured":"Dominik Csiba Zheng Qu and Peter Richt\u00e1rik. 2015. Stochastic dual coordinate ascent with adaptive probabilities. In ICML. 674--683.  Dominik Csiba Zheng Qu and Peter Richt\u00e1rik. 2015. Stochastic dual coordinate ascent with adaptive probabilities. In ICML. 674--683."},{"key":"e_1_3_2_1_7_1","volume-title":"Traffic graph convolutional recurrent neural network: A deep learning framework for network-scale traffic learning and forecasting","author":"Cui Zhiyong","year":"2019","unstructured":"Zhiyong Cui , Kristian Henrickson , Ruimin Ke , and Yinhai Wang . 2019. Traffic graph convolutional recurrent neural network: A deep learning framework for network-scale traffic learning and forecasting . IEEE Transactions on Intelligent Transportation Systems ( 2019 ). Zhiyong Cui, Kristian Henrickson, Ruimin Ke, and Yinhai Wang. 2019. Traffic graph convolutional recurrent neural network: A deep learning framework for network-scale traffic learning and forecasting. IEEE Transactions on Intelligent Transportation Systems (2019)."},{"key":"e_1_3_2_1_8_1","unstructured":"Songgaojun Deng Huzefa Rangwala and Yue Ning. 2019. Learning Dynamic Context Graphs for Predicting Social Events. In KDD. 1007--1016.  Songgaojun Deng Huzefa Rangwala and Yue Ning. 2019. Learning Dynamic Context Graphs for Predicting Social Events. In KDD. 1007--1016."},{"key":"e_1_3_2_1_9_1","unstructured":"Kien Do Truyen Tran and Svetha Venkatesh. 2019. Graph transformation policy network for chemical reaction prediction. In KDD. 750--760.  Kien Do Truyen Tran and Svetha Venkatesh. 2019. Graph transformation policy network for chemical reaction prediction. In KDD. 750--760."},{"key":"e_1_3_2_1_10_1","unstructured":"David K Duvenaud Dougal Maclaurin Jorge Iparraguirre Rafael Bombarell Timothy Hirzel Al\u00e1n Aspuru-Guzik and Ryan P Adams. 2015. Convolutional networks on graphs for learning molecular fingerprints. In NeurIPS. 2224--2232.  David K Duvenaud Dougal Maclaurin Jorge Iparraguirre Rafael Bombarell Timothy Hirzel Al\u00e1n Aspuru-Guzik and Ryan P Adams. 2015. Convolutional networks on graphs for learning molecular fingerprints. In NeurIPS. 2224--2232."},{"key":"e_1_3_2_1_11_1","unstructured":"Will Hamilton Zhitao Ying and Jure Leskovec. 2017. Inductive representation learning on large graphs. In NeurIPS. 1024--1034.  Will Hamilton Zhitao Ying and Jure Leskovec. 2017. Inductive representation learning on large graphs. In NeurIPS. 1024--1034."},{"key":"e_1_3_2_1_12_1","volume-title":"Not all samples are created equal: Deep learning with importance sampling. arXiv preprint arXiv:1803.00942","author":"Katharopoulos Angelos","year":"2018","unstructured":"Angelos Katharopoulos and Francc ois Fleuret . 2018. Not all samples are created equal: Deep learning with importance sampling. arXiv preprint arXiv:1803.00942 ( 2018 ). Angelos Katharopoulos and Francc ois Fleuret. 2018. Not all samples are created equal: Deep learning with importance sampling. arXiv preprint arXiv:1803.00942 (2018)."},{"key":"e_1_3_2_1_13_1","volume-title":"Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907","author":"Kipf Thomas N","year":"2016","unstructured":"Thomas N Kipf and Max Welling . 2016. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 ( 2016 ). Thomas N Kipf and Max Welling. 2016. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 (2016)."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Srijan Kumar Xikun Zhang and Jure Leskovec. 2019. Predicting dynamic embedding trajectory in temporal interaction networks. In KDD. 1269--1278.  Srijan Kumar Xikun Zhang and Jure Leskovec. 2019. Predicting dynamic embedding trajectory in temporal interaction networks. In KDD. 1269--1278.","DOI":"10.1145\/3292500.3330895"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Jia Li Zhichao Han Hong Cheng Jiao Su Pengyun Wang Jianfeng Zhang and Lujia Pan. 2019. Predicting Path Failure In Time-Evolving Graphs. In KDD. 1279--1289.  Jia Li Zhichao Han Hong Cheng Jiao Su Pengyun Wang Jianfeng Zhang and Lujia Pan. 2019. Predicting Path Failure In Time-Evolving Graphs. In KDD. 1279--1289.","DOI":"10.1145\/3292500.3330847"},{"key":"e_1_3_2_1_16_1","unstructured":"Ruoyu Li Sheng Wang Feiyun Zhu and Junzhou Huang. 2018. Adaptive graph convolutional neural networks. In AAAI .  Ruoyu Li Sheng Wang Feiyun Zhu and Junzhou Huang. 2018. Adaptive graph convolutional neural networks. In AAAI ."},{"key":"e_1_3_2_1_17_1","volume-title":"Adaptive sampling for incremental optimization using stochastic gradient descent","author":"Papa Guillaume","unstructured":"Guillaume Papa , Pascal Bianchi , and St\u00e9phan Cl\u00e9mencc on. 2015. Adaptive sampling for incremental optimization using stochastic gradient descent . In ALT. Springer , 317--331. Guillaume Papa, Pascal Bianchi, and St\u00e9phan Cl\u00e9mencc on. 2015. Adaptive sampling for incremental optimization using stochastic gradient descent. In ALT. Springer, 317--331."},{"key":"e_1_3_2_1_18_1","volume-title":"Tong Zhao, and Christos Faloutsos.","author":"Park Namyong","year":"2019","unstructured":"Namyong Park , Andrey Kan , Xin Luna Dong , Tong Zhao, and Christos Faloutsos. 2019 . Estimating node importance in knowledge graphs using graph neural networks. In KDD. 596--606. Namyong Park, Andrey Kan, Xin Luna Dong, Tong Zhao, and Christos Faloutsos. 2019. Estimating node importance in knowledge graphs using graph neural networks. In KDD. 596--606."},{"key":"e_1_3_2_1_19_1","unstructured":"Adam Paszke Sam Gross Francisco Massa Adam Lerer James Bradbury Gregory Chanan Trevor Killeen Zeming Lin Natalia Gimelshein Luca Antiga etal 2019. PyTorch: An imperative style high-performance deep learning library. In NeurIPS. 8024--8035.  Adam Paszke Sam Gross Francisco Massa Adam Lerer James Bradbury Gregory Chanan Trevor Killeen Zeming Lin Natalia Gimelshein Luca Antiga et al. 2019. PyTorch: An imperative style high-performance deep learning library. In NeurIPS. 8024--8035."},{"key":"e_1_3_2_1_20_1","unstructured":"Jiezhong Qiu Jian Tang Hao Ma Yuxiao Dong Kuansan Wang and Jie Tang. 2018. DeepInf: Modeling influence locality in large social networks. In KDD .  Jiezhong Qiu Jian Tang Hao Ma Yuxiao Dong Kuansan Wang and Jie Tang. 2018. DeepInf: Modeling influence locality in large social networks. In KDD ."},{"key":"e_1_3_2_1_21_1","volume-title":"Semi-supervised user geolocation via graph convolutional networks. arXiv preprint arXiv:1804.08049","author":"Rahimi Afshin","year":"2018","unstructured":"Afshin Rahimi , Trevor Cohn , and Timothy Baldwin . 2018. Semi-supervised user geolocation via graph convolutional networks. arXiv preprint arXiv:1804.08049 ( 2018 ). Afshin Rahimi, Trevor Cohn, and Timothy Baldwin. 2018. Semi-supervised user geolocation via graph convolutional networks. arXiv preprint arXiv:1804.08049 (2018)."},{"key":"e_1_3_2_1_22_1","unstructured":"Farnood Salehi Patrick Thiran and Elisa Celis. 2018. Coordinate descent with bandit sampling. In NeurIPS. 9247--9257.  Farnood Salehi Patrick Thiran and Elisa Celis. 2018. Coordinate descent with bandit sampling. In NeurIPS. 9247--9257."},{"key":"e_1_3_2_1_23_1","unstructured":"Sebastian U Stich Anant Raj and Martin Jaggi. 2017. Safe adaptive importance sampling. In NeurIPS. 4381--4391.  Sebastian U Stich Anant Raj and Martin Jaggi. 2017. Safe adaptive importance sampling. In NeurIPS. 4381--4391."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Hao Wang Tong Xu Qi Liu Defu Lian Enhong Chen Dongfang Du Han Wu and Wen Su. 2019 b. MCNE: An End-to-End Framework for Learning Multiple Conditional Network Representations of Social Network. In KDD. 1064--1072.  Hao Wang Tong Xu Qi Liu Defu Lian Enhong Chen Dongfang Du Han Wu and Wen Su. 2019 b. MCNE: An End-to-End Framework for Learning Multiple Conditional Network Representations of Social Network. In KDD. 1064--1072.","DOI":"10.1145\/3292500.3330931"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Hongwei Wang Fuzheng Zhang Mengdi Zhang Jure Leskovec Miao Zhao Wenjie Li and Zhongyuan Wang. 2019 c. Knowledge-aware graph neural networks with label smoothness regularization for recommender systems. In KDD. 968--977.  Hongwei Wang Fuzheng Zhang Mengdi Zhang Jure Leskovec Miao Zhao Wenjie Li and Zhongyuan Wang. 2019 c. Knowledge-aware graph neural networks with label smoothness regularization for recommender systems. In KDD. 968--977.","DOI":"10.1145\/3292500.3330836"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Xiang Wang Xiangnan He Yixin Cao Meng Liu and Tat-Seng Chua. 2019 a. Kgat: Knowledge graph attention network for recommendation. In KDD. 950--958.  Xiang Wang Xiangnan He Yixin Cao Meng Liu and Tat-Seng Chua. 2019 a. Kgat: Knowledge graph attention network for recommendation. In KDD. 950--958.","DOI":"10.1145\/3292500.3330989"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Rex Ying Ruining He Kaifeng Chen Pong Eksombatchai William L Hamilton and Jure Leskovec. 2018. Graph convolutional neural networks for web-scale recommender systems. In KDD. 974--983.  Rex Ying Ruining He Kaifeng Chen Pong Eksombatchai William L Hamilton and Jure Leskovec. 2018. Graph convolutional neural networks for web-scale recommender systems. In KDD. 974--983.","DOI":"10.1145\/3219819.3219890"},{"key":"e_1_3_2_1_28_1","volume-title":"Graphsaint: Graph sampling based inductive learning method. arXiv preprint arXiv:1907.04931","author":"Zeng Hanqing","year":"2019","unstructured":"Hanqing Zeng , Hongkuan Zhou , Ajitesh Srivastava , Rajgopal Kannan , and Viktor Prasanna . 2019 . Graphsaint: Graph sampling based inductive learning method. arXiv preprint arXiv:1907.04931 (2019). Hanqing Zeng, Hongkuan Zhou, Ajitesh Srivastava, Rajgopal Kannan, and Viktor Prasanna. 2019. Graphsaint: Graph sampling based inductive learning method. arXiv preprint arXiv:1907.04931 (2019)."},{"key":"e_1_3_2_1_29_1","volume-title":"Determinantal point processes for mini-batch diversification. arXiv preprint arXiv:1705.00607","author":"Zhang Cheng","year":"2017","unstructured":"Cheng Zhang , Hedvig Kjellstrom , and Stephan Mandt . 2017. Determinantal point processes for mini-batch diversification. arXiv preprint arXiv:1705.00607 ( 2017 ). Cheng Zhang, Hedvig Kjellstrom, and Stephan Mandt. 2017. Determinantal point processes for mini-batch diversification. arXiv preprint arXiv:1705.00607 (2017)."},{"key":"e_1_3_2_1_30_1","unstructured":"Peilin Zhao and Tong Zhang. 2015. Stochastic optimization with importance sampling for regularized loss minimization. In ICML. 1--9.  Peilin Zhao and Tong Zhang. 2015. Stochastic optimization with importance sampling for regularized loss minimization. In ICML. 1--9."},{"key":"e_1_3_2_1_31_1","unstructured":"Q Zheng P Richt\u00e1rik and T Zhang. 2014. Randomized dual coordinate ascent with arbitrary sampling.  Q Zheng P Richt\u00e1rik and T Zhang. 2014. Randomized dual coordinate ascent with arbitrary sampling."},{"key":"e_1_3_2_1_32_1","unstructured":"Rong Zhu. 2016. Gradient-based sampling: An adaptive importance sampling for least-squares. In NeurIPS. 406--414.  Rong Zhu. 2016. Gradient-based sampling: An adaptive importance sampling for least-squares. In NeurIPS. 406--414."},{"key":"e_1_3_2_1_33_1","unstructured":"Difan Zou Ziniu Hu Yewen Wang Song Jiang Yizhou Sun and Quanquan Gu. 2019. Layer-Dependent Importance Sampling for Training Deep and Large Graph Convolutional Networks. In NeurIPS. 11247--11256.  Difan Zou Ziniu Hu Yewen Wang Song Jiang Yizhou Sun and Quanquan Gu. 2019. Layer-Dependent Importance Sampling for Training Deep and Large Graph Convolutional Networks. In NeurIPS. 11247--11256."}],"event":{"name":"KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Virtual Event CA USA","acronym":"KDD '20","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 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3394486.3403192","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3394486.3403192","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:31:34Z","timestamp":1750181494000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3394486.3403192"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,20]]},"references-count":33,"alternative-id":["10.1145\/3394486.3403192","10.1145\/3394486"],"URL":"https:\/\/doi.org\/10.1145\/3394486.3403192","relation":{},"subject":[],"published":{"date-parts":[[2020,8,20]]},"assertion":[{"value":"2020-08-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}