{"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/dataset-condensation","name":"Dataset Condensation","slug":"dataset-condensation","description_markdown":"Condense the full dataset into a tiny set of synthetic data.","categories":[],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":56,"papers_with_code":35,"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":0,"parent_tasks":0},"benchmarks":[],"datasets":[],"subtasks":[],"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":1,"rows_per_page":100,"shown":56,"of":56,"of_with_code":35,"tagged_in_all":56,"counts":{"archive_papers_tagged":56,"with_a_code_link":35,"where_syntology_ran_a_sample":19,"not_listed_spam_title":0,"listed":56,"listed_where_code_ran":19,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":12,"every_run_a_failure_of_syntologys_instrument":7,"listed_with_a_run_with_no_instrument_failure":12,"listed_every_run_a_failure_of_syntologys_instrument":7,"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/dataset-condensation-with-gradient-matching","slug":"dataset-condensation-with-gradient-matching","title":"Dataset Condensation with Gradient Matching","date":"2020-06-10","arxiv_id":"2006.05929","repositories_listed":5,"syntology":null},{"url":"/paper/dataset-condensation-with-distribution","slug":"dataset-condensation-with-distribution","title":"Dataset Condensation with Distribution Matching","date":"2021-10-08","arxiv_id":"2110.04181","repositories_listed":4,"syntology":null},{"url":"/paper/generalized-large-scale-data-condensation-via","slug":"generalized-large-scale-data-condensation-via","title":"Generalized Large-Scale Data Condensation via Various Backbone and Statistical Matching","date":"2023-11-29","arxiv_id":"2311.17950","repositories_listed":3,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":0,"n_instrument":5,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"5 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; 5 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/generalized-large-scale-data-condensation-via#ran","syntology_url":"https://syntology.ai/paper/2311.17950","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.17950"}},"official":{"repos":["shaoshitong/G_VBSM_Dataset_Condensation"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/condensing-graphs-via-one-step-gradient","slug":"condensing-graphs-via-one-step-gradient","title":"Condensing Graphs via One-Step Gradient Matching","date":"2022-06-15","arxiv_id":"2206.07746","repositories_listed":3,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/condensing-graphs-via-one-step-gradient#ran","syntology_url":"https://syntology.ai/paper/2206.07746","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.07746"}},"official":{"repos":["amazon-research/doscond"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/synthesizing-informative-training-samples","slug":"synthesizing-informative-training-samples","title":"Synthesizing Informative Training Samples with GAN","date":"2022-04-15","arxiv_id":"2204.07513","repositories_listed":3,"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":7,"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/synthesizing-informative-training-samples#ran","syntology_url":"https://syntology.ai/paper/2204.07513","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.07513"}},"official":{"repos":["vico-uoe/it-gan"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/echo-efficient-dataset-condensation-by-higher","slug":"echo-efficient-dataset-condensation-by-higher","title":"M3D: Dataset Condensation by Minimizing Maximum Mean Discrepancy","date":"2023-12-26","arxiv_id":"2312.15927","repositories_listed":2,"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/echo-efficient-dataset-condensation-by-higher#ran","syntology_url":"https://syntology.ai/paper/2312.15927","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.15927"}},"official":{"repos":["hansong-zhang/m3d"],"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/improved-distribution-matching-for-dataset-1","slug":"improved-distribution-matching-for-dataset-1","title":"Improved Distribution Matching for Dataset Condensation","date":"2023-07-19","arxiv_id":"2307.09742","repositories_listed":2,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":2,"n_instrument":8,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":13,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 8 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/improved-distribution-matching-for-dataset-1#ran","syntology_url":"https://syntology.ai/paper/2307.09742","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.09742"}},"official":{"repos":["uitrbn/idm"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/squeeze-recover-and-relabel-dataset","slug":"squeeze-recover-and-relabel-dataset","title":"Squeeze, Recover and Relabel: Dataset Condensation at ImageNet Scale From A New Perspective","date":"2023-06-22","arxiv_id":"2306.13092","repositories_listed":2,"syntology":{"n":6,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"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) · 5 unverified","sample_list":"/paper/squeeze-recover-and-relabel-dataset#ran","syntology_url":"https://syntology.ai/paper/2306.13092","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.13092"}},"official":{"repos":["VILA-Lab/SRe2L"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["listed"]}}},{"url":"/paper/efficient-dataset-distillation-using-random","slug":"efficient-dataset-distillation-using-random","title":"Efficient Dataset Distillation Using Random Feature Approximation","date":"2022-10-21","arxiv_id":"2210.12067","repositories_listed":2,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"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) · 1 unverified","sample_list":"/paper/efficient-dataset-distillation-using-random#ran","syntology_url":"https://syntology.ai/paper/2210.12067","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.12067"}},"official":{"repos":["yolky/rfad"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/dc-bench-dataset-condensation-benchmark","slug":"dc-bench-dataset-condensation-benchmark","title":"DC-BENCH: Dataset Condensation Benchmark","date":"2022-07-20","arxiv_id":"2207.09639","repositories_listed":2,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":3,"n_no_contract":3,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 3 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/dc-bench-dataset-condensation-benchmark#ran","syntology_url":"https://syntology.ai/paper/2207.09639","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.09639"}},"official":{"repos":["justincui03/dc_benchmark"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/dataset-condensation-via-efficient-synthetic","slug":"dataset-condensation-via-efficient-synthetic","title":"Dataset Condensation via Efficient Synthetic-Data Parameterization","date":"2022-05-30","arxiv_id":"2205.14959","repositories_listed":2,"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/dataset-condensation-via-efficient-synthetic#ran","syntology_url":"https://syntology.ai/paper/2205.14959","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.14959"}},"official":{"repos":["snu-mllab/efficient-dataset-condensation"],"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/cafe-learning-to-condense-dataset-by-aligning","slug":"cafe-learning-to-condense-dataset-by-aligning","title":"CAFE: Learning to Condense Dataset by Aligning Features","date":"2022-03-03","arxiv_id":"2203.01531","repositories_listed":2,"syntology":{"n":33,"n_ran":27,"n_constructed":8,"n_ran_checked":9,"n_instrument":18,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":8,"n_pointer_only":33,"phrase":"27 ran (of which 8 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 18 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/cafe-learning-to-condense-dataset-by-aligning#ran","syntology_url":"https://syntology.ai/paper/2203.01531","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.01531"}},"official":{"repos":["kaiwang960112/cafe"],"state":"official (archive's flag): 27 ran","n_ran":27,"n_constructed":8,"n_ran_no_instrument_failure":9,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/dataset-condensation-with-contrastive-signals","slug":"dataset-condensation-with-contrastive-signals","title":"Dataset Condensation with Contrastive Signals","date":"2022-02-07","arxiv_id":"2202.02916","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"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; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/dataset-condensation-with-contrastive-signals#ran","syntology_url":"https://syntology.ai/paper/2202.02916","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.02916"}},"official":{"repos":["saehyung-lee/dcc"],"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/dataset-condensation-with-differentiable","slug":"dataset-condensation-with-differentiable","title":"Dataset Condensation with Differentiable Siamese Augmentation","date":"2021-02-16","arxiv_id":"2102.08259","repositories_listed":2,"syntology":null},{"url":"/paper/a-large-scale-study-on-video-action-dataset","slug":"a-large-scale-study-on-video-action-dataset","title":"A Large-Scale Study on Video Action Dataset Condensation","date":"2024-12-30","arxiv_id":"2412.21197","repositories_listed":1,"syntology":{"n":17,"n_ran":13,"n_constructed":0,"n_ran_checked":10,"n_instrument":3,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":3,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 3 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/a-large-scale-study-on-video-action-dataset#ran","syntology_url":"https://syntology.ai/paper/2412.21197","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.21197"}},"official":{"repos":["mcg-nju/video-dc"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/bi-directional-multi-scale-graph-dataset","slug":"bi-directional-multi-scale-graph-dataset","title":"Bi-Directional Multi-Scale Graph Dataset Condensation via Information Bottleneck","date":"2024-12-23","arxiv_id":"2412.17355","repositories_listed":1,"syntology":null},{"url":"/paper/decomposed-distribution-matching-in-dataset","slug":"decomposed-distribution-matching-in-dataset","title":"Decomposed Distribution Matching in Dataset Condensation","date":"2024-12-06","arxiv_id":"2412.04748","repositories_listed":1,"syntology":null},{"url":"/paper/towards-model-agnostic-dataset-condensation","slug":"towards-model-agnostic-dataset-condensation","title":"Towards Model-Agnostic Dataset Condensation by Heterogeneous Models","date":"2024-09-22","arxiv_id":"2409.14538","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":0,"n_instrument":6,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":9,"phrase":"6 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; 6 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/towards-model-agnostic-dataset-condensation#ran","syntology_url":"https://syntology.ai/paper/2409.14538","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.14538"}},"official":{"repos":["khu-agi/hmdc"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/ameliorate-spurious-correlations-in-dataset","slug":"ameliorate-spurious-correlations-in-dataset","title":"Mitigating Bias in Dataset Distillation","date":"2024-06-06","arxiv_id":"2406.06609","repositories_listed":1,"syntology":null},{"url":"/paper/condtsf-one-line-plugin-of-dataset","slug":"condtsf-one-line-plugin-of-dataset","title":"CondTSF: One-line Plugin of Dataset Condensation for Time Series Forecasting","date":"2024-06-04","arxiv_id":"2406.02131","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/condtsf-one-line-plugin-of-dataset#ran","syntology_url":"https://syntology.ai/paper/2406.02131","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.02131"}},"official":{"repos":["rafadd/condtsf"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/dance-dual-view-distribution-alignment-for","slug":"dance-dual-view-distribution-alignment-for","title":"DANCE: Dual-View Distribution Alignment for Dataset Condensation","date":"2024-06-03","arxiv_id":"2406.01063","repositories_listed":1,"syntology":{"n":18,"n_ran":16,"n_constructed":0,"n_ran_checked":4,"n_instrument":12,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":18,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 12 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/dance-dual-view-distribution-alignment-for#ran","syntology_url":"https://syntology.ai/paper/2406.01063","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.01063"}},"official":{"repos":["hansong-zhang/dance"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/elucidating-the-design-space-of-dataset","slug":"elucidating-the-design-space-of-dataset","title":"Elucidating the Design Space of Dataset Condensation","date":"2024-04-21","arxiv_id":"2404.13733","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/elucidating-the-design-space-of-dataset#ran","syntology_url":"https://syntology.ai/paper/2404.13733","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.13733"}},"official":{"repos":["shaoshitong/EDC"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["community"]}}},{"url":"/paper/distilling-datasets-into-less-than-one-image","slug":"distilling-datasets-into-less-than-one-image","title":"Distilling Datasets Into Less Than One Image","date":"2024-03-18","arxiv_id":"2403.12040","repositories_listed":1,"syntology":null},{"url":"/paper/dataset-condensation-for-time-series","slug":"dataset-condensation-for-time-series","title":"Dataset Condensation for Time Series Classification via Dual Domain Matching","date":"2024-03-12","arxiv_id":"2403.07245","repositories_listed":1,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":9,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/dataset-condensation-for-time-series#ran","syntology_url":"https://syntology.ai/paper/2403.07245","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.07245"}},"official":{"repos":["zhyliu00/TimeSeriesCond"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/multisize-dataset-condensation","slug":"multisize-dataset-condensation","title":"Multisize Dataset Condensation","date":"2024-03-10","arxiv_id":"2403.06075","repositories_listed":1,"syntology":{"n":19,"n_ran":17,"n_constructed":0,"n_ran_checked":6,"n_instrument":11,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":4,"n_pointer_only":15,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 1 violated, 4 with no contract checked; 11 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/multisize-dataset-condensation#ran","syntology_url":"https://syntology.ai/paper/2403.06075","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.06075"}},"official":{"repos":["he-y/multisize-dataset-condensation"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/is-adversarial-training-with-compressed","slug":"is-adversarial-training-with-compressed","title":"Is Adversarial Training with Compressed Datasets Effective?","date":"2024-02-08","arxiv_id":"2402.05675","repositories_listed":1,"syntology":null},{"url":"/paper/dataset-condensation-driven-machine","slug":"dataset-condensation-driven-machine","title":"Dataset Condensation Driven Machine Unlearning","date":"2024-01-31","arxiv_id":"2402.00195","repositories_listed":1,"syntology":null},{"url":"/paper/you-only-condense-once-two-rules-for-pruning-1","slug":"you-only-condense-once-two-rules-for-pruning-1","title":"You Only Condense Once: Two Rules for Pruning Condensed Datasets","date":"2023-10-21","arxiv_id":"2310.14019","repositories_listed":1,"syntology":{"n":16,"n_ran":13,"n_constructed":0,"n_ran_checked":5,"n_instrument":8,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":16,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 8 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/you-only-condense-once-two-rules-for-pruning-1#ran","syntology_url":"https://syntology.ai/paper/2310.14019","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.14019"}},"official":{"repos":["he-y/you-only-condense-once"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/fast-graph-condensation-with-structure-based","slug":"fast-graph-condensation-with-structure-based","title":"Fast Graph Condensation with Structure-based Neural Tangent Kernel","date":"2023-10-17","arxiv_id":"2310.11046","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":7,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fast-graph-condensation-with-structure-based#ran","syntology_url":"https://syntology.ai/paper/2310.11046","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.11046"}},"official":{"repos":["wanglin0126/gcsntk"],"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/dataset-condensation-for-recommendation","slug":"dataset-condensation-for-recommendation","title":"Dataset Condensation for Recommendation","date":"2023-10-02","arxiv_id":"2310.01038","repositories_listed":1,"syntology":null},{"url":"/paper/constructing-bayesian-pseudo-coresets-using","slug":"constructing-bayesian-pseudo-coresets-using","title":"Bayesian Pseudo-Coresets via Contrastive Divergence","date":"2023-03-20","arxiv_id":"2303.11278","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 2 unverified","sample_list":"/paper/constructing-bayesian-pseudo-coresets-using#ran","syntology_url":"https://syntology.ai/paper/2303.11278","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.11278"}},"official":{"repos":["backpropagator/bpc-cd"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/dataset-distillation-a-comprehensive-review","slug":"dataset-distillation-a-comprehensive-review","title":"Dataset Distillation: A Comprehensive Review","date":"2023-01-17","arxiv_id":"2301.07014","repositories_listed":1,"syntology":null},{"url":"/paper/dataset-condensation-with-latent-space","slug":"dataset-condensation-with-latent-space","title":"Dataset Condensation with Latent Space Knowledge Factorization and Sharing","date":"2022-08-21","arxiv_id":"2208.10494","repositories_listed":1,"syntology":null},{"url":"/paper/delving-into-effective-gradient-matching-for","slug":"delving-into-effective-gradient-matching-for","title":"Delving into Effective Gradient Matching for Dataset Condensation","date":"2022-07-30","arxiv_id":"2208.00311","repositories_listed":1,"syntology":null},{"url":"/paper/privacy-for-free-how-does-dataset","slug":"privacy-for-free-how-does-dataset","title":"Privacy for Free: How does Dataset Condensation Help Privacy?","date":"2022-06-01","arxiv_id":"2206.00240","repositories_listed":1,"syntology":null},{"url":null,"slug":"diffusion-dataset-condensation-training-your","title":"Diffusion Dataset Condensation: Training Your Diffusion Model Faster with Less Data","date":"2025-07-08","arxiv_id":"2507.05914","repositories_listed":0,"syntology":null},{"url":null,"slug":"video-dataset-condensation-with-diffusion","title":"Video Dataset Condensation with Diffusion Models","date":"2025-05-10","arxiv_id":"2505.06670","repositories_listed":0,"syntology":null},{"url":null,"slug":"score-soft-label-compression-centric-dataset","title":"SCORE: Soft Label Compression-Centric Dataset Condensation via Coding Rate Optimization","date":"2025-03-18","arxiv_id":"2503.13935","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-generalization-via-sharpness-aware","title":"Enhancing Generalization via Sharpness-Aware Trajectory Matching for Dataset Condensation","date":"2025-02-03","arxiv_id":"2502.01865","repositories_listed":0,"syntology":null},{"url":null,"slug":"diffusion-augmented-coreset-expansion-for","title":"Diffusion-Augmented Coreset Expansion for Scalable Dataset Distillation","date":"2024-12-05","arxiv_id":"2412.04668","repositories_listed":0,"syntology":null},{"url":null,"slug":"dataset-condensation-with-latent-quantile","title":"Dataset Condensation with Latent Quantile Matching","date":"2024-06-14","arxiv_id":"2406.09860","repositories_listed":0,"syntology":null},{"url":null,"slug":"calibrated-dataset-condensation-for-faster","title":"Calibrated Dataset Condensation for Faster Hyperparameter Search","date":"2024-05-27","arxiv_id":"2405.17535","repositories_listed":0,"syntology":null},{"url":null,"slug":"spectral-greedy-coresets-for-graph-neural","title":"Spectral Greedy Coresets for Graph Neural Networks","date":"2024-05-27","arxiv_id":"2405.17404","repositories_listed":0,"syntology":null},{"url":null,"slug":"koopcon-a-new-approach-towards-smarter-and","title":"Koopcon: A new approach towards smarter and less complex learning","date":"2024-05-22","arxiv_id":"2405.13866","repositories_listed":0,"syntology":null},{"url":null,"slug":"connect-the-dots-dataset-condensation","title":"Connect the dots: Dataset Condensation, Differential Privacy, and Adversarial Uncertainty","date":"2024-02-16","arxiv_id":"2402.10423","repositories_listed":0,"syntology":null},{"url":null,"slug":"dcfl-non-iid-awareness-data-condensation","title":"DCFL: Non-IID awareness Data Condensation aided Federated Learning","date":"2023-12-21","arxiv_id":"2312.14219","repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-large-language-models-llms-to","title":"TF-DCon: Leveraging Large Language Models (LLMs) to Empower Training-Free Dataset Condensation for Content-Based Recommendation","date":"2023-10-15","arxiv_id":"2310.09874","repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-hierarchical-feature-sharing-for","title":"Leveraging Hierarchical Feature Sharing for Efficient Dataset Condensation","date":"2023-10-11","arxiv_id":"2310.07506","repositories_listed":0,"syntology":null},{"url":null,"slug":"dataset-condensation-via-generative-model","title":"Dataset Condensation via Generative Model","date":"2023-09-14","arxiv_id":"2309.07698","repositories_listed":0,"syntology":null},{"url":null,"slug":"revisiting-permutation-symmetry-for-merging","title":"Revisiting Permutation Symmetry for Merging Models between Different Datasets","date":"2023-06-09","arxiv_id":"2306.05641","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-efficient-deep-hashing-retrieval","title":"Towards Efficient Deep Hashing Retrieval: Condensing Your Data via Feature-Embedding Matching","date":"2023-05-29","arxiv_id":"2305.18076","repositories_listed":0,"syntology":null},{"url":null,"slug":"is-dataset-condensation-a-silver-bullet-for","title":"Medical records condensation: a roadmap towards healthcare data democratisation","date":"2023-05-05","arxiv_id":"2305.03711","repositories_listed":0,"syntology":null},{"url":null,"slug":"robustness-preserving-lifelong-learning-via","title":"Robustness-preserving Lifelong Learning via Dataset Condensation","date":"2023-03-07","arxiv_id":"2303.04183","repositories_listed":0,"syntology":null},{"url":null,"slug":"slimmable-dataset-condensation","title":"Slimmable Dataset Condensation","date":"2023-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"no-free-lunch-in-privacy-for-free-how-does","title":"No Free Lunch in \"Privacy for Free: How does Dataset Condensation Help Privacy\"","date":"2022-09-29","arxiv_id":"2209.14987","repositories_listed":0,"syntology":null},{"url":null,"slug":"when-less-is-more-simplifying-inputs-aids-1","title":"When less is more: Simplifying inputs aids neural network understanding","date":"2022-01-14","arxiv_id":"2201.05610","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":19,"papers_where_code_ran_first_page":"/task/dataset-condensation/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":"ran","page":1,"of":1,"url":"/task/dataset-condensation/papers/ran/1","json":"/task/dataset-condensation/papers/ran/1.json","rows":19}],"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":"3aef59e7d47271164324debd2d319e579f38fd2ab7be6ae67a069415edb748dc","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}