Learning Local Receptive Fields and their Weight Sharing Scheme on Graphs

06/08/2017
by   Jean-Charles Vialatte, et al.
0

We propose a simple and generic layer formulation that extends the properties of convolutional layers to any domain that can be described by a graph. Namely, we use the support of its adjacency matrix to design learnable weight sharing filters able to exploit the underlying structure of signals in the same fashion as for images. The proposed formulation makes it possible to learn the weights of the filter as well as a scheme that controls how they are shared across the graph. We perform validation experiments with image datasets and show that these filters offer performances comparable with convolutional ones.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/05/2019

Graph Neural Networks with distributed ARMA filters

Recent graph neural networks implement convolutional layers based on pol...
research
11/30/2020

Why Convolutional Networks Learn Oriented Bandpass Filters: Theory and Empirical Support

It has been repeatedly observed that convolutional architectures when ap...
research
03/15/2022

Graph filtering over expanding graphs

Our capacity to learn representations from data is related to our abilit...
research
06/09/2020

Learning Shared Filter Bases for Efficient ConvNets

Modern convolutional neural networks (ConvNets) achieve state-of-the-art...
research
08/17/2021

Adaptive Convolutions with Per-pixel Dynamic Filter Atom

Applying feature dependent network weights have been proved to be effect...
research
12/21/2013

Spectral Networks and Locally Connected Networks on Graphs

Convolutional Neural Networks are extremely efficient architectures in i...
research
09/30/2018

Graph Spectral Regularization for Neural Network Interpretability

Deep neural networks can learn meaningful representations of data. Howev...

Please sign up or login with your details

Forgot password? Click here to reset