Publication

Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering

Publications associées (48)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

On the Experimental Transferability of Spectral Graph Convolutional Networks

Spectral Graph Convolutional Networks (GCNs) are generalisations of standard convolutional for graph-structured data using the Laplacian operator. Recent work has shown that spectral GCNs have an intrinsic transferability. This work verifies this by studyi ...

2020

Phases of two-dimensional spinless lattice fermions with first-quantized deep neural-network quantum states

Giuseppe Carleo

First-quantized deep neural network techniques are developed for analyzing strongly coupled fermionic systems on the lattice. Using a Slater-Jastrow-inspired ansatz which exploits deep residual networks with convolutional residual blocks, we approximately ...

AMER PHYSICAL SOC2020

Graph Coarsening with Preserved Spectral Properties

Andreas Loukas

In graph coarsening, one aims to produce a coarse graph of reduced size while preserving important graph properties. However, as there is no consensus on which specific graph properties should be preserved by coarse graphs, measuring the differences betwee ...

ADDISON-WESLEY PUBL CO2020

OrthoNet: Multilayer Network Data Clustering

Pascal Frossard, Mireille El Gheche, Giovanni Chierchia

Network data appears in very diverse applications, like biological, social, or sensor networks. Clustering of network nodes into categories or communities has thus become a very common task in machine learning and data mining. Network data comes with some ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

A Primer on Motion Capture with Deep Learning: Principles, Pitfalls, and Perspectives

Alexander Mathis, Mackenzie Mathis, Steffen Schneider, Jessy Lauer

Extracting behavioral measurements non-invasively from video is stymied by the fact that it is a hard computational problem. Recent advances in deep learning have tremendously advanced our ability to predict posture directly from videos, which has quickly ...

2020

Graph-based image representation learning

Renata Khasanova

Though deep learning (DL) algorithms are very powerful for image processing tasks, they generally require a lot of data to reach their full potential. Furthermore, there is no straightforward way to impose various properties, given by the prior knowledge a ...

EPFL2019

A Regularization Framework for Learning Over Multitask Graphs

Ali H. Sayed, Stefan Vlaski, Roula Nassif

This letter proposes a general regularization framework for inference over multitask networks. The optimization approach relies on minimizing a global cost consisting of the aggregate sum of individual costs regularized by a term that allows to incorporate ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2019

Efficient large-scale graph processing: optimisations for storage, performance and evolving graphs

Jasmina Malicevic

Graph processing systems are used in a wide variety of fields, ranging from biology to social networks. Algorithms to mine graphs incur many random accesses, and the sparse nature of the graphs of interest, exacerbates this. As DRAM sustains high bandwidt ...

EPFL2019

Incidences Between Planes Over Finite Fields

In this note, we use methods from spectral graph theory to obtain bounds on the number of incidences between k-planes and h-planes in F-q(d), which generalizes a recent result given by Bennett, Iosevich, and Pakianathan (2014). More precisely, we prove tha ...

AMER MATHEMATICAL SOC2019

Robust and Efficient Data Clustering with Signal Processing on Graphs

Lionel Jérémie Martin

Data is pervasive in today's world and has actually been for quite some time. With the increasing volume of data to process, there is a need for faster and at least as accurate techniques than what we already have. In particular, the last decade recorded t ...

EPFL2018