{"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/fast-tree-field-integrators-from-low","title":"Fast Tree-Field Integrators: From Low Displacement Rank to Topological Transformers","arxiv_id":"2406.15881","date":"2024-06-22","proceeding":null,"authors":["Krzysztof Choromanski","Arijit Sehanobish","Somnath Basu Roy Chowdhury","Han Lin","Avinava Dubey","Tamas Sarlos","Snigdha Chaturvedi"],"abstract":"We present a new class of fast polylog-linear algorithms based on the theory of structured matrices (in particular low displacement rank) for integrating tensor fields defined on weighted trees. Several applications of the resulting fast tree-field integrators (FTFIs) are presented, including (a) approximation of graph metrics with tree metrics, (b) graph classification, (c) modeling on meshes, and finally (d) Topological Transformers (TTs) (Choromanski et al., 2022) for images. For Topological Transformers, we propose new relative position encoding (RPE) masking mechanisms with as few as three extra learnable parameters per Transformer layer, leading to 1.0-1.5%+ accuracy gains. Importantly, most of FTFIs are exact methods, thus numerically equivalent to their brute-force counterparts. When applied to graphs with thousands of nodes, those exact algorithms provide 5.7-13x speedups. We also provide an extensive theoretical analysis of our methods.","url_abs":"https://arxiv.org/abs/2406.15881v2","url_pdf":"https://arxiv.org/pdf/2406.15881v2.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":"fast-tree-field-integrators-from-low","repo_url":"https://github.com/brcsomnath/fasttreeintegrator","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"graph-classification","task_name":"Graph Classification"}],"methods":[{"method_slug":"absolute-position-encodings","method_name":"Absolute Position Encodings"},{"method_slug":"adam","method_name":"Adam"},{"method_slug":"attention","method_name":"Attention"},{"method_slug":"bpe","method_name":"BPE"},{"method_slug":"dense-connections","method_name":"Dense Connections"},{"method_slug":"dropout","method_name":"Dropout"},{"method_slug":"label-smoothing","method_name":"Label Smoothing"},{"method_slug":"layer-normalization","method_name":"Layer Normalization"},{"method_slug":"linear-layer","method_name":"Linear Layer"},{"method_slug":"multi-head-attention","method_name":"Multi-Head Attention"},{"method_slug":"position-wise-feed-forward-layer","method_name":"Position-Wise Feed-Forward Layer"},{"method_slug":"residual-connection","method_name":"Residual Connection"},{"method_slug":"softmax","method_name":"Softmax"},{"method_slug":"transformer","method_name":"Transformer"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2406.15881","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.15881"}},"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/brcsomnath/fasttreeintegrator","reach":null}],"summary":{"ran_fixture":3,"ran_draft_wrong":2},"by_repo_kind":{"official":{"samples":5,"ran":5,"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":5,"samples":[{"code_sha256_prefix":"8d9ce4f74a181e79","entry":"compute_cross_contribs","repo":"brcsomnath/fasttreeintegrator","repo_kind":"official","path":"src/ftfi.py","file_url":"https://github.com/brcsomnath/fasttreeintegrator/blob/HEAD/src/ftfi.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"8d9ce4f74a181e79"}},{"code_sha256_prefix":"46d99e887fccc566","entry":"create_edge_lists","repo":"brcsomnath/fasttreeintegrator","repo_kind":"official","path":"src/graph_classification.py","file_url":"https://github.com/brcsomnath/fasttreeintegrator/blob/HEAD/src/graph_classification.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"46d99e887fccc566"}},{"code_sha256_prefix":"48d324fb7e3d07e3","entry":"generate_weights_from_adjacency_list","repo":"brcsomnath/fasttreeintegrator","repo_kind":"official","path":"src/vertex_normal_prediction.py","file_url":"https://github.com/brcsomnath/fasttreeintegrator/blob/HEAD/src/vertex_normal_prediction.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"48d324fb7e3d07e3"}},{"code_sha256_prefix":"ebcd21f5817a956f","entry":"integrate_cross_terms","repo":"brcsomnath/fasttreeintegrator","repo_kind":"official","path":"src/ftfi.py","file_url":"https://github.com/brcsomnath/fasttreeintegrator/blob/HEAD/src/ftfi.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"ebcd21f5817a956f"}},{"code_sha256_prefix":"3b71a042d81361c8","entry":"integrate_on_tree","repo":"brcsomnath/fasttreeintegrator","repo_kind":"official","path":"src/ftfi.py","file_url":"https://github.com/brcsomnath/fasttreeintegrator/blob/HEAD/src/ftfi.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"3b71a042d81361c8"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}