Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

4218411,2621,682 · Jun 202019922001200920172026
48 results for graph adversarial learning

Pro-GNN defends graph neural networks from adversarial attacks by learning graph structure.

problem Vulnerability of GNNs to adversarial attacks on real-world graphs.
method Pro-GNN learns a structural graph and a robust GNN model jointly from perturbed graphs guided by intrinsic graph properties.
result Pro-GNN achieves significantly better performance than state-of-the-art defense methods, even on heavily perturbed graphs.

Paper shows how to hide individuals in graphs to fool community detection models.

problem Adversarial attack on community detection models by hiding individuals.
method Iterative learning framework that updates a graph generator and a community detection model.
result Adversarial graphs generated by the method can fool multiple community detection models.

Graph embedding aims to transfer a graph into vectors to facilitate subsequent graph analytics tasks like link prediction and graph clustering. Most approaches on graph embedding focus on preserving the graph structure or minimizing the reconstruction errors for graph data. They have mostly overlooked the embedding dis…

2019-01-04abs ↗pdf ↗

Graph embedding is an effective method to represent graph data in a low dimensional space for graph analytics. Most existing embedding algorithms typically focus on preserving the topological structure or minimizing the reconstruction errors of graph data, but they have mostly ignored the data distribution of the laten…

2018-02-13abs ↗pdf ↗

Bayesian optimisation method targets graph classification models against adversarial attacks.

problem Adversarial attacks on graph classification models, especially for graph-level tasks.
method Bayesian optimisation-based attack method for graph classification models.
result Effectiveness and flexibility of the proposed method validated on various graph classification tasks.

New principle controls graph-informed adversarial discrepancies.

problem Graph-informed adversarial learning for interpolative divergences.
method Proves infimal subadditivity for interpolative divergences.
result Graph-informed adversarial learning is justified for interpolative divergences.

AdvImmune improves certifiable robustness of GNNs against adversarial attacks.

problem Vulnerability of graph neural networks to adversarial attacks.
method Proposes AdvImmune, an algorithm that optimizes with meta-gradient to improve certifiable robustness.
result Remarkably improves the ratio of robust nodes by 12%, 42%, 65% with an affordable immune budget of only 5% edges.

Graphs can be fooled by small edge changes, but this work protects them.

problem Adversaries can manipulate graph data to mislead graph classification models.
method We introduce a smoothed graph classification model with a robustness guarantee.
result The smoothed model maintains consistent predictions under small adversarial perturbations.

Graph Information Bottleneck (GIB) optimizes graph representations for robustness against adversarial attacks.

problem Challenges in learning graph representations due to structure and feature information.
method GIB is an information-theoretic principle that balances expressiveness and robustness by maximizing mutual information between representation and target, while constraining mutual information with input data.
result GIB-based models are more robust to adversarial attacks, achieving up to 31% improvement.

Graph neural network (GNN), as a powerful representation learning model on graph data, attracts much attention across various disciplines. However, recent studies show that GNN is vulnerable to adversarial attacks. How to make GNN more robust? What are the key vulnerabilities in GNN? How to address the vulnerabilities …

2019-05-09abs ↗pdf ↗

Real-world graph applications, such as advertisements and product recommendations make profits based on accurately classify the label of the nodes. However, in such scenarios, there are high incentives for the adversaries to attack such graph to reduce the node classification performance. Previous work on graph adversa…

2019-09-14abs ↗pdf ↗

Deep learning models for graphs have achieved strong performance for the task of node classification. Despite their proliferation, currently there is no study of their robustness to adversarial attacks. Yet, in domains where they are likely to be used, e.g. the web, adversaries are common. Can deep learning models for …

2018-05-21abs ↗pdf ↗

This paper explores vulnerabilities in hierarchical graph pooling neural networks for graph classification.

problem Vulnerability of hierarchical graph pooling neural networks in graph classification tasks.
method Proposes an adversarial attack framework using a surrogate model to generate adversarial samples.
result Adversarial samples can fool hierarchical GNN-based graph classification models, demonstrating their vulnerability.

Adversarial training improves graph autoencoder generalization.

problem Improving graph autoencoder generalization.
method Formulated L2 and L1 adversarial training for graph autoencoders and variational graph autoencoders.
result Adversarial training boosts graph autoencoder and variational graph autoencoder generalization.

Recent methods for generating novel molecules use graph representations of molecules and employ various forms of graph convolutional neural networks for inference. However, training requires solving an expensive graph isomorphism problem, which previous approaches do not address or solve only approximately. In this wor…

2019-05-24abs ↗pdf ↗

We derive upper and lower bounds for the policy regret of TT-round online learning problems with graph-structured feedback, where the adversary is nonoblivious but assumed to have a bounded memory. We obtain upper bounds of O~(T2/3)\widetilde O(T^{2/3}) and O~(T3/4)\widetilde O(T^{3/4}) for strongly-observable and weakly-observab…

2018-04-01abs ↗pdf ↗

Paper defends sensitive attributes in GNNs from inference attacks.

problem Protecting sensitive attributes in GNNs from inference attacks.
method Proposes adversarial training with TV and Wasserstein distance to locally filter sensitive attributes.
result Framework creates strong defense against inference attacks with minimal performance loss.

Indirect attacks can fool graph classifiers even with poisoned neighbors.

problem How to evaluate and defend graph convolutional neural networks against indirect adversarial attacks.
method Proposed a method to generate adversarial perturbations on a single node far from the target.
result 99% attack success rate within two-hops from the target in two datasets.

Deep neural networks (DNN) have achieved unprecedented success in numerous machine learning tasks in various domains. However, the existence of adversarial examples has raised concerns about applying deep learning to safety-critical applications. As a result, we have witnessed increasing interests in studying attack an…

2019-09-17abs ↗pdf ↗

UAG defends GNNs against adversarial attacks by quantifying and explaining uncertainties.

problem Lack of uncertainty quantification in GNNs makes them vulnerable to adversarial attacks.
method UAG uses Bayesian Uncertainty Technique (BUT) and Uncertainty-aware Attention Technique (UAT).
result UAG outperforms state-of-the-art solutions in defending adversarial attacks on GNNs.

DefenseVGAE defends graph neural networks against adversarial attacks.

problem Vulnerability of GNNs to adversarial structural perturbations.
method Variational Graph Autoencoder (VGAE) to reconstruct graph structure.
result DefenseVGAE reduces adversarial perturbations and boosts GCN performance.

Study examines unsupervised and graph-based methods for anomaly detection in IoBT, outperformed by supervised stacking ensemble.

problem Anomaly detection in adversarial environments of IoBT.
method Unsupervised learning, graph-based methods, ensemble supervised learning, adversarial training.
result Supervised stacking ensemble method outperforms unsupervised and graph-based methods in detecting anomalies.

Generative model for inferring graph from time series data.

problem Generating graphs conditioned on multivariate time series data.
method Time Series Conditioned Graph Generation-Generative Adversarial Networks (TSGG-GAN).
result Demonstrates effectiveness and generalizability of TSGG-GAN on synthetic and real-world datasets.

Active learning (AL) on attributed graphs has received increasing attention with the prevalence of graph-structured data. Although AL has been widely studied for alleviating label sparsity issues with the conventional non-related data, how to make it effective over attributed graphs remains an open research question. E…

2019-08-22abs ↗pdf ↗

IDGL learns better graph structure and embeddings iteratively.

problem Improving graph neural network node embeddings and graph structure.
method Iterative Deep Graph Learning framework that dynamically stops when graph structure optimizes for downstream tasks.
result IDGL consistently outperforms state-of-the-art baselines on nine benchmarks.

Deep learning on graph structures has shown exciting results in various applications. However, few attentions have been paid to the robustness of such models, in contrast to numerous research work for image or text adversarial attack and defense. In this paper, we focus on the adversarial attacks that fool the model by…

2018-06-06abs ↗pdf ↗

The paper examines how neural network topology affects adversarial robustness.

problem Understanding how neural network topology influences adversarial robustness.
method Investigated the graph of input traversing all layers of a neural network, comparing clean and adversarial inputs.
result Under-optimized edges in neural network graphs are a source of adversarial vulnerability and can be used to detect adversarial inputs.

This paper examines how graph topology affects adversarial attacks on vertex classification.

problem Adversarial attacks on vertex classification are vulnerable to graph topology changes.
method Examined two topological graph characteristics and their impact on adversary perturbation budgets.
result Training sets including high-degree vertices or those ensuring all unlabeled nodes have neighbors can significantly increase the adversary's perturbation budget.

The goal of network representation learning is to learn low-dimensional node embeddings that capture the graph structure and are useful for solving downstream tasks. However, despite the proliferation of such methods, there is currently no study of their robustness to adversarial attacks. We provide the first adversari…

2018-09-04abs ↗pdf ↗

Adversarial CBO optimizes under interventions by adversaries and non-stationarities.

problem Optimizing in the presence of adversaries and non-stationary factors.
method Formalizes CBO as ACBO, introduces CBO-MW algorithm combining online learning and causal modeling.
result First algorithm with bounded regret for ACBO, achieving superior performance in synthetic and real-world environments.

Graph neural networks are vulnerable to adversarial attacks by manipulating graph structure.

problem Vulnerability of Graph Neural Networks to adversarial attacks.
method Categorization and review of existing attacks and defenses.
result Developed a repository for empirical studies on graph adversarial attacks and defenses.

Generative model predicts multiple brain graphs from one, preserving topology.

problem Predicting multiple brain graphs from a single one, preserving topology.
method MultiGraphGAN architecture, graph adversarial auto-encoder, cluster-specific decoders, topological loss.
result Significantly outperformed variants in multi-view brain graph generation.

Paper improves robustness of GNNs against adversarial attacks.

problem Understanding robust generalization of GNNs in adversarial settings.
method Develops a sensitivity-aware PAC-Bayesian framework for MPGNNs.
result Derives tighter robust generalization bounds for MPGNNs.