A Joint Graph Signal and Laplacian Denoising Network

Graph neural network (GNN) models have presented astonishing achievements in various application fields. However, they are shown to be vulnerable to adversarial attacks on graph structure and unnoticeable perturbations on the graph structure can cause significant performance drops in GNN models. Based on recent studies that reveal a class of GNN models is performing graph signal denoising (GSD), in this paper, we design a novel robust GNN model from a joint graph signal and Laplacian denoising problem (GSLD), named GSLDN. Specifically, GSLDN is built based on a block majorization-minimization algorithm for solving the GSLD problem. Designed in such a principled way, GSLDN is endowed with the power to fight against adversarial attacks on graph structure. Experiment results demonstrate the effectiveness of GSLDN.

Authors

Institutions

Publication Details

Published
2024-12-03
DOI
https://doi.org/10.1109/apsipaasc63619.2025.10849018
Citations
1
Primary Topic
Advanced Computing and Algorithms
Type
article
Field-Weighted Citation Impact
1.96
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Joint Graph Signal and Laplacian Denoising Network

Ziping Zhao, Zepeng Zhang
1 citations
Advanced Computing and Algorithms
1.96
article

A Joint Graph Signal and Laplacian Denoising Network

Ziping Zhao, Zepeng Zhang
article en
1 citations

Abstract

Graph neural network (GNN) models have presented astonishing achievements in various application fields. However, they are shown to be vulnerable to adversarial attacks on graph structure and unnoticeable perturbations on the graph structure can cause significant performance drops in GNN models. Based on recent studies that reveal a class of GNN models is performing graph signal denoising (GSD), in this paper, we design a novel robust GNN model from a joint graph signal and Laplacian denoising problem (GSLD), named GSLDN. Specifically, GSLDN is built based on a block majorization-minimization algorithm for solving the GSLD problem. Designed in such a principled way, GSLDN is endowed with the power to fight against adversarial attacks on graph structure. Experiment results demonstrate the effectiveness of GSLDN.

ShanghaiTech University (CN), École Polytechnique Fédérale de Lausanne (CH)
Openalex Percentile: Top 9%
Advanced Computing and Algorithms
1.96
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.