pith. sign in

hub

Deep Graph Infomax

12 Pith papers cite this work. Polarity classification is still indexing.

12 Pith papers citing it
abstract

We present Deep Graph Infomax (DGI), a general approach for learning node representations within graph-structured data in an unsupervised manner. DGI relies on maximizing mutual information between patch representations and corresponding high-level summaries of graphs---both derived using established graph convolutional network architectures. The learnt patch representations summarize subgraphs centered around nodes of interest, and can thus be reused for downstream node-wise learning tasks. In contrast to most prior approaches to unsupervised learning with GCNs, DGI does not rely on random walk objectives, and is readily applicable to both transductive and inductive learning setups. We demonstrate competitive performance on a variety of node classification benchmarks, which at times even exceeds the performance of supervised learning.

hub tools

citation-role summary

background 1

citation-polarity summary

years

2026 11 2024 1

verdicts

UNVERDICTED 12

roles

background 1

polarities

background 1

representative citing papers

AgForce Enables Antigen-conditioned Generative Antibody Design

cs.LG · 2026-05-20 · unverdicted · novelty 6.0

AgForce improves antigen-conditioned antibody design by using framework dropout, gated bottlenecks, hyperbolic cross attention, MDN sequence head with Potts-like coupling, annealed MCL, and antigen cycle consistency to achieve 8% better amino acid recovery and superior binding metrics on CHIMERA-BEN

Graph self-supervised learning based on frequency corruption

cs.LG · 2026-04-17 · unverdicted · novelty 6.0

FC-GSSL improves graph SSL by generating high-frequency biased corrupted graphs via low-frequency contribution-based corruption, reconstructing low-frequency features in an autoencoder, and aligning multi-view representations to fuse frequency bands.

Fast and Featureless Node Representation Learning with Partial Pairwise Supervision

cs.LG · 2026-05-19 · unverdicted · novelty 5.0

Contrastive FUSE learns node embeddings from partial pairwise supervision and structural signals alone by optimizing a spectral contrastive objective with a lightweight modularity approximation, yielding competitive performance and runtime gains on citation and co-purchase graphs.

Disentangled Generative Graph Representation Learning

cs.LG · 2024-08-24 · unverdicted · novelty 5.0

DiGGR introduces a self-supervised graph representation learning framework that disentangles latent factors to guide mask modeling and improve representation quality on graph tasks.

Intent Propagation Contrastive Collaborative Filtering

cs.IR · 2026-04-17 · unverdicted · novelty 5.0

IPCCF improves collaborative filtering by propagating intents across graph structures with contrastive alignment to provide direct supervision and reduce biases in disentanglement.

citing papers explorer

Showing 12 of 12 citing papers.