{"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/efficient-aggregated-kernel-tests-using","title":"Efficient Aggregated Kernel Tests using Incomplete $U$-statistics","arxiv_id":"2206.09194","date":"2022-06-18","proceeding":null,"authors":["Antonin Schrab","Ilmun Kim","Benjamin Guedj","Arthur Gretton"],"abstract":"We propose a series of computationally efficient nonparametric tests for the two-sample, independence, and goodness-of-fit problems, using the Maximum Mean Discrepancy (MMD), Hilbert Schmidt Independence Criterion (HSIC), and Kernel Stein Discrepancy (KSD), respectively. Our test statistics are incomplete $U$-statistics, with a computational cost that interpolates between linear time in the number of samples, and quadratic time, as associated with classical $U$-statistic tests. The three proposed tests aggregate over several kernel bandwidths to detect departures from the null on various scales: we call the resulting tests MMDAggInc, HSICAggInc and KSDAggInc. This procedure provides a solution to the fundamental kernel selection problem as we can aggregate a large number of kernels with several bandwidths without incurring a significant loss of test power. For the test thresholds, we derive a quantile bound for wild bootstrapped incomplete $U$-statistics, which is of independent interest. We derive non-asymptotic uniform separation rates for MMDAggInc and HSICAggInc, and quantify exactly the trade-off between computational efficiency and the attainable rates: this result is novel for tests based on incomplete $U$-statistics, to our knowledge. We further show that in the quadratic-time case, the wild bootstrap incurs no penalty to test power over the more widespread permutation-based approach, since both attain the same minimax optimal rates (which in turn match the rates that use oracle quantiles). We support our claims with numerical experiments on the trade-off between computational efficiency and test power. In all three testing frameworks, the linear-time versions of our proposed tests perform at least as well as the current linear-time state-of-the-art tests.","url_abs":"https://arxiv.org/abs/2206.09194v3","url_pdf":"https://arxiv.org/pdf/2206.09194v3.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":"efficient-aggregated-kernel-tests-using","repo_url":"https://github.com/antoninschrab/ksdagg","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"jax","reach":null},{"paper_slug":"efficient-aggregated-kernel-tests-using","repo_url":"https://github.com/antoninschrab/agginc-paper","is_official":0,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"jax","reach":null},{"paper_slug":"efficient-aggregated-kernel-tests-using","repo_url":"https://github.com/antoninschrab/agginc","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"jax","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"efficient-aggregated-kernel-tests-using","repo_url":"https://github.com/antoninschrab/mmdagg","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"jax","reach":null}],"tasks":[{"task_slug":"computational-efficiency","task_name":"Computational Efficiency"}],"methods":[{"method_slug":"test","method_name":"Test"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2206.09194","atlas_url":"https://app.syntology.ai/?focus=2206.09194","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.09194"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2206.09194"},"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":"2206.09194"},"call":"get_harvested_code_for_paper(arxiv_id=\"2206.09194\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2206.09194"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2206.09194\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2206.09194"},"call":"get_concepts_for_paper(arxiv_id=\"2206.09194\")"}],"by_repo":[{"repo":"antoninschrab/ksdagg","kind":"official","samples":3,"ran":2,"instrument":1,"unverified":1},{"repo":"antoninschrab/agginc-paper","kind":"named_in_paper","samples":2,"ran":2,"instrument":0,"unverified":0},{"repo":"antoninschrab/agginc","kind":"listed","samples":2,"ran":0,"instrument":0,"unverified":2},{"repo":"antoninschrab/mmdagg","kind":"listed","samples":6,"ran":6,"instrument":5,"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","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/2206.09194.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/2206.09194.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/antoninschrab/agginc-paper","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/antoninschrab/ksdagg","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/antoninschrab/mmdagg","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/antoninschrab/agginc","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran_fixture":5,"ran_honours":4,"ran_draft_wrong":1,"unverified":3},"n_samples":13,"n_ran":10,"n_constructed":0,"n_ran_checked":4,"n_instrument":6,"n_unverified":3,"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":{"official":{"samples":3,"ran":2,"n_ran_checked":1,"n_instrument":1,"repositories":1},"named_in_paper":{"samples":2,"ran":2,"n_ran_checked":2,"n_instrument":0,"repositories":1},"listed":{"samples":8,"ran":6,"n_ran_checked":1,"n_instrument":5,"repositories":2}},"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":10,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-22","last":"2026-09-22","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"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"139c7796806ebcb2","code_sha256_prefix":"139c7796806ebcb2","entry":"compute_pairwise_matrix","repo":"antoninschrab/mmdagg","repo_kind":"listed","path":"mmdagg/np.py","file_url":"https://github.com/antoninschrab/mmdagg/blob/HEAD/mmdagg/np.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"signature":"X:ndarray/2/float, Y:ndarray/2/float, l:str/0/str","fixture_out_type":"ndarray","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"139c7796806ebcb2"}},{"code_sha256":"752346c21d60e812","code_sha256_prefix":"752346c21d60e812","entry":"create_indices","repo":"antoninschrab/agginc-paper","repo_kind":"named_in_paper","path":"agginc/np.py","file_url":"https://github.com/antoninschrab/agginc-paper/blob/HEAD/agginc/np.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"signature":"N:int/0/int, R:int/0/int","fixture_out_type":"tuple","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/create-indices","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"752346c21d60e812"}},{"code_sha256":"b94b433bd9c69435","code_sha256_prefix":"b94b433bd9c69435","entry":"create_indices","repo":"antoninschrab/agginc-paper","repo_kind":"named_in_paper","path":"agginc/jax.py","file_url":"https://github.com/antoninschrab/agginc-paper/blob/HEAD/agginc/jax.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"signature":"N:int/0/int, R:int/0/int","fixture_out_type":"tuple","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/create-indices","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"b94b433bd9c69435"}},{"code_sha256":"35e8a1dce671edd0","code_sha256_prefix":"35e8a1dce671edd0","entry":"create_weights","repo":"antoninschrab/ksdagg","repo_kind":"official","path":"ksdagg/jax.py","file_url":"https://github.com/antoninschrab/ksdagg/blob/HEAD/ksdagg/jax.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"signature":"N:int/0/int, weights_type:str/0/str","fixture_out_type":"ArrayImpl","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/create-weights","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"35e8a1dce671edd0"}},{"code_sha256":"ade4e10146ee1a5c","code_sha256_prefix":"ade4e10146ee1a5c","entry":"create_weights","repo":"antoninschrab/mmdagg","repo_kind":"listed","path":"mmdagg/jax.py","file_url":"https://github.com/antoninschrab/mmdagg/blob/HEAD/mmdagg/jax.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"signature":"N:int/0/int, weights_type:str/0/str","fixture_out_type":"ArrayImpl","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/create-weights","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"ade4e10146ee1a5c"}},{"code_sha256":"f3d6af9cdda0f3d5","code_sha256_prefix":"f3d6af9cdda0f3d5","entry":"jax_distances","repo":"antoninschrab/ksdagg","repo_kind":"official","path":"ksdagg/jax.py","file_url":"https://github.com/antoninschrab/ksdagg/blob/HEAD/ksdagg/jax.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"signature":"X:ArrayImpl/2/float, Y:ArrayImpl/2/float, max_samples:int/0/int","fixture_out_type":"ArrayImpl","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"f3d6af9cdda0f3d5"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"f3d6af9cdda0f3d5"}},{"code_sha256":"2c48c4eb0714eef3","code_sha256_prefix":"2c48c4eb0714eef3","entry":"kernel_matrix","repo":"antoninschrab/mmdagg","repo_kind":"listed","path":"mmdagg/jax.py","file_url":"https://github.com/antoninschrab/mmdagg/blob/HEAD/mmdagg/jax.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"signature":"pairwise_matrix:ArrayImpl/2/float, l:str/0/str, kernel:str/0/str, bandwidth:float/0/float","fixture_out_type":"ArrayImpl","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/kernel-matrix","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"2c48c4eb0714eef3"}},{"code_sha256":"4e7beb2199214856","code_sha256_prefix":"4e7beb2199214856","entry":"kernel_matrix","repo":"antoninschrab/mmdagg","repo_kind":"listed","path":"mmdagg/np.py","file_url":"https://github.com/antoninschrab/mmdagg/blob/HEAD/mmdagg/np.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"signature":"pairwise_matrix:ndarray/2/float, l:str/0/str, kernel_type:str/0/str, bandwidth:float/0/float","fixture_out_type":"ndarray","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/kernel-matrix","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"4e7beb2199214856"}},{"code_sha256":"6fe45123a54a45b7","code_sha256_prefix":"6fe45123a54a45b7","entry":"mmdagg","repo":"antoninschrab/mmdagg","repo_kind":"listed","path":"mmdagg/jax.py","file_url":"https://github.com/antoninschrab/mmdagg/blob/HEAD/mmdagg/jax.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"signature":"X:ArrayImpl/2/float, Y:ArrayImpl/2/float, alpha:float/0/float, kernel:str/0/str, number_bandwidths:int/0/int, weights_type:str/0/str, B1:int/0/int, B2:int/0/int, B3:int/0/int, seed:int/0/int, return_dictionary:bool/0/bool, permutations_same_sample_size:bool/0/bool, bandwidths:NoneType/0/?","fixture_out_type":"ArrayImpl","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"6fe45123a54a45b7"}},{"code_sha256":"e46e1093bf2aa225","code_sha256_prefix":"e46e1093bf2aa225","entry":"mmdagg","repo":"antoninschrab/mmdagg","repo_kind":"listed","path":"mmdagg/np.py","file_url":"https://github.com/antoninschrab/mmdagg/blob/HEAD/mmdagg/np.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"signature":"X:ndarray/2/float, Y:ndarray/2/float, alpha:float/0/float, kernel:str/0/str, number_bandwidths:int/0/int, weights_type:str/0/str, B1:int/0/int, B2:int/0/int, B3:int/0/int, seed:int/0/int, return_dictionary:bool/0/bool, permutations_same_sample_size:bool/0/bool","fixture_out_type":"int","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"e46e1093bf2aa225"}},{"code_sha256":"52b452b4fab9d208","code_sha256_prefix":"52b452b4fab9d208","entry":"agginc","repo":"antoninschrab/agginc","repo_kind":"listed","path":"agginc/np.py","file_url":"https://github.com/antoninschrab/agginc/blob/HEAD/agginc/np.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":"52b452b4fab9d208"}},{"code_sha256":"2c9d9a068ef0b1e9","code_sha256_prefix":"2c9d9a068ef0b1e9","entry":"inc","repo":"antoninschrab/agginc","repo_kind":"listed","path":"agginc/np.py","file_url":"https://github.com/antoninschrab/agginc/blob/HEAD/agginc/np.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":"2c9d9a068ef0b1e9"}},{"code_sha256":"c07fb17178973f65","code_sha256_prefix":"c07fb17178973f65","entry":"ksdagg","repo":"antoninschrab/ksdagg","repo_kind":"official","path":"ksdagg/jax.py","file_url":"https://github.com/antoninschrab/ksdagg/blob/HEAD/ksdagg/jax.py","link_basis":"first_harvest_node","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":"c07fb17178973f65"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"89c9af74f3386ffbcd3c3e3d967b4d0dd1ad40c48c1b9204c240138419b81ae7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}