{"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":"/task/data-valuation","name":"Data Valuation","slug":"data-valuation","description_markdown":"Data valuation in machine learning tries to determine the worth of data, or data sets, for downstream tasks. Some methods are task-agnostic and consider datasets as a whole, mostly for decision making in data markets. These look at distributional distances between samples. More often, methods look at how individual points affect performance of specific machine learning models. They assign a scalar to each element of a training set which reflects its contribution to the final performance of some model trained on it. Some concepts of value depend on a specific model of interest, others are model-agnostic.\r\n\r\nConcepts of the usefulness of a datum or its influence on the outcome of a prediction have a long history in statistics and ML, in particular through the notion of the influence function. However, it has only been recently that rigorous and practical notions of value for data, and in particular data-sets, have appeared in the ML literature, often based on concepts from collaborative game theory, but also from generalization estimates of neural networks, or optimal transport theory, among others.","categories":[{"name":"Methodology","url":"/area/methodology"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":119,"papers_with_code":53,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":1,"parent_tasks":0},"benchmarks":[],"datasets":[],"subtasks":[{"url":"/task/data-interaction","name":"Data Interaction"}],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":2,"rows_per_page":100,"shown":100,"of":119,"of_with_code":53,"tagged_in_all":119,"counts":{"archive_papers_tagged":119,"with_a_code_link":53,"where_syntology_ran_a_sample":21,"not_listed_spam_title":0,"listed":119,"listed_where_code_ran":21,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":17,"every_run_a_failure_of_syntologys_instrument":4,"listed_with_a_run_with_no_instrument_failure":17,"listed_every_run_a_failure_of_syntologys_instrument":4,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/data-shapley-equitable-valuation-of-data-for","slug":"data-shapley-equitable-valuation-of-data-for","title":"Data Shapley: Equitable Valuation of Data for Machine Learning","date":"2019-04-05","arxiv_id":"1904.02868","repositories_listed":6,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/data-shapley-equitable-valuation-of-data-for#ran","syntology_url":"https://syntology.ai/paper/1904.02868","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.02868"}},"official":{"repos":["amiratag/DataShapley"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/stochastic-amortization-a-unified-approach-to","slug":"stochastic-amortization-a-unified-approach-to","title":"Stochastic Amortization: A Unified Approach to Accelerate Feature and Data Attribution","date":"2024-01-29","arxiv_id":"2401.15866","repositories_listed":3,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":3,"n_violates":1,"n_no_contract":2,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 3 honoured, 1 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/stochastic-amortization-a-unified-approach-to#ran","syntology_url":"https://syntology.ai/paper/2401.15866","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.15866"}},"official":{"repos":["chanwkimlab/amortized-attribution","chanwkimlab/xai-amortization","iancovert/amortized-valuation"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/the-shapley-value-in-machine-learning","slug":"the-shapley-value-in-machine-learning","title":"The Shapley Value in Machine Learning","date":"2022-02-11","arxiv_id":"2202.05594","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-shapley-value-in-machine-learning#ran","syntology_url":"https://syntology.ai/paper/2202.05594","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.05594"}},"official":{"repos":["benedekrozemberczki/shapley"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-task-specific-data-valuation-for","slug":"efficient-task-specific-data-valuation-for","title":"Efficient Task-Specific Data Valuation for Nearest Neighbor Algorithms","date":"2019-08-22","arxiv_id":"1908.08619","repositories_listed":3,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":2,"n_no_contract":0,"n_pointer_only":5,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 2 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/efficient-task-specific-data-valuation-for#ran","syntology_url":"https://syntology.ai/paper/1908.08619","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.08619"}},"official":{"repos":["AI-secure/KNN-PVLDB"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/2d-oob-attributing-data-contribution-through","slug":"2d-oob-attributing-data-contribution-through","title":"2D-OOB: Attributing Data Contribution Through Joint Valuation Framework","date":"2024-08-07","arxiv_id":"2408.03572","repositories_listed":2,"syntology":null},{"url":"/paper/chg-shapley-efficient-data-valuation-and","slug":"chg-shapley-efficient-data-valuation-and","title":"CHG Shapley: Efficient Data Valuation and Selection towards Trustworthy Machine Learning","date":"2024-06-17","arxiv_id":"2406.11730","repositories_listed":2,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":1,"n_instrument":5,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/chg-shapley-efficient-data-valuation-and#ran","syntology_url":"https://syntology.ai/paper/2406.11730","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.11730"}},"official":{"repos":["caihuaiguang/CHG-Shapley-for-Data-Selection","caihuaiguang/CHG-Shapley-for-Data-Valuation"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/opendataval-a-unified-benchmark-for-data-1","slug":"opendataval-a-unified-benchmark-for-data-1","title":"OpenDataVal: a Unified Benchmark for Data Valuation","date":"2023-06-18","arxiv_id":"2306.10577","repositories_listed":2,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":1,"n_instrument":5,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/opendataval-a-unified-benchmark-for-data-1#ran","syntology_url":"https://syntology.ai/paper/2306.10577","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.10577"}},"official":{"repos":["opendataval/opendataval"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/data-oob-out-of-bag-estimate-as-a-simple-and","slug":"data-oob-out-of-bag-estimate-as-a-simple-and","title":"Data-OOB: Out-of-bag Estimate as a Simple and Efficient Data Value","date":"2023-04-16","arxiv_id":"2304.07718","repositories_listed":2,"syntology":null},{"url":"/paper/cs-shapley-class-wise-shapley-values-for-data","slug":"cs-shapley-class-wise-shapley-values-for-data","title":"CS-Shapley: Class-wise Shapley Values for Data Valuation in Classification","date":"2022-11-13","arxiv_id":"2211.06800","repositories_listed":2,"syntology":null},{"url":"/paper/data-banzhaf-a-data-valuation-framework-with","slug":"data-banzhaf-a-data-valuation-framework-with","title":"Data Banzhaf: A Robust Data Valuation Framework for Machine Learning","date":"2022-05-30","arxiv_id":"2205.15466","repositories_listed":2,"syntology":null},{"url":"/paper/beta-shapley-a-unified-and-noise-reduced-data","slug":"beta-shapley-a-unified-and-noise-reduced-data","title":"Beta Shapley: a Unified and Noise-reduced Data Valuation Framework for Machine Learning","date":"2021-10-26","arxiv_id":"2110.14049","repositories_listed":2,"syntology":null},{"url":"/paper/data-valuation-using-reinforcement-learning","slug":"data-valuation-using-reinforcement-learning","title":"Data Valuation using Reinforcement Learning","date":"2019-09-25","arxiv_id":"1909.11671","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/data-valuation-using-reinforcement-learning#ran","syntology_url":"https://syntology.ai/paper/1909.11671","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.11671"}},"official":{"repos":["google-research/google-research"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/faithful-group-shapley-value","slug":"faithful-group-shapley-value","title":"Faithful Group Shapley Value","date":"2025-05-25","arxiv_id":"2505.19013","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/faithful-group-shapley-value#ran","syntology_url":"https://syntology.ai/paper/2505.19013","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.19013"}},"official":{"repos":["kiljael/faithful_gsv"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/shapley-guided-utility-learning-for-effective","slug":"shapley-guided-utility-learning-for-effective","title":"Shapley-Guided Utility Learning for Effective Graph Inference Data Valuation","date":"2025-03-23","arxiv_id":"2503.18195","repositories_listed":1,"syntology":null},{"url":"/paper/fw-shapley-real-time-estimation-of-weighted","slug":"fw-shapley-real-time-estimation-of-weighted","title":"FW-Shapley: Real-time Estimation of Weighted Shapley Values","date":"2025-03-09","arxiv_id":"2503.06602","repositories_listed":1,"syntology":null},{"url":"/paper/alinfik-learning-to-approximate-linearized","slug":"alinfik-learning-to-approximate-linearized","title":"ALinFiK: Learning to Approximate Linearized Future Influence Kernel for Scalable Third-Party LLM Data Valuation","date":"2025-03-02","arxiv_id":"2503.01052","repositories_listed":1,"syntology":null},{"url":"/paper/dupre-data-utility-prediction-for-efficient","slug":"dupre-data-utility-prediction-for-efficient","title":"DUPRE: Data Utility Prediction for Efficient Data Valuation","date":"2025-02-22","arxiv_id":"2502.16152","repositories_listed":1,"syntology":null},{"url":"/paper/data-valuation-using-neural-networks-for","slug":"data-valuation-using-neural-networks-for","title":"Data Valuation using Neural Networks for Efficient Instruction Fine-Tuning","date":"2025-02-14","arxiv_id":"2502.09969","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-models-explainable-data-valuation-and","slug":"beyond-models-explainable-data-valuation-and","title":"Beyond Models! Explainable Data Valuation and Metric Adaption for Recommendation","date":"2025-02-12","arxiv_id":"2502.08685","repositories_listed":1,"syntology":null},{"url":"/paper/qless-a-quantized-approach-for-data-valuation","slug":"qless-a-quantized-approach-for-data-valuation","title":"QLESS: A Quantized Approach for Data Valuation and Selection in Large Language Model Fine-Tuning","date":"2025-02-03","arxiv_id":"2502.01703","repositories_listed":1,"syntology":null},{"url":"/paper/lossval-efficient-data-valuation-for-neural","slug":"lossval-efficient-data-valuation-for-neural","title":"LossVal: Efficient Data Valuation for Neural Networks","date":"2024-12-05","arxiv_id":"2412.04158","repositories_listed":1,"syntology":null},{"url":"/paper/towards-data-valuation-via-asymmetric-data","slug":"towards-data-valuation-via-asymmetric-data","title":"Towards Data Valuation via Asymmetric Data Shapley","date":"2024-11-01","arxiv_id":"2411.00388","repositories_listed":1,"syntology":null},{"url":"/paper/one-sample-fits-all-approximating-all","slug":"one-sample-fits-all-approximating-all","title":"One Sample Fits All: Approximating All Probabilistic Values Simultaneously and Efficiently","date":"2024-10-31","arxiv_id":"2410.23808","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/one-sample-fits-all-approximating-all#ran","syntology_url":"https://syntology.ai/paper/2410.23808","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.23808"}},"official":{"repos":["watml/one-for-all"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/data-distribution-valuation","slug":"data-distribution-valuation","title":"Data Distribution Valuation","date":"2024-10-06","arxiv_id":"2410.04386","repositories_listed":1,"syntology":{"n":13,"n_ran":12,"n_constructed":0,"n_ran_checked":6,"n_instrument":6,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 6 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/data-distribution-valuation#ran","syntology_url":"https://syntology.ai/paper/2410.04386","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.04386"}},"official":{"repos":["xinyiys/data_distribution_valuation"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/shapiq-shapley-interactions-for-machine","slug":"shapiq-shapley-interactions-for-machine","title":"shapiq: Shapley Interactions for Machine Learning","date":"2024-10-02","arxiv_id":"2410.01649","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/shapiq-shapley-interactions-for-machine#ran","syntology_url":"https://syntology.ai/paper/2410.01649","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.01649"}},"official":{"repos":["mmschlk/shapiq"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/targeted-synthetic-data-generation-for","slug":"targeted-synthetic-data-generation-for","title":"Targeted synthetic data generation for tabular data via hardness characterization","date":"2024-10-01","arxiv_id":"2410.00759","repositories_listed":1,"syntology":null},{"url":"/paper/influence-based-attributions-can-be","slug":"influence-based-attributions-can-be","title":"Influence-based Attributions can be Manipulated","date":"2024-09-08","arxiv_id":"2409.05208","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/influence-based-attributions-can-be#ran","syntology_url":"https://syntology.ai/paper/2409.05208","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.05208"}},"official":{"repos":["infinite-pursuits/influence-based-attributions-can-be-manipulated"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/in-context-probing-approximates-influence","slug":"in-context-probing-approximates-influence","title":"In-Context Probing Approximates Influence Function for Data Valuation","date":"2024-07-17","arxiv_id":"2407.12259","repositories_listed":1,"syntology":null},{"url":"/paper/redefining-contributions-shapley-driven","slug":"redefining-contributions-shapley-driven","title":"Redefining Contributions: Shapley-Driven Federated Learning","date":"2024-06-01","arxiv_id":"2406.00569","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":3,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/redefining-contributions-shapley-driven#ran","syntology_url":"https://syntology.ai/paper/2406.00569","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.00569"}},"official":{"repos":["tnurbek/shapfed"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/scaling-laws-for-the-value-of-individual-data","slug":"scaling-laws-for-the-value-of-individual-data","title":"Scaling Laws for the Value of Individual Data Points in Machine Learning","date":"2024-05-30","arxiv_id":"2405.20456","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/scaling-laws-for-the-value-of-individual-data#ran","syntology_url":"https://syntology.ai/paper/2405.20456","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.20456"}},"official":{"repos":["iancovert/data-scaling"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/what-is-your-data-worth-to-gpt-llm-scale-data","slug":"what-is-your-data-worth-to-gpt-llm-scale-data","title":"What is Your Data Worth to GPT? LLM-Scale Data Valuation with Influence Functions","date":"2024-05-22","arxiv_id":"2405.13954","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/what-is-your-data-worth-to-gpt-llm-scale-data#ran","syntology_url":"https://syntology.ai/paper/2405.13954","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.13954"}},"official":{"repos":["logix-project/logix"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/data-valuation-with-gradient-similarity","slug":"data-valuation-with-gradient-similarity","title":"Data Valuation with Gradient Similarity","date":"2024-05-13","arxiv_id":"2405.08217","repositories_listed":1,"syntology":null},{"url":"/paper/interpretable-machine-learning-for-tabpfn","slug":"interpretable-machine-learning-for-tabpfn","title":"Interpretable Machine Learning for TabPFN","date":"2024-03-16","arxiv_id":"2403.10923","repositories_listed":1,"syntology":{"n":12,"n_ran":12,"n_constructed":0,"n_ran_checked":5,"n_instrument":7,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 7 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/interpretable-machine-learning-for-tabpfn#ran","syntology_url":"https://syntology.ai/paper/2403.10923","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.10923"}},"official":{"repos":["david-rundel/tabpfn_iml"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/precedence-constrained-winter-value-for","slug":"precedence-constrained-winter-value-for","title":"Precedence-Constrained Winter Value for Effective Graph Data Valuation","date":"2024-02-02","arxiv_id":"2402.01943","repositories_listed":1,"syntology":null},{"url":"/paper/derdava-deletion-robust-data-valuation-for","slug":"derdava-deletion-robust-data-valuation-for","title":"DeRDaVa: Deletion-Robust Data Valuation for Machine Learning","date":"2023-12-18","arxiv_id":"2312.11413","repositories_listed":1,"syntology":null},{"url":"/paper/accelerated-shapley-value-approximation-for","slug":"accelerated-shapley-value-approximation-for","title":"Accelerated Shapley Value Approximation for Data Evaluation","date":"2023-11-09","arxiv_id":"2311.05346","repositories_listed":1,"syntology":null},{"url":"/paper/data-valuation-and-detections-in-federated","slug":"data-valuation-and-detections-in-federated","title":"Data Valuation and Detections in Federated Learning","date":"2023-11-09","arxiv_id":"2311.05304","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-data-redundancy-in-real-world-image","slug":"exploring-data-redundancy-in-real-world-image","title":"Exploring Data Redundancy in Real-world Image Classification through Data Selection","date":"2023-06-25","arxiv_id":"2306.14113","repositories_listed":1,"syntology":null},{"url":"/paper/2d-shapley-a-framework-for-fragmented-data","slug":"2d-shapley-a-framework-for-fragmented-data","title":"2D-Shapley: A Framework for Fragmented Data Valuation","date":"2023-06-18","arxiv_id":"2306.10473","repositories_listed":1,"syntology":null},{"url":"/paper/data-selection-for-fine-tuning-large-language","slug":"data-selection-for-fine-tuning-large-language","title":"Data Selection for Fine-tuning Large Language Models Using Transferred Shapley Values","date":"2023-06-16","arxiv_id":"2306.10165","repositories_listed":1,"syntology":null},{"url":"/paper/data-valuation-the-partial-ordinal-shapley","slug":"data-valuation-the-partial-ordinal-shapley","title":"Data valuation: The partial ordinal Shapley value for machine learning","date":"2023-05-02","arxiv_id":"2305.01660","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/data-valuation-the-partial-ordinal-shapley#ran","syntology_url":"https://syntology.ai/paper/2305.01660","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.01660"}},"official":{"repos":["peizhengwang/partialordinalshapley"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/scalable-data-point-valuation-in","slug":"scalable-data-point-valuation-in","title":"Scalable Data Point Valuation in Decentralized Learning","date":"2023-05-01","arxiv_id":"2305.01657","repositories_listed":1,"syntology":null},{"url":"/paper/lava-data-valuation-without-pre-specified","slug":"lava-data-valuation-without-pre-specified","title":"LAVA: Data Valuation without Pre-Specified Learning Algorithms","date":"2023-04-28","arxiv_id":"2305.00054","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/lava-data-valuation-without-pre-specified#ran","syntology_url":"https://syntology.ai/paper/2305.00054","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.00054"}},"official":{"repos":["ruoxi-jia-group/lava"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-note-on-efficient-task-specific-data","slug":"a-note-on-efficient-task-specific-data","title":"A Note on \"Efficient Task-Specific Data Valuation for Nearest Neighbor Algorithms\"","date":"2023-04-09","arxiv_id":"2304.04258","repositories_listed":1,"syntology":null},{"url":"/paper/fairshap-a-data-re-weighting-approach-for","slug":"fairshap-a-data-re-weighting-approach-for","title":"Towards Algorithmic Fairness by means of Instance-level Data Re-weighting based on Shapley Values","date":"2023-03-03","arxiv_id":"2303.01928","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fairshap-a-data-re-weighting-approach-for#ran","syntology_url":"https://syntology.ai/paper/2303.01928","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.01928"}},"official":{"repos":["AdrianArnaiz/fair-shap"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/data-valuation-without-training-of-a-model","slug":"data-valuation-without-training-of-a-model","title":"Data Valuation Without Training of a Model","date":"2023-01-03","arxiv_id":"2301.00930","repositories_listed":1,"syntology":null},{"url":"/paper/probably-approximate-shapley-fairness-with","slug":"probably-approximate-shapley-fairness-with","title":"Probably Approximate Shapley Fairness with Applications in Machine Learning","date":"2022-12-01","arxiv_id":"2212.00630","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/probably-approximate-shapley-fairness-with#ran","syntology_url":"https://syntology.ai/paper/2212.00630","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.00630"}},"official":{"repos":["BobbyZhouZijian/ProbablyApproximateShapleyFairness"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/robust-data-valuation-via-variance-reduced","slug":"robust-data-valuation-via-variance-reduced","title":"Variance reduced Shapley value estimation for trustworthy data valuation","date":"2022-10-30","arxiv_id":"2210.16835","repositories_listed":1,"syntology":null},{"url":"/paper/incentivizing-collaboration-in-machine","slug":"incentivizing-collaboration-in-machine","title":"Incentivizing Collaboration in Machine Learning via Synthetic Data Rewards","date":"2021-12-17","arxiv_id":"2112.09327","repositories_listed":1,"syntology":{"n":18,"n_ran":16,"n_constructed":0,"n_ran_checked":16,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":16,"n_pointer_only":0,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 0 honoured, 0 violated, 16 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/incentivizing-collaboration-in-machine#ran","syntology_url":"https://syntology.ai/paper/2112.09327","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.09327"}},"official":{"repos":["XinyiYS/CML-RewardDistribution"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":16,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-to-refit-for-convex-learning","slug":"learning-to-refit-for-convex-learning","title":"ModelPred: A Framework for Predicting Trained Model from Training Data","date":"2021-11-24","arxiv_id":"2111.12545","repositories_listed":1,"syntology":null},{"url":"/paper/learnability-of-learning-performance-and-its","slug":"learnability-of-learning-performance-and-its","title":"Improving Cooperative Game Theory-based Data Valuation via Data Utility Learning","date":"2021-07-13","arxiv_id":"2107.06336","repositories_listed":1,"syntology":null},{"url":"/paper/towards-efficient-data-valuation-based-on-the","slug":"towards-efficient-data-valuation-based-on-the","title":"Towards Efficient Data Valuation Based on the Shapley Value","date":"2019-02-27","arxiv_id":"1902.10275","repositories_listed":1,"syntology":null},{"url":"/paper/profit-allocation-for-federated-learning","slug":"profit-allocation-for-federated-learning","title":"Profit Allocation for Federated Learning","date":"2019-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":null,"slug":"semivalue-based-data-valuation-is-arbitrary","title":"Semivalue-based data valuation is arbitrary and gameable","date":"2025-06-14","arxiv_id":"2506.12619","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-datashapley-neural-modeling-for-training","title":"Fast-DataShapley: Neural Modeling for Training Data Valuation","date":"2025-06-05","arxiv_id":"2506.05281","repositories_listed":0,"syntology":null},{"url":null,"slug":"losing-is-for-cherishing-data-valuation-based","title":"Losing is for Cherishing: Data Valuation Based on Machine Unlearning and Shapley Value","date":"2025-05-22","arxiv_id":"2505.16147","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-data-valuation-approximation-in","title":"Efficient Data Valuation Approximation in Federated Learning: A Sampling-based Approach","date":"2025-04-23","arxiv_id":"2504.16668","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-fairness-to-truthfulness-rethinking-data","title":"From Fairness to Truthfulness: Rethinking Data Valuation Design","date":"2025-04-07","arxiv_id":"2504.05563","repositories_listed":0,"syntology":null},{"url":null,"slug":"monte-carlo-sampling-for-analyzing-in-context","title":"Monte Carlo Sampling for Analyzing In-Context Examples","date":"2025-03-27","arxiv_id":"2503.22002","repositories_listed":0,"syntology":null},{"url":null,"slug":"llm-aided-customizable-profiling-of-code-data","title":"LLM-Aided Customizable Profiling of Code Data Based On Programming Language Concepts","date":"2025-03-19","arxiv_id":"2503.15571","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimizing-product-provenance-verification","title":"Optimizing Product Provenance Verification using Data Valuation Methods","date":"2025-02-21","arxiv_id":"2502.15177","repositories_listed":0,"syntology":null},{"url":null,"slug":"liveval-time-aware-data-valuation-via","title":"LiveVal: Time-aware Data Valuation via Adaptive Reference Points","date":"2025-02-14","arxiv_id":"2502.10489","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-impact-of-the-utility-in-semivalue","title":"On the Impact of the Utility in Semivalue-based Data Valuation","date":"2025-02-10","arxiv_id":"2502.06574","repositories_listed":0,"syntology":null},{"url":null,"slug":"unifying-and-optimizing-data-values-for","title":"Unifying and Optimizing Data Values for Selection via Sequential-Decision-Making","date":"2025-02-06","arxiv_id":"2502.04554","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-overvaluation-attack-and-truthful-data","title":"Data Overvaluation Attack and Truthful Data Valuation in Federated Learning","date":"2025-02-01","arxiv_id":"2502.00494","repositories_listed":0,"syntology":null},{"url":null,"slug":"fairshare-data-pricing-for-large-language","title":"Fairshare Data Pricing via Data Valuation for Large Language Models","date":"2025-01-31","arxiv_id":"2502.00198","repositories_listed":0,"syntology":null},{"url":null,"slug":"fortifying-federated-learning-towards","title":"Fortifying Federated Learning Towards Trustworthiness via Auditable Data Valuation and Verifiable Client Contribution","date":"2025-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"data-value-estimation-on-private-gradients","title":"Data value estimation on private gradients","date":"2024-12-22","arxiv_id":"2412.17008","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-acquisition-for-improving-model-fairness","title":"Data Acquisition for Improving Model Fairness using Reinforcement Learning","date":"2024-12-04","arxiv_id":"2412.03009","repositories_listed":0,"syntology":null},{"url":null,"slug":"dissecting-misalignment-of-multimodal-large","title":"Dissecting Representation Misalignment in Contrastive Learning via Influence Function","date":"2024-11-18","arxiv_id":"2411.11667","repositories_listed":0,"syntology":null},{"url":null,"slug":"waka-data-attribution-using-k-nearest","title":"WaKA: Data Attribution using K-Nearest Neighbors and Membership Privacy Principles","date":"2024-11-02","arxiv_id":"2411.01357","repositories_listed":0,"syntology":null},{"url":null,"slug":"private-augmentation-robust-and-task-agnostic","title":"Private, Augmentation-Robust and Task-Agnostic Data Valuation Approach for Data Marketplace","date":"2024-11-01","arxiv_id":"2411.00745","repositories_listed":0,"syntology":null},{"url":null,"slug":"investigating-layer-importance-in-large","title":"Investigating Layer Importance in Large Language Models","date":"2024-09-22","arxiv_id":"2409.14381","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploiting-the-data-gap-utilizing-non","title":"Exploiting the Data Gap: Utilizing Non-ignorable Missingness to Manipulate Model Learning","date":"2024-09-06","arxiv_id":"2409.04407","repositories_listed":0,"syntology":null},{"url":null,"slug":"reframing-data-value-for-large-language","title":"Reframing Data Value for Large Language Models Through the Lens of Plausibility","date":"2024-08-30","arxiv_id":"2409.00284","repositories_listed":0,"syntology":null},{"url":null,"slug":"disentangled-structural-and-featural","title":"Disentangled Structural and Featural Representation for Task-Agnostic Graph Valuation","date":"2024-08-22","arxiv_id":"2408.12659","repositories_listed":0,"syntology":null},{"url":null,"slug":"uncertainty-quantification-of-data-shapley","title":"Uncertainty Quantification of Data Shapley via Statistical Inference","date":"2024-07-28","arxiv_id":"2407.19373","repositories_listed":0,"syntology":null},{"url":null,"slug":"personalization-of-dataset-retrieval-results","title":"Personalization of Dataset Retrieval Results using a Metadata-based Data Valuation Method","date":"2024-07-22","arxiv_id":"2407.15546","repositories_listed":0,"syntology":null},{"url":null,"slug":"analyzing-the-influence-of-training-samples","title":"Towards Understanding the Influence of Training Samples on Explanations","date":"2024-06-05","arxiv_id":"2406.03012","repositories_listed":0,"syntology":null},{"url":null,"slug":"is-data-valuation-learnable-and-interpretable","title":"Is Data Valuation Learnable and Interpretable?","date":"2024-06-03","arxiv_id":"2406.02612","repositories_listed":0,"syntology":null},{"url":null,"slug":"truthful-dataset-valuation-by-pointwise","title":"Proper Dataset Valuation by Pointwise Mutual Information","date":"2024-05-28","arxiv_id":"2405.18253","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-valuation-by-leveraging-global-and-local","title":"Data Valuation by Leveraging Global and Local Statistical Information","date":"2024-05-23","arxiv_id":"2405.17464","repositories_listed":0,"syntology":null},{"url":null,"slug":"rethinking-data-shapley-for-data-selection","title":"Rethinking Data Shapley for Data Selection Tasks: Misleads and Merits","date":"2024-05-06","arxiv_id":"2405.03875","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-dynamic-data-valuation","title":"Neural Dynamic Data Valuation","date":"2024-04-30","arxiv_id":"2404.19557","repositories_listed":0,"syntology":null},{"url":null,"slug":"incentives-in-private-collaborative-machine-1","title":"Incentives in Private Collaborative Machine Learning","date":"2024-04-02","arxiv_id":"2404.01676","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-acquisition-via-experimental-design-for","title":"DAVED: Data Acquisition via Experimental Design for Data Markets","date":"2024-03-20","arxiv_id":"2403.13893","repositories_listed":0,"syntology":null},{"url":null,"slug":"vtrust-controllable-value-function-based","title":"VTruST: Controllable value function based subset selection for Data-Centric Trustworthy AI","date":"2024-03-08","arxiv_id":"2403.05174","repositories_listed":0,"syntology":null},{"url":null,"slug":"ecoval-an-efficient-data-valuation-framework","title":"EcoVal: An Efficient Data Valuation Framework for Machine Learning","date":"2024-02-14","arxiv_id":"2402.09288","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-data-shapley-for-weighted-nearest","title":"Efficient Data Shapley for Weighted Nearest Neighbor Algorithms","date":"2024-01-20","arxiv_id":"2401.11103","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-explainable-artificial-intelligence-2","title":"Towards Explainable Artificial Intelligence (XAI): A Data Mining Perspective","date":"2024-01-09","arxiv_id":"2401.04374","repositories_listed":0,"syntology":null},{"url":null,"slug":"load-data-valuation-in-multi-energy-systems","title":"Load Data Valuation in Multi-Energy Systems: An End-to-End Approach","date":"2023-11-16","arxiv_id":"2311.09839","repositories_listed":0,"syntology":null},{"url":null,"slug":"threshold-knn-shapley-a-linear-time-and","title":"Threshold KNN-Shapley: A Linear-Time and Privacy-Friendly Approach to Data Valuation","date":"2023-08-30","arxiv_id":"2308.15709","repositories_listed":0,"syntology":null},{"url":null,"slug":"shapley-value-on-probabilistic-classifiers","title":"Shapley Value on Probabilistic Classifiers","date":"2023-06-12","arxiv_id":"2306.07171","repositories_listed":0,"syntology":null},{"url":null,"slug":"cooperative-iot-data-sharing-with","title":"Cooperative IoT Data Sharing with Heterogeneity of Participants Based on Electricity Retail","date":"2023-05-31","arxiv_id":"2305.20024","repositories_listed":0,"syntology":null},{"url":null,"slug":"new-methods-for-new-data-an-overview-and","title":"New methods for new data? An overview and illustration of quantitative inductive methods for HRM research","date":"2023-05-15","arxiv_id":"2305.08889","repositories_listed":0,"syntology":null},{"url":null,"slug":"matching-based-data-valuation-for-generative","title":"GMValuator: Similarity-based Data Valuation for Generative Models","date":"2023-04-21","arxiv_id":"2304.10701","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimizing-data-shapley-interaction","title":"Optimizing Data Shapley Interaction Calculation from O(2^n) to O(t n^2) for KNN models","date":"2023-04-02","arxiv_id":"2304.01224","repositories_listed":0,"syntology":null},{"url":null,"slug":"fairness-aware-data-valuation-for-supervised","title":"Fairness-Aware Data Valuation for Supervised Learning","date":"2023-03-29","arxiv_id":"2303.16963","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-note-on-towards-efficient-data-valuation","title":"A Note on \"Towards Efficient Data Valuation Based on the Shapley Value''","date":"2023-02-22","arxiv_id":"2302.11431","repositories_listed":0,"syntology":null},{"url":null,"slug":"ipprotect-protecting-the-intellectual","title":"IPProtect: protecting the intellectual property of visual datasets during data valuation","date":"2022-12-22","arxiv_id":"2212.11468","repositories_listed":0,"syntology":null}],"syntology_records":21,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":21,"papers_where_code_ran_first_page":"/task/data-valuation/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":2,"url":"/task/data-valuation/papers/2","json":"/task/data-valuation/papers/2.json","rows":19},{"order":"ran","page":1,"of":1,"url":"/task/data-valuation/papers/ran/1","json":"/task/data-valuation/papers/ran/1.json","rows":21}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"e8d4d62c31e27677188a1cb75e4ec0f35eb256539cda75fb69c230788ed30a05","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}