{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:02:13Z","timestamp":1750309333967,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T00:00:00Z","timestamp":1724457600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Shanghai Municipal Science and Technology Major Project","award":["2021SHZDZX0102"],"award-info":[{"award-number":["2021SHZDZX0102"]}]},{"DOI":"10.13039\/https:\/\/doi.org\/10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["92370201, 62202329, 62441605"],"award-info":[{"award-number":["92370201, 62202329, 62441605"]}],"id":[{"id":"10.13039\/https:\/\/doi.org\/10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shanghai Pujiang Program","award":["23PJ1412100"],"award-info":[{"award-number":["23PJ1412100"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,8,25]]},"DOI":"10.1145\/3637528.3671852","type":"proceedings-article","created":{"date-parts":[[2024,8,25]],"date-time":"2024-08-25T04:55:12Z","timestamp":1724561712000},"page":"2596-2607","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Certified Robustness on Visual Graph Matching via Searching Optimal Smoothing Range"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-5761-5114","authenticated-orcid":false,"given":"Huaqing","family":"Shao","sequence":"first","affiliation":[{"name":"Department of CSE and MoE Key Lab of AI, Shanghai Jiao Tong University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7696-5330","authenticated-orcid":false,"given":"Lanjun","family":"Wang","sequence":"additional","affiliation":[{"name":"SNMC, Tianjin University, Tianjin, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9712-8964","authenticated-orcid":false,"given":"Yongwei","family":"Wang","sequence":"additional","affiliation":[{"name":"SIAS and College of Computer Science, Zhejiang University, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2245-329X","authenticated-orcid":false,"given":"Qibing","family":"Ren","sequence":"additional","affiliation":[{"name":"Department of CSE, Shanghai Jiao Tong University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9639-7679","authenticated-orcid":false,"given":"Junchi","family":"Yan","sequence":"additional","affiliation":[{"name":"School of AI and Department of CSE, Shanghai Jiao Tong University, Shanghai, China"}]}],"member":"320","published-online":{"date-parts":[[2024,8,24]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Data Dependent Randomized Smoothing. In The 38th Conference on Uncertainty in Artificial Intelligence.","author":"Alfarra Motasem","year":"2022","unstructured":"Motasem Alfarra, Adel Bibi, Philip Torr, and Bernard Ghanem. 2022. Data Dependent Randomized Smoothing. In The 38th Conference on Uncertainty in Artificial Intelligence."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.07.063"},{"key":"e_1_3_2_2_3_1","volume-title":"International Conference on Machine Learning. PMLR, 1003--1013","author":"Bojchevski Aleksandar","year":"2020","unstructured":"Aleksandar Bojchevski, Johannes Klicpera, and Stephan G\u00fcnnemann. 2020. Efficient robustness certificates for discrete data: Sparsity-aware randomized smoothing for graphs, images and more. In International Conference on Machine Learning. PMLR, 1003--1013."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2009.5459303"},{"key":"e_1_3_2_2_5_1","first-page":"1275","article-title":"Detection as regression: Certified object detection with median smoothing","volume":"33","author":"Curry Michael","year":"2020","unstructured":"Ping-yeh Chiang, Michael Curry, Ahmed Abdelkader, Aounon Kumar, John Dickerson, and Tom Goldstein. 2020. Detection as regression: Certified object detection with median smoothing. Advances in Neural Information Processing Systems, Vol. 33 (2020), 1275--1286.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.11"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15555-0_36"},{"key":"e_1_3_2_2_8_1","volume-title":"International Conference on Machine Learning. PMLR, 1310--1320","author":"Cohen Jeremy","year":"2019","unstructured":"Jeremy Cohen, Elan Rosenfeld, and Zico Kolter. 2019. Certified adversarial robustness via randomized smoothing. In International Conference on Machine Learning. PMLR, 1310--1320."},{"key":"e_1_3_2_2_9_1","volume-title":"Philip HS Torr","author":"Eiras Francisco","year":"2021","unstructured":"Francisco Eiras, Motasem Alfarra, M Pawan Kumar, Philip HS Torr, Puneet K Dokania, Bernard Ghanem, and Adel Bibi. 2021. Ancer: Anisotropic certification via sample-wise volume maximization. arXiv preprint arXiv:2107.04570 (2021)."},{"key":"e_1_3_2_2_10_1","volume-title":"Fifty years of graph matching, network alignment and network comparison. Information sciences","author":"Emmert-Streib Frank","year":"2016","unstructured":"Frank Emmert-Streib, Matthias Dehmer, and Yongtang Shi. 2016. Fifty years of graph matching, network alignment and network comparison. Information sciences, Vol. 346 (2016), 180--197."},{"key":"e_1_3_2_2_11_1","volume-title":"Christopher KI Williams, John Winn, and Andrew Zisserman.","author":"Everingham Mark","year":"2010","unstructured":"Mark Everingham, Luc Van Gool, Christopher KI Williams, John Winn, and Andrew Zisserman. 2010. The pascal visual object classes (voc) challenge. International journal of computer vision, Vol. 88, 2 (2010), 303--338."},{"key":"e_1_3_2_2_12_1","volume-title":"Generalization of Neural Combinatorial Solvers Through the Lens of Adversarial Robustness. arXiv preprint arXiv:2110.10942","author":"Geisler Simon","year":"2021","unstructured":"Simon Geisler, Johanna Sommer, Jan Schuchardt, Aleksandar Bojchevski, and Stephan G\u00fcnnemann. 2021. Generalization of Neural Combinatorial Solvers Through the Lens of Adversarial Robustness. arXiv preprint arXiv:2110.10942 (2021)."},{"key":"e_1_3_2_2_13_1","volume-title":"Rethinking and Benchmarking Predict-then-Optimize Paradigm for Combinatorial Optimization Problems. arXiv preprint arXiv:2311.07633","author":"Geng H","year":"2023","unstructured":"H Geng, H Ruan, R Wang, Y Li, Y Wang, L Chen, and J Yan. 2023. Rethinking and Benchmarking Predict-then-Optimize Paradigm for Combinatorial Optimization Problems. arXiv preprint arXiv:2311.07633 (2023)."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380029"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2020.2989928"},{"volume-title":"A Course in the Geometry of n Dimensions","author":"Kendall Maurice G","key":"e_1_3_2_2_16_1","unstructured":"Maurice G Kendall. 2004. A Course in the Geometry of n Dimensions. Courier Corporation."},{"key":"e_1_3_2_2_17_1","first-page":"5560","article-title":"Center Smoothing: Certified Robustness for Networks with Structured Outputs","volume":"34","author":"Kumar Aounon","year":"2021","unstructured":"Aounon Kumar and Tom Goldstein. 2021. Center Smoothing: Certified Robustness for Networks with Structured Outputs. Advances in Neural Information Processing Systems, Vol. 34 (2021), 5560--5575.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2019.00044"},{"key":"e_1_3_2_2_19_1","first-page":"219","article-title":"Two Algorithms for Constructing a Delaunay Triangulation","volume":"9","author":"Lee D. T.","year":"1980","unstructured":"D. T. Lee and B. J. Schachter. 1980. Two Algorithms for Constructing a Delaunay Triangulation. International Journal of Parallel Programming, Vol. 9, 3 (1980), 219--242.","journal-title":"International Journal of Parallel Programming"},{"key":"e_1_3_2_2_20_1","volume-title":"Advances in Neural Information Processing Systems","volume":"32","author":"Lee Guang-He","year":"2019","unstructured":"Guang-He Lee, Yang Yuan, Shiyu Chang, and Tommi Jaakkola. 2019. Tight certificates of adversarial robustness for randomly smoothed classifiers. Advances in Neural Information Processing Systems, Vol. 32 (2019)."},{"key":"e_1_3_2_2_21_1","volume-title":"International Conference on Machine Learning. PMLR, 6254--6264","author":"Levine Alexander J","year":"2021","unstructured":"Alexander J Levine and Soheil Feizi. 2021. Improved, deterministic smoothing for L_1 certified robustness. In International Conference on Machine Learning. PMLR, 6254--6264."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV51070.2023.02135"},{"key":"e_1_3_2_2_23_1","volume-title":"Paulo Oswaldo Boaventura-Netto, Peter Hahn, and Tania Querido.","author":"Loiola Eliane Maria","year":"2007","unstructured":"Eliane Maria Loiola, Nair Maria Maia de Abreu, Paulo Oswaldo Boaventura-Netto, Peter Hahn, and Tania Querido. 2007. A survey for the quadratic assignment problem. European journal of operational research, Vol. 176, 2 (2007), 657--690."},{"key":"e_1_3_2_2_24_1","volume-title":"Mind Your Solver! On Adversarial Attack and Defense for Combinatorial Optimization. arXiv preprint arXiv:2201.00402","author":"Lu Han","year":"2021","unstructured":"Han Lu, Zenan Li, Runzhong Wang, Qibing Ren, Junchi Yan, and Xiaokang Yang. 2021. Mind Your Solver! On Adversarial Attack and Defense for Combinatorial Optimization. arXiv preprint arXiv:2201.00402 (2021)."},{"key":"e_1_3_2_2_25_1","volume-title":"Spair-71k: A large-scale benchmark for semantic correspondence. arXiv preprint arXiv:1908.10543","author":"Min Juhong","year":"2019","unstructured":"Juhong Min, Jongmin Lee, Jean Ponce, and Minsu Cho. 2019. Spair-71k: A large-scale benchmark for semantic correspondence. arXiv preprint arXiv:1908.10543 (2019)."},{"key":"e_1_3_2_2_26_1","volume-title":"International Conference on Machine Learning. PMLR, 8982--8997","author":"Ren Jiaxiang","year":"2021","unstructured":"Jiaxiang Ren, Zijie Zhang, Jiayin Jin, Xin Zhao, Sixing Wu, Yang Zhou, Yelong Shen, Tianshi Che, Ruoming Jin, and Dejing Dou. 2021. Integrated defense for resilient graph matching. In International Conference on Machine Learning. PMLR, 8982--8997."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52688.2022.01483"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00764"},{"key":"e_1_3_2_2_29_1","volume-title":"Dropedge: Towards deep graph convolutional networks on node classification. arXiv preprint arXiv:1907.10903","author":"Rong Yu","year":"2019","unstructured":"Yu Rong, Wenbing Huang, Tingyang Xu, and Junzhou Huang. 2019. Dropedge: Towards deep graph convolutional networks on node classification. arXiv preprint arXiv:1907.10903 (2019)."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599493"},{"key":"e_1_3_2_2_31_1","volume-title":"A long trip in the charming world of graphs for Pattern Recognition. Pattern Recognition","author":"Vento M.","year":"2015","unstructured":"M. Vento. 2015. A long trip in the charming world of graphs for Pattern Recognition. Pattern Recognition (2015)."},{"key":"e_1_3_2_2_32_1","volume-title":"ACM Transactions on Graphics (TOG) - SIGGRAPH 2012 Conference Proceedings","volume":"31","year":"2012","unstructured":"Vladimir, G., Kim, Wilmot, Li, Niloy, J., Mitra, Stephen, and DiVerdi. 2012. Exploring collections of 3D models using fuzzy correspondences. ACM Transactions on Graphics (TOG) - SIGGRAPH 2012 Conference Proceedings, Vol. 31, 4 (2012), 1--11."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00315"},{"key":"e_1_3_2_2_34_1","volume-title":"Neural graph matching network: Learning lawler's quadratic assignment problem with extension to hypergraph and multiple-graph matching","author":"Wang Runzhong","year":"2021","unstructured":"Runzhong Wang, Junchi Yan, and Xiaokang Yang. 2021. Neural graph matching network: Learning lawler's quadratic assignment problem with extension to hypergraph and multiple-graph matching. IEEE Transactions on Pattern Analysis and Machine Intelligence (2021)."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2020.3005590"},{"key":"e_1_3_2_2_36_1","volume-title":"International Conference on Machine Learning. PMLR, 5286--5295","author":"Wong Eric","year":"2018","unstructured":"Eric Wong and Zico Kolter. 2018. Provable defenses against adversarial examples via the convex outer adversarial polytope. In International Conference on Machine Learning. PMLR, 5286--5295."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00469"},{"key":"e_1_3_2_2_38_1","unstructured":"Junchi Yan Shuang Yang and Edwin Hancock. 2020. Learning Graph Matching and Related Combinatorial Optimization Problems. In IJCAI."},{"key":"e_1_3_2_2_39_1","volume-title":"International Conference on Machine Learning. PMLR, 10693--10705","author":"Yang Greg","year":"2020","unstructured":"Greg Yang, Tony Duan, J Edward Hu, Hadi Salman, Ilya Razenshteyn, and Jerry Li. 2020. Randomized smoothing of all shapes and sizes. In International Conference on Machine Learning. PMLR, 10693--10705."},{"key":"e_1_3_2_2_40_1","volume-title":"International conference on learning representations.","author":"Yu Tianshu","year":"2019","unstructured":"Tianshu Yu, Runzhong Wang, Junchi Yan, and Baoxin Li. 2019. Learning deep graph matching with channel-independent embedding and hungarian attention. In International conference on learning representations."},{"key":"e_1_3_2_2_41_1","volume-title":"Joint Transformation Learning via the L 2, 1-Norm Metric for Robust Graph Matching","author":"Yu Yu-Feng","year":"2019","unstructured":"Yu-Feng Yu, Guoxia Xu, Min Jiang, Hu Zhu, Dao-Qing Dai, and Hong Yan. 2019. Joint Transformation Learning via the L 2, 1-Norm Metric for Robust Graph Matching. IEEE transactions on cybernetics, Vol. 51, 2 (2019), 521--533."},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00284"},{"key":"e_1_3_2_2_43_1","volume-title":"Macer: Attack-free and scalable robust training via maximizing certified radius. arXiv preprint arXiv:2001.02378","author":"Zhai Runtian","year":"2020","unstructured":"Runtian Zhai, Chen Dan, Di He, Huan Zhang, Boqing Gong, Pradeep Ravikumar, Cho-Jui Hsieh, and Liwei Wang. 2020. Macer: Attack-free and scalable robust training via maximizing certified radius. arXiv preprint arXiv:2001.02378 (2020)."},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539248"},{"key":"e_1_3_2_2_45_1","first-page":"20834","article-title":"Adversarial attacks on deep graph matching","volume":"33","author":"Zhang Zijie","year":"2020","unstructured":"Zijie Zhang, Zeru Zhang, Yang Zhou, Yelong Shen, Ruoming Jin, and Dejing Dou. 2020. Adversarial attacks on deep graph matching. Advances in Neural Information Processing Systems, Vol. 33 (2020), 20834--20851.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403217"}],"event":{"name":"KDD '24: The 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Barcelona Spain","acronym":"KDD '24"},"container-title":["Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3637528.3671852","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3637528.3671852","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:04:14Z","timestamp":1750291454000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3637528.3671852"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,24]]},"references-count":46,"alternative-id":["10.1145\/3637528.3671852","10.1145\/3637528"],"URL":"https:\/\/doi.org\/10.1145\/3637528.3671852","relation":{},"subject":[],"published":{"date-parts":[[2024,8,24]]},"assertion":[{"value":"2024-08-24","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}