{"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/lanczosnet-multi-scale-deep-graph","title":"LanczosNet: Multi-Scale Deep Graph Convolutional Networks","arxiv_id":"1901.01484","date":"2019-01-06","proceeding":"ICLR 2019 5","authors":["Renjie Liao","Zhizhen Zhao","Raquel Urtasun","Richard S. Zemel"],"abstract":"We propose the Lanczos network (LanczosNet), which uses the Lanczos algorithm to construct low rank approximations of the graph Laplacian for graph convolution. Relying on the tridiagonal decomposition of the Lanczos algorithm, we not only efficiently exploit multi-scale information via fast approximated computation of matrix power but also design learnable spectral filters. Being fully differentiable, LanczosNet facilitates both graph kernel learning as well as learning node embeddings. We show the connection between our LanczosNet and graph based manifold learning methods, especially the diffusion maps. We benchmark our model against several recent deep graph networks on citation networks and QM8 quantum chemistry dataset. Experimental results show that our model achieves the state-of-the-art performance in most tasks. Code is released at: \\url{https://github.com/lrjconan/LanczosNetwork}.","url_abs":"https://arxiv.org/abs/1901.01484v2","url_pdf":"https://arxiv.org/pdf/1901.01484v2.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":"lanczosnet-multi-scale-deep-graph","repo_url":"https://github.com/lrjconan/LanczosNetwork","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"node-classification","task_name":"Node Classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/node-classification-on-citeseer-05","task":"Node Classification","dataset":"CiteSeer (0.5%)","model":"AdaLanczosNet","rank_in_archive_order":7,"of":14,"metrics":{"Accuracy":"53.8 ± 4.7"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-citeseer-05","task":"Node Classification","dataset":"CiteSeer (0.5%)","model":"LanczosNet","rank_in_archive_order":8,"of":14,"metrics":{"Accuracy":"53.2 ± 4.0"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-citeseer-1","task":"Node Classification","dataset":"CiteSeer (1%)","model":"AdaLanczosNet","rank_in_archive_order":7,"of":14,"metrics":{"Accuracy":"63.3 ± 1.8"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-citeseer-1","task":"Node Classification","dataset":"CiteSeer (1%)","model":"LanczosNet","rank_in_archive_order":9,"of":14,"metrics":{"Accuracy":"61.3 ± 3.9"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-citeseer-with-public","task":"Node Classification","dataset":"CiteSeer with Public Split: fixed 20 nodes per class","model":"AdaLanczosNet","rank_in_archive_order":35,"of":40,"metrics":{"Accuracy":"68.7 ± 1.0"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-citeseer-with-public","task":"Node Classification","dataset":"CiteSeer with Public Split: fixed 20 nodes per class","model":"LanczosNet","rank_in_archive_order":37,"of":40,"metrics":{"Accuracy":"66.2 ± 1.9"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-cora-05","task":"Node Classification","dataset":"Cora (0.5%)","model":"AdaLanczosNet","rank_in_archive_order":8,"of":15,"metrics":{"Accuracy":"60.8 ± 9.0"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-cora-05","task":"Node Classification","dataset":"Cora (0.5%)","model":"LanczosNet","rank_in_archive_order":10,"of":15,"metrics":{"Accuracy":"58.1 ± 8.2"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-cora-1","task":"Node Classification","dataset":"Cora (1%)","model":"AdaLanczosNet","rank_in_archive_order":8,"of":15,"metrics":{"Accuracy":"67.5 ± 8.7"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-cora-1","task":"Node Classification","dataset":"Cora (1%)","model":"LanczosNet","rank_in_archive_order":10,"of":15,"metrics":{"Accuracy":"66.1 ± 8.2"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-cora-3","task":"Node Classification","dataset":"Cora (3%)","model":"AdaLanczosNet","rank_in_archive_order":8,"of":15,"metrics":{"Accuracy":"77.7 ± 2.4"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-cora-3","task":"Node Classification","dataset":"Cora (3%)","model":"LanczosNet","rank_in_archive_order":10,"of":15,"metrics":{"Accuracy":"76.3 ± 2.3"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-cora-with-public-split","task":"Node Classification","dataset":"Cora with Public Split: fixed 20 nodes per class","model":"AdaLanczosNet","rank_in_archive_order":30,"of":36,"metrics":{"Accuracy":"80.4 ± 1.1"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-cora-with-public-split","task":"Node Classification","dataset":"Cora with Public Split: fixed 20 nodes per class","model":"LanczosNet","rank_in_archive_order":32,"of":36,"metrics":{"Accuracy":"79.5 ± 1.8"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-pubmed-003","task":"Node Classification","dataset":"PubMed (0.03%)","model":"AdaLanczosNet","rank_in_archive_order":7,"of":14,"metrics":{"Accuracy":"61%"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-pubmed-003","task":"Node Classification","dataset":"PubMed (0.03%)","model":"LanczosNet","rank_in_archive_order":9,"of":14,"metrics":{"Accuracy":"60.4 ± 8.6"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-pubmed-005","task":"Node Classification","dataset":"PubMed (0.05%)","model":"LanczosNet","rank_in_archive_order":7,"of":14,"metrics":{"Accuracy":"68.8 ± 5.6"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-pubmed-005","task":"Node Classification","dataset":"PubMed (0.05%)","model":"AdaLanczosNet","rank_in_archive_order":9,"of":14,"metrics":{"Accuracy":"66%"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-pubmed-01","task":"Node Classification","dataset":"PubMed (0.1%)","model":"LanczosNet","rank_in_archive_order":6,"of":14,"metrics":{"Accuracy":"73.4 ± 5.1"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-pubmed-01","task":"Node Classification","dataset":"PubMed (0.1%)","model":"AdaLanczosNet","rank_in_archive_order":9,"of":14,"metrics":{"Accuracy":"72.8 ± 4.6"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-pubmed-with-public","task":"Node Classification","dataset":"PubMed with Public Split: fixed 20 nodes per class","model":"LanczosNet","rank_in_archive_order":27,"of":37,"metrics":{"Accuracy":"78.3 ± 0.3"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-pubmed-with-public","task":"Node Classification","dataset":"PubMed with Public Split: fixed 20 nodes per class","model":"AdaLanczosNet","rank_in_archive_order":28,"of":37,"metrics":{"Accuracy":"78.1 ± 0.4"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1901.01484","atlas_url":"https://app.syntology.ai/?focus=1901.01484","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":"1901.01484"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1901.01484\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1901.01484"},"call":"get_concepts_for_paper(arxiv_id=\"1901.01484\")"}],"by_repo":[{"repo":"lrjconan/LanczosNetwork","kind":"official","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":"f5aca6bbb1a7871c42f54a95181243fd01d5333c521cefa2fcc0d56d6f196347","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}