Adversarial contamination of networks in the setting of vertex nomination: a new trimming method
Sheyda Peyman, Minh Tang, Vince Lyzinski

TL;DR
This paper introduces a novel model-based trimming method to improve robustness in vertex nomination tasks under adversarial network contamination, outperforming traditional direct trimming techniques.
Contribution
A new model space trimming approach for vertex nomination enhances robustness against adversarial contamination, with better theoretical properties and empirical performance.
Findings
Model trimming effectively mitigates adversarial contamination.
Proposed method outperforms direct trimming in simulations.
The approach is adaptable to different contamination types.
Abstract
As graph data becomes more ubiquitous, the need for robust inferential graph algorithms to operate in these complex data domains is crucial. In many cases of interest, inference is further complicated by the presence of adversarial data contamination. The effect of the adversary is frequently to change the data distribution in ways that negatively affect statistical and algorithmic performance. We study this phenomenon in the context of vertex nomination, a semi-supervised information retrieval task for network data. Here, a common suite of methods relies on spectral graph embeddings, which have been shown to provide both good algorithmic performance and flexible settings in which regularization techniques can be implemented to help mitigate the effect of an adversary. Many current regularization methods rely on direct network trimming to effectively excise the adversarial…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Complex Network Analysis Techniques · Functional Brain Connectivity Studies
