mlsanityData to 7 Oct 2026

Graph Autoencoders with Deconvolutional Networks

arXiv 2012.11898 ↗First posted 22 Dec 2020cs.LG cs.AIcited by 9

Not on the map. Why?

Abstract (arXiv)

Recent studies have indicated that Graph Convolutional Networks (GCNs) act as a low pass filter in spectral domain and encode smoothed node representations. In this paper, we consider their opposite, namely Graph Deconvolutional Networks (GDNs) that reconstruct graph signals from smoothed node representations. We motivate the design of Graph Deconvolutional Networks via a combination of inverse filters in spectral domain and de-noising layers in wavelet domain, as the inverse operation results in a high pass filter and may amplify the noise. Based on the proposed GDN, we further propose a graph autoencoder framework that first encodes smoothed graph representations with GCN and then decodes accurate graph signals with GDN. We demonstrate the effectiveness of the proposed method on several tasks including unsupervised graph-level representation , social recommendation and graph generation

Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). First posted on arXiv 22 Dec 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2022: 6; 2023: 1; 2024: 0; 2025: 2.

9 papers.