{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/method/dgi","slug":"dgi","name":"DGI","full_name":"Deep Graph Infomax","full_name_withheld":false,"description_markdown":"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.\r\n\r\nDescription and image from: [DEEP GRAPH INFOMAX](https://arxiv.org/pdf/1809.10341.pdf)","description_state":"present","introduced_year":null,"introduced_by":{"title":"Deep Graph Infomax","paper":"/paper/deep-graph-infomax","first_author":"Petar Veličković","n_authors":6,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/deep-graph-infomax"},"source":{"url":"http://arxiv.org/abs/1809.10341v2","title":"Deep Graph Infomax","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Graphs","area_id":"graphs","collection":"Graph Models","url":"/methods/category/graph-models","pwc_aliases":[]}],"n_papers_tagged":10,"archive_num_papers":10,"papers_newest_first":[{"paper":null,"slug":"graph-pre-training-models-are-strong-anomaly","title":"Graph Pre-Training Models Are Strong Anomaly Detectors","date":"2024-10-24","arxiv_id":"2410.18487","n_code_links":0,"syntology":null},{"paper":"/paper/electioneering-the-network-dynamic-multi-step","slug":"electioneering-the-network-dynamic-multi-step","title":"Dynamic Gradient Influencing for Viral Marketing Using Graph Neural Networks","date":"2024-03-19","arxiv_id":"2403.12399","n_code_links":1,"syntology":null},{"paper":null,"slug":"on-the-adversarial-robustness-of-graph","title":"On the Adversarial Robustness of Graph Contrastive Learning Methods","date":"2023-11-29","arxiv_id":"2311.17853","n_code_links":0,"syntology":null},{"paper":null,"slug":"dgi-easy-and-efficient-inference-for-gnns","title":"DGI: Easy and Efficient Inference for GNNs","date":"2022-11-28","arxiv_id":"2211.15082","n_code_links":0,"syntology":null},{"paper":"/paper/models-and-benchmarks-for-representation","slug":"models-and-benchmarks-for-representation","title":"Models and Benchmarks for Representation Learning of Partially Observed Subgraphs","date":"2022-09-01","arxiv_id":"2209.00508","n_code_links":1,"syntology":null},{"paper":"/paper/rethinking-and-scaling-up-graph-contrastive","slug":"rethinking-and-scaling-up-graph-contrastive","title":"Rethinking and Scaling Up Graph Contrastive Learning: An Extremely Efficient Approach with Group Discrimination","date":"2022-06-03","arxiv_id":"2206.01535","n_code_links":1,"syntology":{"ran":4,"of":5,"n_ran_checked":0,"n_instrument":4,"unverified":1,"pointer_only":5,"phrase":"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","official":{"repos":["zyzisastudyreallyhardguy/graph-group-discrimination"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official","unlocated"]}}},{"paper":"/paper/contrastive-laplacian-eigenmaps-1","slug":"contrastive-laplacian-eigenmaps-1","title":"Contrastive Laplacian Eigenmaps","date":"2022-01-14","arxiv_id":"2201.05493","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":2,"n_instrument":0,"unverified":0,"pointer_only":2,"phrase":"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","official":{"repos":["allenhaozhu/coles"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/hdmi-high-order-deep-multiplex-infomax","slug":"hdmi-high-order-deep-multiplex-infomax","title":"HDMI: High-order Deep Multiplex Infomax","date":"2021-02-15","arxiv_id":"2102.07810","n_code_links":1,"syntology":null},{"paper":"/paper/sce-scalable-network-embedding-from-sparsest","slug":"sce-scalable-network-embedding-from-sparsest","title":"SCE: Scalable Network Embedding from Sparsest Cut","date":"2020-06-30","arxiv_id":"2006.16499","n_code_links":1,"syntology":{"ran":6,"of":7,"n_ran_checked":4,"n_instrument":2,"unverified":1,"pointer_only":2,"phrase":"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","official":{"repos":["szzhang17/Sparsest-Cut-Network-Embedding"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/deep-graph-infomax","slug":"deep-graph-infomax","title":"Deep Graph Infomax","date":"2018-09-27","arxiv_id":"1809.10341","n_code_links":11,"syntology":{"ran":26,"of":35,"n_ran_checked":22,"n_instrument":4,"unverified":9,"pointer_only":10,"phrase":"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","official":{"repos":["PetarV-/DGI"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["listed","official","unlocated"]}}}],"papers_shown":10,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":10,"with_a_code_link":7,"where_syntology_ran_a_sample":4,"not_listed_spam_title":0,"listed":10,"listed_where_code_ran":4,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":3,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":3,"listed_every_run_a_failure_of_syntologys_instrument":1,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":4,"papers_where_code_ran_first_page":"/method/dgi/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/dgi/papers/ran/1","json":"/method/dgi/papers/ran/1.json","rows":4}],"tasks":[{"task":"/task/contrastive-learning","name":"Contrastive Learning","papers":4},{"task":"/task/node-classification","name":"Node Classification","papers":3},{"task":"/task/representation-learning","name":"Representation Learning","papers":3},{"task":"/task/adversarial-robustness","name":"Adversarial Robustness","papers":1},{"task":"/task/anomaly-detection","name":"Anomaly Detection","papers":1},{"task":"/task/attribute","name":"Attribute","papers":1},{"task":null,"name":"CPU","papers":1},{"task":"/task/classification","name":"General Classification","papers":1},{"task":"/task/graph-anomaly-detection","name":"Graph Anomaly Detection","papers":1},{"task":"/task/graph-classification","name":"Graph Classification","papers":1},{"task":"/task/graph-embedding","name":"Graph Embedding","papers":1},{"task":"/task/graph-representation-learning","name":"Graph Representation Learning","papers":1},{"task":"/task/inductive-learning","name":"Inductive Learning","papers":1},{"task":"/task/marketing","name":"Marketing","papers":1},{"task":"/task/network-embedding","name":"Network Embedding","papers":1},{"task":"/task/self-supervised-learning","name":"Self-Supervised Learning","papers":1},{"task":"/task/high","name":"Vocal Bursts Intensity Prediction","papers":1}],"tasks_shown":17,"n_tasks":17,"usage_by_year":[{"year":"2018","papers":1},{"year":"2020","papers":1},{"year":"2021","papers":1},{"year":"2022","papers":4},{"year":"2023","papers":1},{"year":"2024","papers":2}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/dgi"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=DGI","read_at":"2026-10-05T00:54:53+00:00","query":"DGI","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":"1809.10341","repositories":null,"retrieve_with":null,"name_competition":{"verdict":"none","may_be_wrong_sense":false,"bearers_found":0,"served":null,"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing in this corpus is named 'DGI' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":[],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"9c6837d9f67591f25444ee75e85d24d98356509662b940f0b67962b64726d59c","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}