Robustness Verification of Deep Graph Neural Networks Tightened by Linear Approximation.

Xingyu Zeng|Han Li|Qi Qi|Jingyu Wang|Haodong Deng|Haifeng Sun|Zirui Zhuang|Jianxin Liao


Anthology ID:DBLP:conf/wsdm/ZengL0WD0ZL25
Volume:Proceedings of the Eighteenth ACM International Conference on Web Search and Data Mining, WSDM 2025, Hannover, Germany, March 10-14, 2025
Year:2025
Venue:Web Search and Data Mining (WSDM)
Publisher:ACM
Pages:281-289
URL:https://doi.org/10.1145/3701551.3703506
DOI:https://doi.org/10.1145/3701551.3703506
DBLP:conf/wsdm/ZengL0WD0ZL25
BibTeX:
@inproceedings{zeng-2025-robustness, author = {Xingyu Zeng and Han Li and Qi Qi and Jingyu Wang and Haodong Deng and Haifeng Sun and Zirui Zhuang and Jianxin Liao}, editor = {Wolfgang Nejdl and S\"{o}ren Auer and Meeyoung Cha and Marie-Francine Moens and Marc Najork}, title = {{Robustness Verification of Deep Graph Neural Networks Tightened by Linear Approximation}}, booktitle = {{Proceedings of the Eighteenth ACM International Conference on Web Search and Data Mining, WSDM 2025, Hannover, Germany, March 10-14, 2025}}, pages = {281--289}, publisher = {ACM}, year = {2025}, url = {https://doi.org/10.1145/3701551.3703506}, doi = {https://doi.org/10.1145/3701551.3703506} }