{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T10:56:28Z","timestamp":1755600988846,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,10,19]],"date-time":"2020-10-19T00:00:00Z","timestamp":1603065600000},"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,10,19]]},"DOI":"10.1145\/3340531.3412089","type":"proceedings-article","created":{"date-parts":[[2020,10,19]],"date-time":"2020-10-19T05:31:01Z","timestamp":1603085461000},"page":"2181-2184","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Training Sensitivity in Graph Isomorphism Network"],"prefix":"10.1145","author":[{"given":"Md. Khaledur","family":"Rahman","sequence":"first","affiliation":[{"name":"Indiana University Bloomington, Bloomington, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,10,19]]},"reference":[{"key":"e_1_3_2_2_1_1","first-page":"8","article-title":"Stochastic gradient learning in neural networks","volume":"91","author":"Bottou L","year":"1991","unstructured":"Bottou , L . Stochastic gradient learning in neural networks . Proceedings of Neuro-Nmes 91 , 8 ( 1991 ), 12. Bottou, L. Stochastic gradient learning in neural networks. Proceedings of Neuro-Nmes 91, 8 (1991), 12.","journal-title":"Proceedings of Neuro-Nmes"},{"key":"e_1_3_2_2_2_1","volume-title":"FastGCN: fast learning with graph convolutional networks via importance sampling. arXiv:1801.10247","author":"Chen J.","year":"2018","unstructured":"Chen , J. , Ma , T. , and Xiao , C . FastGCN: fast learning with graph convolutional networks via importance sampling. arXiv:1801.10247 ( 2018 ). Chen, J., Ma, T., and Xiao, C. FastGCN: fast learning with graph convolutional networks via importance sampling. arXiv:1801.10247 (2018)."},{"key":"e_1_3_2_2_3_1","volume-title":"Jul","author":"Duchi J.","year":"2011","unstructured":"Duchi , J. , Hazan , E. , and Singer , Y . Adaptive subgradient methods for online learning and stochastic optimization. Journal of machine learning research 12 , Jul ( 2011 ), 2121--2159. Duchi, J., Hazan, E., and Singer, Y. Adaptive subgradient methods for online learning and stochastic optimization. Journal of machine learning research 12, Jul (2011), 2121--2159."},{"key":"e_1_3_2_2_4_1","volume-title":"A fair comparison of graph neural networks for graph classification. arXiv:1912.09893","author":"Errica F.","year":"2019","unstructured":"Errica , F. , Podda , M. , Bacciu , D. , and Micheli , A . A fair comparison of graph neural networks for graph classification. arXiv:1912.09893 ( 2019 ). Errica, F., Podda, M., Bacciu, D., and Micheli, A. A fair comparison of graph neural networks for graph classification. arXiv:1912.09893 (2019)."},{"key":"e_1_3_2_2_5_1","first-page":"855","volume-title":"ACM","author":"Grover A.","unstructured":"Grover , A. , and Leskovec , J . node2vec: Scalable feature learning for networks. In KDD (2016) , ACM , pp. 855 -- 864 . Grover, A., and Leskovec, J. node2vec: Scalable feature learning for networks. In KDD (2016), ACM, pp. 855--864."},{"key":"e_1_3_2_2_6_1","first-page":"1024","volume-title":"NIPS","author":"Hamilton W.","year":"2017","unstructured":"Hamilton , W. , Ying , Z. , and Leskovec , J . Inductive representation learning on large graphs . In NIPS ( 2017 ), pp. 1024 -- 1034 . Hamilton, W., Ying, Z., and Leskovec, J. Inductive representation learning on large graphs. In NIPS (2017), pp. 1024--1034."},{"key":"e_1_3_2_2_7_1","volume-title":"Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980","author":"Kingma D. P.","year":"2014","unstructured":"Kingma , D. P. , and Ba , J . Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 ( 2014 ). Kingma, D. P., and Ba, J. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)."},{"key":"e_1_3_2_2_8_1","volume-title":"Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907","author":"Kipf T. N.","year":"2016","unstructured":"Kipf , T. N. , and Welling , M . Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 ( 2016 ). Kipf, T. N., and Welling, M. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 (2016)."},{"key":"e_1_3_2_2_9_1","first-page":"1097","volume-title":"NIPS","author":"Krizhevsky A.","year":"2012","unstructured":"Krizhevsky , A. , Sutskever , I. , and Hinton , G. E . Imagenet classification with deep convolutional neural networks . In NIPS ( 2012 ), pp. 1097 -- 1105 . Krizhevsky, A., Sutskever, I., and Hinton, G. E. Imagenet classification with deep convolutional neural networks. In NIPS (2012), pp. 1097--1105."},{"key":"e_1_3_2_2_10_1","first-page":"807","volume-title":"ICML","author":"Nair V.","year":"2010","unstructured":"Nair , V. , and Hinton , G. E . Rectified linear units improve restricted boltzmann machines . In ICML ( 2010 ), pp. 807 -- 814 . Nair, V., and Hinton, G. E. Rectified linear units improve restricted boltzmann machines. In ICML (2010), pp. 807--814."},{"key":"e_1_3_2_2_11_1","first-page":"701","volume-title":"ACM","author":"Perozzi B.","unstructured":"Perozzi , B. , Al-Rfou , R. , and Skiena , S . DeepWalk: Online learning of social representations. In KDD (2014) , ACM , pp. 701 -- 710 . Perozzi, B., Al-Rfou, R., and Skiena, S. DeepWalk: Online learning of social representations. In KDD (2014), ACM, pp. 701--710."},{"key":"e_1_3_2_2_12_1","volume-title":"The digitization of the world from edge to core. IDC White Paper","author":"Reinsel D.","year":"2018","unstructured":"Reinsel , D. , Gantz , J. , and Rydning , J . The digitization of the world from edge to core. IDC White Paper ( 2018 ). Reinsel, D., Gantz, J., and Rydning, J. The digitization of the world from edge to core. IDC White Paper (2018)."},{"key":"e_1_3_2_2_13_1","volume-title":"Graph attention networks. arXiv:1710.10903","author":"Cucurull G.","year":"2017","unstructured":"P., Cucurull , G. , Casanova , A. , Romero , A. , Lio , P. , and Bengio , Y . Graph attention networks. arXiv:1710.10903 ( 2017 ). P., Cucurull, G., Casanova, A., Romero, A., Lio, P., and Bengio, Y. Graph attention networks. arXiv:1710.10903 (2017)."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4380-9_16"},{"key":"e_1_3_2_2_15_1","volume-title":"How powerful are graph neural networks? arXiv preprint arXiv:1810.00826","author":"Xu K.","year":"2018","unstructured":"Xu , K. , Hu , W. , Leskovec , J. , and Jegelka , S . How powerful are graph neural networks? arXiv preprint arXiv:1810.00826 ( 2018 ). Xu, K., Hu, W., Leskovec, J., and Jegelka, S. How powerful are graph neural networks? arXiv preprint arXiv:1810.00826 (2018)."},{"key":"e_1_3_2_2_16_1","volume-title":"Adadelta: an adaptive learning rate method. arXiv:1212.5701","author":"Zeiler M. D.","year":"2012","unstructured":"Zeiler , M. D. Adadelta: an adaptive learning rate method. arXiv:1212.5701 ( 2012 ). Zeiler, M. D. Adadelta: an adaptive learning rate method. arXiv:1212.5701 (2012)."}],"event":{"name":"CIKM '20: The 29th ACM International Conference on Information and Knowledge Management","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Virtual Event Ireland","acronym":"CIKM '20"},"container-title":["Proceedings of the 29th ACM International Conference on Information & Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340531.3412089","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3340531.3412089","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:30Z","timestamp":1750197750000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340531.3412089"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,19]]},"references-count":16,"alternative-id":["10.1145\/3340531.3412089","10.1145\/3340531"],"URL":"https:\/\/doi.org\/10.1145\/3340531.3412089","relation":{},"subject":[],"published":{"date-parts":[[2020,10,19]]},"assertion":[{"value":"2020-10-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}