Methods › Graphs › Graph Models › DGI
Deep Graph Infomax
DGI
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
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.
-
Graph Pre-Training Models Are Strong Anomaly Detectors 24 Oct 2024 · 0 repositories · arXiv:2410.18487
-
Dynamic Gradient Influencing for Viral Marketing Using Graph Neural Networks 19 Mar 2024 · 1 repository · arXiv:2403.12399
-
On the Adversarial Robustness of Graph Contrastive Learning Methods 29 Nov 2023 · 0 repositories · arXiv:2311.17853
-
DGI: Easy and Efficient Inference for GNNs 28 Nov 2022 · 0 repositories · arXiv:2211.15082
-
Models and Benchmarks for Representation Learning of Partially Observed Subgraphs 1 Sep 2022 · 1 repository · arXiv:2209.00508
-
Rethinking and Scaling Up Graph Contrastive Learning: An Extremely Efficient Approach with Group Discrimination 3 Jun 2022 · 1 repository · arXiv:2206.01535Syntology official (archive's flag): 3 ran · 4 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified (of 5 harvested samples) · 5 pointer-only (licence)
-
Contrastive Laplacian Eigenmaps 14 Jan 2022 · 1 repository · arXiv:2201.05493Syntology official (archive's flag): 2 ran · 2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result (of 2 harvested samples) · 2 pointer-only (licence)
-
HDMI: High-order Deep Multiplex Infomax 15 Feb 2021 · 1 repository · arXiv:2102.07810
-
SCE: Scalable Network Embedding from Sparsest Cut 30 Jun 2020 · 1 repository · arXiv:2006.16499Syntology official (archive's flag): 6 ran · 6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified (of 7 harvested samples) · 2 pointer-only (licence)
-
Deep Graph Infomax 27 Sep 2018 · 11 repositories · arXiv:1809.10341Syntology official (archive's flag): 3 ran · 26 ran (of which 11 constructed an object rather than computing a result; 22 with no instrument failure: 2 honoured, 1 violated, 19 with no contract checked; 4 where Syntology's instrument failed) · 9 unverified (of 35 harvested samples) · 10 pointer-only (licence)
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.
Usage over time archive 2025-07-28
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
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