{"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-task-specific-data-valuation-for","title":"Efficient Task-Specific Data Valuation for Nearest Neighbor Algorithms","arxiv_id":"1908.08619","date":"2019-08-22","proceeding":null,"authors":["Ruoxi Jia","David Dao","Boxin Wang","Frances Ann Hubis","Nezihe Merve Gurel","Bo Li","Ce Zhang","Costas J. Spanos","Dawn Song"],"abstract":"Given a data set $\\mathcal{D}$ containing millions of data points and a data consumer who is willing to pay for \\$$X$ to train a machine learning (ML) model over $\\mathcal{D}$, how should we distribute this \\$$X$ to each data point to reflect its \"value\"? In this paper, we define the \"relative value of data\" via the Shapley value, as it uniquely possesses properties with appealing real-world interpretations, such as fairness, rationality and decentralizability. For general, bounded utility functions, the Shapley value is known to be challenging to compute: to get Shapley values for all $N$ data points, it requires $O(2^N)$ model evaluations for exact computation and $O(N\\log N)$ for $(\\epsilon, \\delta)$-approximation. In this paper, we focus on one popular family of ML models relying on $K$-nearest neighbors ($K$NN). The most surprising result is that for unweighted $K$NN classifiers and regressors, the Shapley value of all $N$ data points can be computed, exactly, in $O(N\\log N)$ time -- an exponential improvement on computational complexity! Moreover, for $(\\epsilon, \\delta)$-approximation, we are able to develop an algorithm based on Locality Sensitive Hashing (LSH) with only sublinear complexity $O(N^{h(\\epsilon,K)}\\log N)$ when $\\epsilon$ is not too small and $K$ is not too large. We empirically evaluate our algorithms on up to $10$ million data points and even our exact algorithm is up to three orders of magnitude faster than the baseline approximation algorithm. The LSH-based approximation algorithm can accelerate the value calculation process even further. We then extend our algorithms to other scenarios such as (1) weighed $K$NN classifiers, (2) different data points are clustered by different data curators, and (3) there are data analysts providing computation who also requires proper valuation.","url_abs":"https://arxiv.org/abs/1908.08619v4","url_pdf":"https://arxiv.org/pdf/1908.08619v4.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-task-specific-data-valuation-for","repo_url":"https://github.com/AI-secure/KNN-PVLDB","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null},{"paper_slug":"efficient-task-specific-data-valuation-for","repo_url":"https://github.com/jiachen-t-wang/softlabel-knnsv","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"efficient-task-specific-data-valuation-for","repo_url":"https://github.com/aai-institute/pyDVL","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"LGPL-3.0"}}],"tasks":[{"task_slug":"data-valuation","task_name":"Data Valuation"},{"task_slug":"fairness","task_name":"Fairness"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1908.08619","atlas_url":"https://app.syntology.ai/?focus=1908.08619","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.08619"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1908.08619"},"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":"1908.08619"},"call":"get_harvested_code_for_paper(arxiv_id=\"1908.08619\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"1908.08619"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1908.08619\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1908.08619"},"call":"get_concepts_for_paper(arxiv_id=\"1908.08619\")"}],"by_repo":[{"repo":"AI-secure/KNN-PVLDB","kind":"official","samples":5,"ran":3,"instrument":0,"unverified":2},{"repo":"jiachen-t-wang/softlabel-knnsv","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"aai-institute/pyDVL","kind":"listed","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","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/1908.08619.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/1908.08619.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/aai-institute/pyDVL","reach":{"status":"ok","spdx":"LGPL-3.0"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/AI-secure/KNN-PVLDB","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/jiachen-t-wang/softlabel-knnsv","reach":{"status":"ok"}}],"summary":{"ran_violates":2,"ran_honours":1,"unverified":2},"n_samples":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"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":5,"ran":3,"n_ran_checked":3,"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":5,"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":3,"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"},"samples":[{"code_sha256":"2e9cc8a495e67787","code_sha256_prefix":"2e9cc8a495e67787","entry":"f_h","repo":"AI-secure/KNN-PVLDB","repo_kind":"official","path":"LSH_sp.py","file_url":"https://github.com/AI-secure/KNN-PVLDB/blob/HEAD/LSH_sp.py","link_basis":"first_harvest_node","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"signature":"x:ndarray/1/float, r:ndarray/1/float","fixture_out_type":"ndarray","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"2e9cc8a495e67787"},"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, AI-secure/KNN-PVLDB when it was checked","mcp_get_code":{"code_sha256":"2e9cc8a495e67787"}},{"code_sha256":"e67e143e38420a4d","code_sha256_prefix":"e67e143e38420a4d","entry":"g_unnormalize","repo":"AI-secure/KNN-PVLDB","repo_kind":"official","path":"LSH_sp.py","file_url":"https://github.com/AI-secure/KNN-PVLDB/blob/HEAD/LSH_sp.py","link_basis":"first_harvest_node","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"signature":"dist_rand:ndarray/1/float, dist_knn:ndarray/1/float, r:float/0/float","fixture_out_type":"ndarray","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"e67e143e38420a4d"},"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, AI-secure/KNN-PVLDB when it was checked","mcp_get_code":{"code_sha256":"e67e143e38420a4d"}},{"code_sha256":"5d1ed50303465971","code_sha256_prefix":"5d1ed50303465971","entry":"get_true_KNN","repo":"AI-secure/KNN-PVLDB","repo_kind":"official","path":"exact_sp.py","file_url":"https://github.com/AI-secure/KNN-PVLDB/blob/HEAD/exact_sp.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"signature":"x_trn:ndarray/2/float, x_tst:ndarray/2/float","fixture_out_type":"ndarray","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"5d1ed50303465971"},"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, AI-secure/KNN-PVLDB when it was checked","mcp_get_code":{"code_sha256":"5d1ed50303465971"}},{"code_sha256":"88ac4fa8eb9856bc","code_sha256_prefix":"88ac4fa8eb9856bc","entry":"compute_single_unweighted_knn_class_shapley","repo":"AI-secure/KNN-PVLDB","repo_kind":"official","path":"exact_sp.py","file_url":"https://github.com/AI-secure/KNN-PVLDB/blob/HEAD/exact_sp.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":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, AI-secure/KNN-PVLDB when it was checked","mcp_get_code":{"code_sha256":"88ac4fa8eb9856bc"}},{"code_sha256":"4ac9acba6d2f7887","code_sha256_prefix":"4ac9acba6d2f7887","entry":"get_contrast","repo":"AI-secure/KNN-PVLDB","repo_kind":"official","path":"LSH_sp.py","file_url":"https://github.com/AI-secure/KNN-PVLDB/blob/HEAD/LSH_sp.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":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, AI-secure/KNN-PVLDB when it was checked","mcp_get_code":{"code_sha256":"4ac9acba6d2f7887"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"c544732b915af0f05dd4b951864399e3530ac2991f4a50e57c938513329e7740","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}