{"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/quasi-monte-carlo-graph-random-features","title":"Quasi-Monte Carlo Graph Random Features","arxiv_id":"2305.12470","date":"2023-05-21","proceeding":"NeurIPS 2023 11","authors":[],"abstract":"We present a novel mechanism to improve the accuracy of the recently-introduced class of graph random features (GRFs). Our method induces negative correlations between the lengths of the algorithm's random walks by imposing antithetic termination: a procedure to sample more diverse random walks which may be of independent interest. It has a trivial drop-in implementation. We derive strong theoretical guarantees on the properties of these quasi-Monte Carlo GRFs (q-GRFs), proving that they yield lower-variance estimators of the 2-regularised Laplacian kernel under mild conditions. Remarkably, our results hold for any graph topology. We demonstrate empirical accuracy improvements on a variety of tasks including a new practical application: time-efficient approximation of the graph diffusion process. To our knowledge, q-GRFs constitute the first rigorously studied quasi-Monte Carlo scheme for kernels defined on combinatorial objects, inviting new research on correlations between graph random walks.","url_abs":"https://arxiv.org/abs/2305.12470v1","url_pdf":"https://arxiv.org/pdf/2305.12470v1.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":"quasi-monte-carlo-graph-random-features","repo_url":"https://github.com/isaac-reid/antithetic_termination","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"quasi-monte-carlo-graph-random-features","repo_url":"https://github.com/isaac-reid/repelling_random_walks","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[],"methods":[{"method_slug":"diffusion","method_name":"Diffusion"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2305.12470","atlas_url":"https://app.syntology.ai/?focus=2305.12470","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.12470"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2305.12470"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2305.12470"},"call":"get_harvested_code_for_paper(arxiv_id=\"2305.12470\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2305.12470"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2305.12470\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2305.12470"},"call":"get_concepts_for_paper(arxiv_id=\"2305.12470\")"}],"by_repo":[{"repo":"isaac-reid/antithetic_termination","kind":"listed","samples":6,"ran":5,"instrument":0,"unverified":1},{"repo":"isaac-reid/repelling_random_walks","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2310.04854"],"harvested_for_calls":[{"arxiv_id":"2310.04854","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2310.04854"},"call":"get_harvested_code_for_paper(arxiv_id=\"2310.04854\")"}]}],"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","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2305.12470.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2305.12470.svg"},"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/isaac-reid/antithetic_termination","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/isaac-reid/repelling_random_walks","reach":null}],"summary":{"ran":5,"unverified":1},"n_samples":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"listed":{"samples":6,"ran":5,"n_ran_checked":5,"n_instrument":0,"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,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":5,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-24","last":"2026-09-24","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"samples":[{"code_sha256":"120f5431d3ef31a0","code_sha256_prefix":"120f5431d3ef31a0","entry":"create_antithetic_rf_vector","repo":"isaac-reid/antithetic_termination","repo_kind":"listed","path":"rf_construction.py","file_url":"https://github.com/isaac-reid/antithetic_termination/blob/HEAD/rf_construction.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"adj_lists:list/1/list, weight_lists:list/1/list, base_vertex:int/0/int, p_halt:float/0/float, nb_random_walks:int/0/int","fixture_out_type":"ndarray","level_recorded_at":"2026-09-24T22:55:07.240920+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"120f5431d3ef31a0"}},{"code_sha256":"0d653b446ab206a1","code_sha256_prefix":"0d653b446ab206a1","entry":"create_lr_fact_of_squared_inv_id_min_w","repo":"isaac-reid/antithetic_termination","repo_kind":"listed","path":"rf_construction.py","file_url":"https://github.com/isaac-reid/antithetic_termination/blob/HEAD/rf_construction.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"adj_lists:list/1/list, weight_lists:list/1/list, p_halt:float/0/float, nb_random_walks:int/0/int, term_coupling:NoneType/0/?","fixture_out_type":"tuple","level_recorded_at":"2026-09-24T22:55:07.240920+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"0d653b446ab206a1"}},{"code_sha256":"6775b84364569ac5","code_sha256_prefix":"6775b84364569ac5","entry":"get_exact_evaluation","repo":"isaac-reid/antithetic_termination","repo_kind":"listed","path":"utils.py","file_url":"https://github.com/isaac-reid/antithetic_termination/blob/HEAD/utils.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"A:ndarray/2/float","fixture_out_type":"ndarray","level_recorded_at":"2026-09-24T22:55:07.240920+00:00","retrieve_with":{"tool":"get_code","code_sha256":"6775b84364569ac5"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"6775b84364569ac5"}},{"code_sha256":"08d859eff2d149ce","code_sha256_prefix":"08d859eff2d149ce","entry":"get_laplacian_matrix","repo":"isaac-reid/antithetic_termination","repo_kind":"listed","path":"utils.py","file_url":"https://github.com/isaac-reid/antithetic_termination/blob/HEAD/utils.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"W:ndarray/2/float","fixture_out_type":"ndarray","level_recorded_at":"2026-09-24T22:55:07.240920+00:00","retrieve_with":{"tool":"get_code","code_sha256":"08d859eff2d149ce"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"08d859eff2d149ce"}},{"code_sha256":"94dd4cfe6ccd87c3","code_sha256_prefix":"94dd4cfe6ccd87c3","entry":"get_unnormalised_laplacian_matrix","repo":"isaac-reid/antithetic_termination","repo_kind":"listed","path":"utils.py","file_url":"https://github.com/isaac-reid/antithetic_termination/blob/HEAD/utils.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"W:ndarray/2/float","fixture_out_type":"ndarray","level_recorded_at":"2026-09-24T22:55:07.240920+00:00","retrieve_with":{"tool":"get_code","code_sha256":"94dd4cfe6ccd87c3"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"94dd4cfe6ccd87c3"}},{"code_sha256":"5254a6f553ebe584","code_sha256_prefix":"5254a6f553ebe584","entry":"create_rf_vector","repo":"isaac-reid/antithetic_termination","repo_kind":"listed","path":"rf_construction.py","file_url":"https://github.com/isaac-reid/antithetic_termination/blob/HEAD/rf_construction.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"5254a6f553ebe584"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"a832ab7ac4f8150ca72e1bde1ce78efd43647d069b51110803eb4087c2992eea","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}