Pith. sign in

REVIEW 5 cited by

MGAE: Masked Autoencoders for Self-Supervised Learning on Graphs

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 2201.02534 v1 pith:VMQAJCJG submitted 2022-01-07 cs.LG cs.IRcs.SI

classification cs.LGcs.IRcs.SI
keywords graphmgaelearningedgesmaskedcross-correlationdesignslarge
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

We introduce a novel masked graph autoencoder (MGAE) framework to perform effective learning on graph structure data. Taking insights from self-supervised learning, we randomly mask a large proportion of edges and try to reconstruct these missing edges during training. MGAE has two core designs. First, we find that masking a high ratio of the input graph structure, e.g., $70\%$, yields a nontrivial and meaningful self-supervisory task that benefits downstream applications. Second, we employ a graph neural network (GNN) as an encoder to perform message propagation on the partially-masked graph. To reconstruct the large number of masked edges, a tailored cross-correlation decoder is proposed. It could capture the cross-correlation between the head and tail nodes of anchor edge in multi-granularity. Coupling these two designs enables MGAE to be trained efficiently and effectively. Extensive experiments on multiple open datasets (Planetoid and OGB benchmarks) demonstrate that MGAE generally performs better than state-of-the-art unsupervised learning competitors on link prediction and node classification.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 5 Pith papers

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

  1. MirGuard: Towards a Robust Provenance-based Intrusion Detection System Against Graph Manipulation Attacks

    cs.CR 2025-08 unverdicted novelty 6.0 of 10

    MirGuard combines logic-aware graph augmentation with contrastive learning to keep provenance-based intrusion detection accurate under graph manipulation attacks.

  2. Boosting Bot Detection via Heterophily-Aware Representation Learning and Prototype-Guided Cluster Discovery

    cs.AI 2025-06 conditional novelty 6.0 of 10

    BotHP combines a dual-encoder (graph and MLP) with prototype-guided clustering to pre-train graph bot detectors, improving F1 by 1.3-6.0 points on TwiBot-20 and MGTAB.

  3. AirRadar: Inferring Nationwide Air Quality in China with Deep Neural Networks

    cs.LG 2025-01 conditional novelty 5.0 of 10

    A deep network with mask tokens, local and global spatial learners, and learned context weights infers PM2.5 at unmonitored locations across China with reported MAE of 6.41 to 8.11 at 25% to 75% missing stations.

  4. MeshMask: Physics-Based Simulations with Masked Graph Neural Networks

    cs.LG 2025-01 conditional novelty 5.0 of 10

    Masked node pre-training with an asymmetric encoder-decoder and gated MLPs improves long-term rollout accuracy of graph-network fluid simulators by up to 60% on seven CFD datasets.

  5. Evaluating Loss Functions for Graph Neural Networks: Towards Pretraining and Generalization

    cs.LG 2025-06 reject novelty 4.0 of 10

    A benchmark of 7 GNNs and 30 losses on 3 graphs claims hybrid losses and GIN rank best on average, but a central summary table contradicts the paper's full results.

Pith tools