{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/towards-fast-graph-generation-via","title":"Towards Fast Graph Generation via Autoregressive Noisy Filtration Modeling","arxiv_id":"2502.02415","date":"2025-02-04","proceeding":null,"authors":["Markus Krimmel","Jenna Wiens","Karsten Borgwardt","Dexiong Chen"],"abstract":"Graph generative models often face a critical trade-off between learning complex distributions and achieving fast generation speed. We introduce Autoregressive Noisy Filtration Modeling (ANFM), a novel approach that addresses both challenges. ANFM leverages filtration, a concept from topological data analysis, to transform graphs into short sequences of monotonically increasing subgraphs. This formulation extends the sequence families used in previous autoregressive models. To learn from these sequences, we propose a novel autoregressive graph mixer model. Our experiments suggest that exposure bias might represent a substantial hurdle in autoregressive graph generation and we introduce two mitigation strategies to address it: noise augmentation and a reinforcement learning approach. Incorporating these techniques leads to substantial performance gains, making ANFM competitive with state-of-the-art diffusion models across diverse synthetic and real-world datasets. Notably, ANFM produces remarkably short sequences, achieving a 100-fold speedup in generation time compared to diffusion models. This work marks a significant step toward high-throughput graph generation.","url_abs":"https://arxiv.org/abs/2502.02415v1","url_pdf":"https://arxiv.org/pdf/2502.02415v1.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":"towards-fast-graph-generation-via","repo_url":"https://github.com/borgwardtlab/anfm","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"graph-generation","task_name":"Graph Generation"},{"task_slug":"topological-data-analysis","task_name":"Topological Data Analysis"}],"methods":[{"method_slug":"diffusion","method_name":"Diffusion"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2502.02415","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.02415"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/borgwardtlab/anfm","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran_honours":1,"unverified":13},"by_repo_kind":{"official":{"samples":14,"ran":1,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"039fc6561a9516bc","entry":"l2","repo":"borgwardtlab/anfm","repo_kind":"official","path":"anfm/evaluation/dist_helper.py","file_url":"https://github.com/borgwardtlab/anfm/blob/HEAD/anfm/evaluation/dist_helper.py","link_basis":"harvester_set","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"039fc6561a9516bc"}},{"code_sha256_prefix":"ae336c57495df41b","entry":"add_node_attr","repo":"borgwardtlab/anfm","repo_kind":"official","path":"anfm/models/robust_rwpe.py","file_url":"https://github.com/borgwardtlab/anfm/blob/HEAD/anfm/models/robust_rwpe.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"ae336c57495df41b"}},{"code_sha256_prefix":"1096411b9848920f","entry":"dense_to_sparse_adj","repo":"borgwardtlab/anfm","repo_kind":"official","path":"anfm/utils.py","file_url":"https://github.com/borgwardtlab/anfm/blob/HEAD/anfm/utils.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"1096411b9848920f"}},{"code_sha256_prefix":"dd3521a053c14bb8","entry":"dense_to_sparse_batch","repo":"borgwardtlab/anfm","repo_kind":"official","path":"anfm/utils.py","file_url":"https://github.com/borgwardtlab/anfm/blob/HEAD/anfm/utils.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"dd3521a053c14bb8"}},{"code_sha256_prefix":"9bba061985b984f2","entry":"entropy_lower_bound","repo":"borgwardtlab/anfm","repo_kind":"official","path":"anfm/models/edge_predictor.py","file_url":"https://github.com/borgwardtlab/anfm/blob/HEAD/anfm/models/edge_predictor.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"9bba061985b984f2"}},{"code_sha256_prefix":"115ae97400fcb695","entry":"entropy_upper_bound","repo":"borgwardtlab/anfm","repo_kind":"official","path":"anfm/models/edge_predictor.py","file_url":"https://github.com/borgwardtlab/anfm/blob/HEAD/anfm/models/edge_predictor.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"115ae97400fcb695"}},{"code_sha256_prefix":"d766e30cf076eca4","entry":"evaluate_discriminator","repo":"borgwardtlab/anfm","repo_kind":"official","path":"anfm/train_gan.py","file_url":"https://github.com/borgwardtlab/anfm/blob/HEAD/anfm/train_gan.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"d766e30cf076eca4"}},{"code_sha256_prefix":"cef551adde62737a","entry":"get_gradient_magnitudes","repo":"borgwardtlab/anfm","repo_kind":"official","path":"anfm/train_gan.py","file_url":"https://github.com/borgwardtlab/anfm/blob/HEAD/anfm/train_gan.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"cef551adde62737a"}},{"code_sha256_prefix":"e86d25cc1327aca6","entry":"get_model","repo":"borgwardtlab/anfm","repo_kind":"official","path":"anfm/models/sat.py","file_url":"https://github.com/borgwardtlab/anfm/blob/HEAD/anfm/models/sat.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"e86d25cc1327aca6"}},{"code_sha256_prefix":"afd65063d68582cc","entry":"labeled_graph_collate","repo":"borgwardtlab/anfm","repo_kind":"official","path":"anfm/train_gan.py","file_url":"https://github.com/borgwardtlab/anfm/blob/HEAD/anfm/train_gan.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"afd65063d68582cc"}},{"code_sha256_prefix":"d2ca4f87058cba1d","entry":"modulate","repo":"borgwardtlab/anfm","repo_kind":"official","path":"anfm/models/sat.py","file_url":"https://github.com/borgwardtlab/anfm/blob/HEAD/anfm/models/sat.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"d2ca4f87058cba1d"}},{"code_sha256_prefix":"6bc1ea52fba8e7a7","entry":"sample_edges","repo":"borgwardtlab/anfm","repo_kind":"official","path":"anfm/models/edge_predictor.py","file_url":"https://github.com/borgwardtlab/anfm/blob/HEAD/anfm/models/edge_predictor.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"6bc1ea52fba8e7a7"}},{"code_sha256_prefix":"577a3f476486c5e8","entry":"sparse_to_dense_adj","repo":"borgwardtlab/anfm","repo_kind":"official","path":"anfm/utils.py","file_url":"https://github.com/borgwardtlab/anfm/blob/HEAD/anfm/utils.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"577a3f476486c5e8"}},{"code_sha256_prefix":"722ba5d89ebf60e0","entry":"to_sparse_batch","repo":"borgwardtlab/anfm","repo_kind":"official","path":"anfm/models/mixer_model.py","file_url":"https://github.com/borgwardtlab/anfm/blob/HEAD/anfm/models/mixer_model.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"722ba5d89ebf60e0"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}