Data-Adaptive Graph Framelets with Generalized Vanishing Moments for Graph Signal Processing

• URL: http://arxiv.org/abs/2309.03537v2
• Date: Sat, 30 Dec 2023 09:51:53 GMT
• Title: Data-Adaptive Graph Framelets with Generalized Vanishing Moments for Graph Signal Processing
• Authors: Ruigang Zheng and Xiaosheng Zhuang
• Abstract summary: We propose a framework to construct tight framelet systems on graphs with localized supports based on hierarchical partitions. Our construction provides parametrized graph framelet systems with great generality based on partition trees. We show that our learned graph framelet systems perform superiorly in non-linear approximation and denoising tasks.
• Score: 2.039632659682125
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this paper, we propose a novel and general framework to construct tight framelet systems on graphs with localized supports based on hierarchical partitions. Our construction provides parametrized graph framelet systems with great generality based on partition trees, by which we are able to find the size of a low-dimensional subspace that best fits the low-rank structure of a family of signals. The orthogonal decomposition of subspaces provides a key ingredient for the definition of "generalized vanishing moments" for graph framelets. In a data-adaptive setting, the graph framelet systems can be learned by solving an optimization problem on Stiefel manifolds with respect to our parameterization. Moreover, such graph framelet systems can be further improved by solving a subsequent optimization problem on Stiefel manifolds, aiming at providing the utmost sparsity for a given family of graph signals. Experimental results show that our learned graph framelet systems perform superiorly in non-linear approximation and denoising tasks.

Related papers

• Deep Manifold Graph Auto-Encoder for Attributed Graph Embedding [51.75091298017941]
  This paper proposes a novel Deep Manifold (Variational) Graph Auto-Encoder (DMVGAE/DMGAE) for attributed graph data. The proposed method surpasses state-of-the-art baseline algorithms by a significant margin on different downstream tasks across popular datasets.
  arXiv  Detail & Related papers  (2024-01-12T17:57:07Z)
• Spectral Augmentations for Graph Contrastive Learning [50.149996923976836]
  Contrastive learning has emerged as a premier method for learning representations with or without supervision. Recent studies have shown its utility in graph representation learning for pre-training. We propose a set of well-motivated graph transformation operations to provide a bank of candidates when constructing augmentations for a graph contrastive objective.
  arXiv  Detail & Related papers  (2023-02-06T16:26:29Z)
• Robust Attributed Graph Alignment via Joint Structure Learning and Optimal Transport [26.58964162799207]
  We propose SLOTAlign, an unsupervised graph alignment framework that jointly performs Structure Learning and Optimal Transport Alignment. We incorporate multi-view structure learning to enhance graph representation power and reduce the effect of structure and feature inconsistency inherited across graphs. The proposed SLOTAlign shows superior performance and strongest robustness over seven unsupervised graph alignment methods and five specialized KG alignment methods.
  arXiv  Detail & Related papers  (2023-01-30T08:41:36Z)
• Spectral Graph Convolutional Networks With Lifting-based Adaptive Graph Wavelets [81.63035727821145]
  Spectral graph convolutional networks (SGCNs) have been attracting increasing attention in graph representation learning. We propose a novel class of spectral graph convolutional networks that implement graph convolutions with adaptive graph wavelets.
  arXiv  Detail & Related papers  (2021-08-03T17:57:53Z)
• A Robust and Generalized Framework for Adversarial Graph Embedding [73.37228022428663]
  We propose a robust framework for adversarial graph embedding, named AGE. AGE generates the fake neighbor nodes as the enhanced negative samples from the implicit distribution. Based on this framework, we propose three models to handle three types of graph data.
  arXiv  Detail & Related papers  (2021-05-22T07:05:48Z)
• How Framelets Enhance Graph Neural Networks [27.540282741523253]
  This paper presents a new approach for assembling graph neural networks based on framelet transforms. We propose shrinkage as a new activation for the framelet convolution, which thresholds the high-frequency information at different scales.
  arXiv  Detail & Related papers  (2021-02-13T19:19:19Z)
• Promoting Graph Awareness in Linearized Graph-to-Text Generation [72.83863719868364]
  We study the ability of linearized models to encode local graph structures. Our findings motivate solutions to enrich the quality of models' implicit graph encodings. We find that these denoising scaffolds lead to substantial improvements in downstream generation in low-resource settings.
  arXiv  Detail & Related papers  (2020-12-31T18:17:57Z)
• Decimated Framelet System on Graphs and Fast G-Framelet Transforms [3.7277730514654555]
  An adequate representation of graph data is vital to the learning performance of a statistical or machine learning model for graph-structured data. We propose a novel multiscale representation system for graph data, called decimated framelets, which form a localized tight frame on the graph. The effectiveness is demonstrated by real-world applications, including multiresolution analysis for traffic network, and graph neural networks for graph classification tasks.
  arXiv  Detail & Related papers  (2020-12-12T23:57:17Z)
• Wasserstein-based Graph Alignment [56.84964475441094]
  We cast a new formulation for the one-to-many graph alignment problem, which aims at matching a node in the smaller graph with one or more nodes in the larger graph. We show that our method leads to significant improvements with respect to the state-of-the-art algorithms for each of these tasks.
  arXiv  Detail & Related papers  (2020-03-12T22:31:59Z)
• Homology-Preserving Multi-Scale Graph Skeletonization Using Mapper on Graphs [5.86893539706548]
  We propose to apply the mapper construction -- a popular tool in topological data analysis -- to graph visualization. We develop a variation of the mapper construction targeting weighted, undirected graphs, called mog, which generates homology-preserving skeletons of graphs. We provide a software tool that enables interactive explorations of such skeletons and demonstrate the effectiveness of our method for synthetic and real-world data.
  arXiv  Detail & Related papers  (2018-04-03T19:18:36Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.