Publication

Learning anisotropic filters on product graphs

Abstract

The extension of convolutional neural networks to irregular domains has pavedthe way to promising graph data analysis methods. It has however come at theexpense of a reduced representation power, as most of these new network archi-tectures can only learn isotropic filters and therefore often underfit the trainingdata. In this work, we propose a method for building anisotropic filters whenlearning representations of signals on a cartesian product graph. Instead of learn-ing directly on the product graph, we factorize it and learn different filters foreach factor, which is beneficial both in terms of computational cost and expressiv-ity of the filters. We show experimentally that anisotropic Laplacian polynomialsindeed outperform their isotropic counterpart on image classification and matrixcompletion tasks.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.