{"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/adversarially-regularized-graph-autoencoder","title":"Adversarially Regularized Graph Autoencoder for Graph Embedding","arxiv_id":"1802.04407","date":"2018-02-13","proceeding":null,"authors":["Shirui Pan","Ruiqi Hu","Guodong Long","Jing Jiang","Lina Yao","Chengqi Zhang"],"abstract":"Graph embedding is an effective method to represent graph data in a low\ndimensional space for graph analytics. Most existing embedding algorithms\ntypically focus on preserving the topological structure or minimizing the\nreconstruction errors of graph data, but they have mostly ignored the data\ndistribution of the latent codes from the graphs, which often results in\ninferior embedding in real-world graph data. In this paper, we propose a novel\nadversarial graph embedding framework for graph data. The framework encodes the\ntopological structure and node content in a graph to a compact representation,\non which a decoder is trained to reconstruct the graph structure. Furthermore,\nthe latent representation is enforced to match a prior distribution via an\nadversarial training scheme. To learn a robust embedding, two variants of\nadversarial approaches, adversarially regularized graph autoencoder (ARGA) and\nadversarially regularized variational graph autoencoder (ARVGA), are developed.\nExperimental studies on real-world graphs validate our design and demonstrate\nthat our algorithms outperform baselines by a wide margin in link prediction,\ngraph clustering, and graph visualization tasks.","url_abs":"http://arxiv.org/abs/1802.04407v2","url_pdf":"http://arxiv.org/pdf/1802.04407v2.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":"adversarially-regularized-graph-autoencoder","repo_url":"https://github.com/Ruiqi-Hu/ARGA","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"adversarially-regularized-graph-autoencoder","repo_url":"https://github.com/basiralab/HADA","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"adversarially-regularized-graph-autoencoder","repo_url":"https://github.com/basiralab/HCAE","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"adversarially-regularized-graph-autoencoder","repo_url":"https://github.com/basiralab/LG-DADA","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"decoder","task_name":"Decoder"},{"task_slug":"graph-clustering","task_name":"Graph Clustering"},{"task_slug":"graph-embedding","task_name":"Graph Embedding"},{"task_slug":"link-prediction","task_name":"Link Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/graph-clustering-on-citeseer","task":"Graph Clustering","dataset":"Citeseer","model":"ARGE","rank_in_archive_order":6,"of":9,"metrics":{"ACC":"57.3","ARI":"34.1","F1":"54.6","NMI":"0.35","Precision":"57.3"},"uses_additional_data":false},{"leaderboard":"/sota/graph-clustering-on-citeseer","task":"Graph Clustering","dataset":"Citeseer","model":"ARVGE","rank_in_archive_order":7,"of":9,"metrics":{"ACC":"54.4","ARI":"24.5","F1":"52.9","NMI":"26.1","Precision":"54.9"},"uses_additional_data":false},{"leaderboard":"/sota/graph-clustering-on-cora","task":"Graph Clustering","dataset":"Cora","model":"ARGE","rank_in_archive_order":6,"of":9,"metrics":{"ACC":"64","ARI":"35.2","F1":"61.9","NMI":"0.449","Precision":"64.6"},"uses_additional_data":false},{"leaderboard":"/sota/graph-clustering-on-cora","task":"Graph Clustering","dataset":"Cora","model":"ARVGE","rank_in_archive_order":7,"of":9,"metrics":{"ACC":"63.8","ARI":"37.4","F1":"62.7","NMI":"45","Precision":"62.4"},"uses_additional_data":false},{"leaderboard":"/sota/link-prediction-on-citeseer","task":"Link Prediction","dataset":"Citeseer","model":"ARGE","rank_in_archive_order":10,"of":13,"metrics":{"AP":"93","AUC":"91.9"},"uses_additional_data":false},{"leaderboard":"/sota/link-prediction-on-cora","task":"Link Prediction","dataset":"Cora","model":"ARGE","rank_in_archive_order":11,"of":13,"metrics":{"AP":"93.2%","AUC":"92.4%"},"uses_additional_data":false},{"leaderboard":"/sota/link-prediction-on-pubmed","task":"Link Prediction","dataset":"Pubmed","model":"ARGE","rank_in_archive_order":6,"of":13,"metrics":{"AP":"97.1%","AUC":"96.8%"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1802.04407","atlas_url":"https://app.syntology.ai/?focus=1802.04407","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":"1802.04407"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1802.04407\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1802.04407"},"call":"get_concepts_for_paper(arxiv_id=\"1802.04407\")"}],"by_repo":[{"repo":"Ruiqi-Hu/ARGA","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"basiralab/HADA","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"basiralab/HCAE","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"basiralab/LG-DADA","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"0f90c6698d929095a829fd54ba12649fcd89eb2b678d70481fb2dfc6c7df10a6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}