the open
    research
    Contribute
    Back to the reading lists

    Graph learning· 2018

    Deep Graph Infomax

    Petar Veličković (first author) · 2018 · published 2019

    Read the original

    arXiv 1809.10341OpenAlex W2963782635

    On the reading lists

    Why it matters

    Popularized mutual-information objectives for unsupervised graph representation learning.

    Condensed from the expert lists' notes.

    The record

    First released
    2018 (from arXiv 1809.10341)
    Published
    2019
    Citations
    3,183 citations, as counted by Papers With Code (CC BY-SA 4.0)
    Named by
    both expert lists
    Score
    0.362 · computed rank 448 · consensus 0.47, must-read 0, citations percentile 0.63 (2010s · graphs), awards 0, existing lists 0. Method

    Data sources

    Catalogue data from OpenAlex (CC0), Crossref (CC0 metadata; no abstracts are shown), arXiv, and Papers With Code (CC BY-SA 4.0). Each count names its source. See the method.