Graph Filters for Signal Processing and Machine Learning on Graphs

• URL: http://arxiv.org/abs/2211.08854v2
• Date: Mon, 19 Feb 2024 21:13:45 GMT
• Title: Graph Filters for Signal Processing and Machine Learning on Graphs
• Authors: Elvin Isufi, Fernando Gama, David I. Shuman, Santiago Segarra
• Abstract summary: We provide a comprehensive overview of graph filters, including the different filtering categories, design strategies for each type, and trade-offs between different types of graph filters. We discuss how to extend graph filters into filter banks and graph neural networks to enhance the representational power. Our aim is that this article provides a unifying framework for both beginner and experienced researchers, as well as a common understanding.
• Score: 83.29608206147515
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Filters are fundamental in extracting information from data. For time series and image data that reside on Euclidean domains, filters are the crux of many signal processing and machine learning techniques, including convolutional neural networks. Increasingly, modern data also reside on networks and other irregular domains whose structure is better captured by a graph. To process and learn from such data, graph filters account for the structure of the underlying data domain. In this article, we provide a comprehensive overview of graph filters, including the different filtering categories, design strategies for each type, and trade-offs between different types of graph filters. We discuss how to extend graph filters into filter banks and graph neural networks to enhance the representational power; that is, to model a broader variety of signal classes, data patterns, and relationships. We also showcase the fundamental role of graph filters in signal processing and machine learning applications. Our aim is that this article provides a unifying framework for both beginner and experienced researchers, as well as a common understanding that promotes collaborations at the intersections of signal processing, machine learning, and application domains.

Related papers

• Online Graph Filtering Over Expanding Graphs [14.594691605523005]
  We propose an online graph filtering framework by relying on online learning principles. We design filters for scenarios where the topology is both known and unknown, including a learner adaptive to such evolution. We conduct a regret analysis to highlight the role played by the different components such as the online algorithm, the filter order, and the growing graph model.
  arXiv  Detail & Related papers  (2024-09-11T11:50:16Z)
• Online Filtering over Expanding Graphs [14.84852576248587]
  We propose an online update of the filter, based on the principles of online machine learning. We show the performance of our method for signal at the incoming nodes. These findings lay the foundation for efficient filtering over expanding graphs.
  arXiv  Detail & Related papers  (2023-01-17T14:07:52Z)
• Graph filtering over expanding graphs [14.84852576248587]
  We propose a filter learning scheme for data over expanding graphs. We show near-optimal performance compared with baselines relying on the exact topology. These findings lay the foundation for learning representations over expanding graphs by relying only on the connectivity model.
  arXiv  Detail & Related papers  (2022-03-15T16:50:54Z)
• Beyond Low-pass Filtering: Graph Convolutional Networks with Automatic Filtering [61.315598419655224]
  We propose Automatic Graph Convolutional Networks (AutoGCN) to capture the full spectrum of graph signals. While it is based on graph spectral theory, our AutoGCN is also localized in space and has a spatial form.
  arXiv  Detail & Related papers  (2021-07-10T04:11:25Z)
• Message Passing in Graph Convolution Networks via Adaptive Filter Banks [81.12823274576274]
  We present a novel graph convolution operator, termed BankGCN. It decomposes multi-channel signals on graphs into subspaces and handles particular information in each subspace with an adapted filter. It achieves excellent performance in graph classification on a collection of benchmark graph datasets.
  arXiv  Detail & Related papers  (2021-06-18T04:23:34Z)
• Graph Neural Networks with Adaptive Frequency Response Filter [55.626174910206046]
  We develop a graph neural network framework AdaGNN with a well-smooth adaptive frequency response filter. We empirically validate the effectiveness of the proposed framework on various benchmark datasets.
  arXiv  Detail & Related papers  (2021-04-26T19:31:21Z)
• FiGLearn: Filter and Graph Learning using Optimal Transport [49.428169585114496]
  We introduce a novel graph signal processing framework for learning the graph and its generating filter from signal observations. We show how this framework can be used to infer missing values if only very little information is available.
  arXiv  Detail & Related papers  (2020-10-29T10:00:42Z)
• Graphs, Convolutions, and Neural Networks: From Graph Filters to Graph Neural Networks [183.97265247061847]
  We leverage graph signal processing to characterize the representation space of graph neural networks (GNNs) We discuss the role of graph convolutional filters in GNNs and show that any architecture built with such filters has the fundamental properties of permutation equivariance and stability to changes in the topology. We also study the use of GNNs in recommender systems and learning decentralized controllers for robot swarms.
  arXiv  Detail & Related papers  (2020-03-08T13:02:15Z)

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.