Methods › Graphs › Graph Models › DGI

Deep Graph Infomax

DGI

10 papers tagged archive 2025-07-28

Introduced by Petar Veličković et al. in Deep Graph Infomax

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

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.

Description and image from: DEEP GRAPH INFOMAX

PaperSource

In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 10 · with a code link: 7 · where Syntology ran a sample: 4 (3 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (4 of 10 tagged: 3 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument)

Page 1 of 1: papers 1 to 10 of 10, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

17 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Contrastive Learning4
Node Classification3
Representation Learning3
Adversarial Robustness1
Anomaly Detection1
Attribute1
CPU1
General Classification1
Graph Anomaly Detection1
Graph Classification1
Graph Embedding1
Graph Representation Learning1
Inductive Learning1
Marketing1
Network Embedding1
Self-Supervised Learning1
Vocal Bursts Intensity Prediction1

Usage over time archive 2025-07-28

Papers per year tagged with DGI: 2018 to 2024, peak 4 4 0 2018: 1 paper 2018 2019: 0 papers 2019 2020: 1 paper 2020 2021: 1 paper 2021 2022: 4 papers 2022 2023: 1 paper 2023 2024: 2 papers 2024
Papers per year the archive tags with this method, by the paper's archive date (10 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Graph Models

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections