Pith. sign in

REVIEW 5 cited by

GraphMAE: Self-Supervised Masked Graph Autoencoders

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2205.10803 v3 pith:IAR42EWG submitted 2022-05-22 cs.LG

classification cs.LG
keywords graphgenerativeself-supervisedautoencodersgraphmaetrainingautoencoderbeen
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Self-supervised learning (SSL) has been extensively explored in recent years. Particularly, generative SSL has seen emerging success in natural language processing and other AI fields, such as the wide adoption of BERT and GPT. Despite this, contrastive learning-which heavily relies on structural data augmentation and complicated training strategies-has been the dominant approach in graph SSL, while the progress of generative SSL on graphs, especially graph autoencoders (GAEs), has thus far not reached the potential as promised in other fields. In this paper, we identify and examine the issues that negatively impact the development of GAEs, including their reconstruction objective, training robustness, and error metric. We present a masked graph autoencoder GraphMAE that mitigates these issues for generative self-supervised graph pretraining. Instead of reconstructing graph structures, we propose to focus on feature reconstruction with both a masking strategy and scaled cosine error that benefit the robust training of GraphMAE. We conduct extensive experiments on 21 public datasets for three different graph learning tasks. The results manifest that GraphMAE-a simple graph autoencoder with careful designs-can consistently generate outperformance over both contrastive and generative state-of-the-art baselines. This study provides an understanding of graph autoencoders and demonstrates the potential of generative self-supervised pre-training on graphs.

Discussion (0). Sign in to comment.

Forward citations

Cited by 5 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Toward Federated Multimodal Graph Foundation Models: A Topology-Aware Multimodal Alignment Framework

    cs.LG 2026-07 conditional novelty 6.0 of 10

    A federated pretraining-and-prompt-tuning framework that aligns image, text, and graph-topology information across privacy-separated clients claims consistent state-of-the-art results on 12 multimodal graph datasets.

  2. Towards foundation-style models for energy-frontier heterogeneous neutrino detectors via self-supervised pre-training

    hep-ex 2026-04 conditional novelty 6.0 of 10

    Self-supervised pre-training on multimodal neutrino detector simulations produces reusable representations that improve downstream classification, regression, and data efficiency over training from scratch.

  3. SSL4RL: Revisiting Self-supervised Learning as Intrinsic Reward for Visual-Language Reasoning

    cs.CV 2025-10 unverdicted novelty 6.0 of 10

    SSL4RL reformulates self-supervised learning objectives into dense, verifiable reward signals for RL-based fine-tuning of vision-language models, yielding performance gains on reasoning benchmarks.

  4. Handling Feature Heterogeneity with Learnable Graph Patches

    cs.LG 2026-06 unverdicted novelty 5.0 of 10

    Learnable graph patches enable domain-agnostic pre-training of graph models by decomposing heterogeneous graphs into transferable semantic units via patch encoders and aggregators.

  5. Structure-Centric Graph Foundation Model via Geometric Bases

    cs.LG 2026-05 unverdicted novelty 5.0 of 10

    SCGFM creates transferable graph representations by aligning heterogeneous topologies to shared learnable geometric bases via Gromov-Wasserstein distances and re-encoding features accordingly.

Pith tools