The paper presents provable guarantees for a spectral method that recovers binary node labels on signed graphs with edge‑flip noise. It provides graph‑structure‑agnostic bounds on approximate inference accuracy and maximum angle deviation, using matrix concentration and eigenvector perturbation techniques. The results connect to the Cheeger constant and are validated with synthetic experiments, marking the first theoretical analysis of this spectral approach.
By Violet Zheng, Jean Honorio
arXiv:2608. 12757v1 Announce Type: cross Abstract: Laplacian-regularized minimization is fundamental in signal processing and machine learning, but is limited by the dense and ill-conditioned nature of the graph Laplacian pseudoinverse.
By Liping Tao, Chee Wei Tan
arXiv:2608. 00836v1 Announce Type: new Abstract: While signed-directed graphs have been studied using linear Laplacians in the design of graph neural networks, relatively little research has focused on developing non-linear Laplacian operators for such networks.
By Ali Parviz, Yuichi Yoshida
The paper investigates how signed graph filters respond to structural changes such as edge additions, deletions, and sign flips. It shows that both the nature of the edge perturbation and the correlation among node features jointly influence the stability of learned representations. Leveraging this insight, the authors propose a perturbation strategy that targets structurally influential signed edges, and experiments demonstrate that this approach causes greater embedding drift, polarity change, and link‑prediction degradation than baseline methods.
By Ning Zhang, Li Zhang
arXiv:2607. 06546v1 Announce Type: cross Abstract: Denoising graphs is a fundamental problem in graph learning and the core operation of graph diffusion models.
By Shervin Khalafi, Igor Krawczuk, Sergio Rozada, Charilaos Kanatsoulis, Antonio G Marques, Alejandro Ribeiro
arXiv:2602. 10031v2 Announce Type: replace Abstract: Graph neural networks (GNNs) are commonly divided into message-passing neural networks (MPNNs) and spectral GNNs, reflecting two largely separate research traditions in machine learning and signal processing.
By Antonis Vasileiou, Juan Cervino, Pascal Frossard, Charilaos I. Kanatsoulis, Christopher Morris, Michael T. Schaub, Pierre Vandergheynst, Zhiyang Wang, Guy Wolf, Ron Levie
arXiv:2605. 26854v2 Announce Type: replace Abstract: The scalable solution of large sparse linear systems is a bottleneck in scientific computing and graph analysis.
By Yali Fink, Ido Ben-Yair, Lars Ruthotto, Eran Treister
arXiv:2606. 02887v1 Announce Type: new Abstract: Symmetric nonnegative matrix factorization (Symmetric NMF) approximates a matrix as $WW^T$ with nonnegative rectangular factor $W$.
By Ryan Swart, Johannes Brust
Denoising graphs is a fundamental problem in graph learning and the core operation of graph diffusion models. Attention-based architectures like graph transformers have recently shown promise in denoising graphs.
The paper introduces “GraphPDHG,” a message‑passing neural network that aligns with the Chambolle‑Pock Primal–Dual Hybrid Gradient algorithm to solve general graph saddle‑point problems. The authors prove that “GraphPDHG” can efficiently simulate PDHG and can learn an accelerated version of the algorithm. Experiments demonstrate that the learned warm start improves second‑order optimizers and that alignment with PDHG yields better size generalization compared to standard GNN baselines.
By Samantha Chen, Jesse He, Coleman Clougherty, Gal Mishne, Chester Holtz
The paper introduces Spectral Connectivity-Regularized Graph Learning (SCoGL), a method for learning sparse graphs from limited data by incorporating Laplacian spectral priors that promote global connectivity. SCoGL extends the graphical lasso objective with a connectivity prior derived from Laplacian eigenvalues and uses projected gradient descent with Armijo backtracking for optimization. Experiments demonstrate that SCoGL improves graph recovery and enhances downstream tasks such as graph signal denoising when observations are scarce.
By Mingxiao Liu (Tsinghua University, China), Bahar Oveisgharan (York University, Canada), Bingyan Zou (Tsinghua University, China), Gene Cheung (York University, Canada), H. Vicky Zhao (Tsinghua University, China), Feifei Gao (Tsinghua University, China)
arXiv:2607. 21263v1 Announce Type: new Abstract: Graph signal processing tasks that leverage spectral information typically assume access to the complete graph topology, which is often unavailable in practice.
By Purui Zhang, Feng Ji, Yanan Zhao, Bihan Wen, Wee Peng Tay