paper-with-me

홈 › Papers

RIDA: A Robust Attack Framework on Incomplete Graphs

2024-07-25 · Jianke Yu, Hanchen Wang, Chen Chen, Xiaoyang Wang, Lu Qin, Wenjie Zhang, Ying Zhang, Xijuan Liu

Graph Neural Networks (GNNs) are vital in data science but are increasingly susceptible to adversarial attacks. To help researchers develop more robust GNN models, it's essential to focus on designing strong attack models as foundational benchmarks and guiding references. Among adversarial attacks, gray-box poisoning attacks are noteworthy due to their effectiveness and fewer constraints. These attacks exploit GNNs' need for retraining on updated data, thereby impacting their performance by perturbing these datasets. However, current research overlooks the real-world scenario of incomplete graphs.To address this gap, we introduce the Robust Incomplete Deep Attack Framework (RIDA). It is the first algorithm for robust gray-box poisoning attacks on incomplete graphs. The approach innovatively aggregates distant vertex information and ensures powerful data utilization.Extensive tests against 9 SOTA baselines on 3 real-world datasets demonstrate RIDA's superiority in handling incompleteness and high attack performance on the incomplete graph.

📄 PDF Abstract BibTeX arXiv:2407.18170

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

Focus 설명 없음

Similar Papers 제목 키워드 기반

FRIDA: Free-Rider Detection using Privacy Attacks

2024-10-07 · Pol G. Recasens, Ádám Horváth, Alberto Gutierrez-Torre, Jordi Torres 외

Federated learning is increasingly popular as it enables multiple parties with limited datasets and resources to train a high-performing machine learning model collaboratively. However, similarly to other collaborative s…

Federated Learning

Mithridates: Auditing and Boosting Backdoor Resistance of Machine Learning Pipelines

2023-02-09 · Eugene Bagdasaryan, Vitaly Shmatikov

Machine learning (ML) models trained on data from potentially untrusted sources are vulnerable to poisoning. A small, maliciously crafted subset of the training inputs can cause the model to learn a "backdoor" task (e.g.…

AutoMLFederated Learning

GIN-SD: Source Detection in Graphs with Incomplete Nodes via Positional Encoding and Attentive Fusion

2024-02-27 · Le Cheng, Peican Zhu, Keke Tang, Chao GAO 외

Source detection in graphs has demonstrated robust efficacy in the domain of rumor source identification. Although recent solutions have enhanced performance by leveraging deep neural networks, they often require complet…

HybridAugment++: Unified Frequency Spectra Perturbations for Model Robustness

2023-07-21 · ICCV 2023 1 · Mehmet Kerim Yucel, Ramazan Gokberk Cinbis, Pinar Duygulu

Convolutional Neural Networks (CNN) are known to exhibit poor generalization performance under distribution shifts. Their generalization have been studied extensively, and one line of work approaches the problem from a f…

Adversarial RobustnessData AugmentationmodelOut-of-Distribution Detection

Incomplete Graph Learning: A Comprehensive Survey

2025-02-18 · Riting Xia, Huibo Liu, Anchen Li, Xueyan Liu 외

Graph learning is a prevalent field that operates on ubiquitous graph data. Effective graph learning methods can extract valuable information from graphs. However, these methods are non-robust and affected by missing att…

AttributeGraph LearningSurvey