{"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":"/paper/infograph-unsupervised-and-semi-supervised","title":"InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization","arxiv_id":"1908.01000","date":"2019-07-31","proceeding":"ICLR 2020 1","authors":["Fan-Yun Sun","Jordan Hoffmann","Vikas Verma","Jian Tang"],"abstract":"This paper studies learning the representations of whole graphs in both unsupervised and semi-supervised scenarios. Graph-level representations are critical in a variety of real-world applications such as predicting the properties of molecules and community analysis in social networks. Traditional graph kernel based methods are simple, yet effective for obtaining fixed-length representations for graphs but they suffer from poor generalization due to hand-crafted designs. There are also some recent methods based on language models (e.g. graph2vec) but they tend to only consider certain substructures (e.g. subtrees) as graph representatives. Inspired by recent progress of unsupervised representation learning, in this paper we proposed a novel method called InfoGraph for learning graph-level representations. We maximize the mutual information between the graph-level representation and the representations of substructures of different scales (e.g., nodes, edges, triangles). By doing so, the graph-level representations encode aspects of the data that are shared across different scales of substructures. Furthermore, we further propose InfoGraph*, an extension of InfoGraph for semi-supervised scenarios. InfoGraph* maximizes the mutual information between unsupervised graph representations learned by InfoGraph and the representations learned by existing supervised methods. As a result, the supervised encoder learns from unlabeled data while preserving the latent semantic space favored by the current supervised task. Experimental results on the tasks of graph classification and molecular property prediction show that InfoGraph is superior to state-of-the-art baselines and InfoGraph* can achieve performance competitive with state-of-the-art semi-supervised models.","url_abs":"https://arxiv.org/abs/1908.01000v3","url_pdf":"https://arxiv.org/pdf/1908.01000v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"infograph-unsupervised-and-semi-supervised","repo_url":"https://github.com/fanyun-sun/InfoGraph","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"infograph-unsupervised-and-semi-supervised","repo_url":"https://github.com/hengruizhang98/InfoGraph","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"infograph-unsupervised-and-semi-supervised","repo_url":"https://github.com/ycremar/DIG-SSL","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"infograph-unsupervised-and-semi-supervised","repo_url":"https://github.com/yuwvandy/g2gnn","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"infograph-unsupervised-and-semi-supervised","repo_url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/infograph","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"graph-classification","task_name":"Graph Classification"},{"task_slug":"molecular-property-prediction","task_name":"Molecular Property Prediction"},{"task_slug":"property-prediction","task_name":"Property Prediction"},{"task_slug":"representation-learning","task_name":"Representation Learning"}],"methods":[{"method_slug":"infograph","method_name":"InfoGraph"}],"datasets_introduced":[],"methods_introduced":[{"slug":"infograph","name":"InfoGraph","full_name":"InfoGraph"}],"results":[{"leaderboard":"/sota/graph-classification-on-imdb-b","task":"Graph Classification","dataset":"IMDb-B","model":"InfoGraph","rank_in_archive_order":34,"of":51,"metrics":{"Accuracy":"73.03%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-imdb-m","task":"Graph Classification","dataset":"IMDb-M","model":"InfoGraph","rank_in_archive_order":26,"of":36,"metrics":{"Accuracy":"49.69%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-mutag","task":"Graph Classification","dataset":"MUTAG","model":"InfoGraph","rank_in_archive_order":30,"of":74,"metrics":{"Accuracy":"89.01%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-ptc","task":"Graph Classification","dataset":"PTC","model":"InfoGraph","rank_in_archive_order":32,"of":37,"metrics":{"Accuracy":"61.65"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1908.01000","atlas_url":"https://app.syntology.ai/?focus=1908.01000","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1908.01000"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1908.01000\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1908.01000"},"call":"get_concepts_for_paper(arxiv_id=\"1908.01000\")"}],"by_repo":[{"repo":"fanyun-sun/InfoGraph","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"hengruizhang98/InfoGraph","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"ycremar/DIG-SSL","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["2006.05582","2010.13902"],"harvested_for_calls":[{"arxiv_id":"2006.05582","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2006.05582"},"call":"get_harvested_code_for_paper(arxiv_id=\"2006.05582\")"},{"arxiv_id":"2010.13902","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2010.13902"},"call":"get_harvested_code_for_paper(arxiv_id=\"2010.13902\")"}]},{"repo":"yuwvandy/g2gnn","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2010.13902"],"harvested_for_calls":[{"arxiv_id":"2010.13902","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2010.13902"},"call":"get_harvested_code_for_paper(arxiv_id=\"2010.13902\")"}]},{"repo":"dmlc/dgl","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":6,"harvested_for":["1607.00653","1612.00222","1802.04364","1806.01973","2006.05582","2010.16103"],"harvested_for_calls":[{"arxiv_id":"1607.00653","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1607.00653"},"call":"get_harvested_code_for_paper(arxiv_id=\"1607.00653\")"},{"arxiv_id":"1612.00222","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1612.00222"},"call":"get_harvested_code_for_paper(arxiv_id=\"1612.00222\")"},{"arxiv_id":"1802.04364","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1802.04364"},"call":"get_harvested_code_for_paper(arxiv_id=\"1802.04364\")"},{"arxiv_id":"1806.01973","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1806.01973"},"call":"get_harvested_code_for_paper(arxiv_id=\"1806.01973\")"},{"arxiv_id":"2006.05582","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2006.05582"},"call":"get_harvested_code_for_paper(arxiv_id=\"2006.05582\")"},{"arxiv_id":"2010.16103","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2010.16103"},"call":"get_harvested_code_for_paper(arxiv_id=\"2010.16103\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"9bd36a509b74fd0eb5576a13b7fa0280eadd7770d4850e60a33e5e0e99575ca6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}