{"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/memorization/papers/ran/2","list_of":"/task/memorization","task":"Memorization","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","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.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":2,"pages_in_order":2,"rows_per_page":100,"rows":[101,177],"of":177,"counts":{"archive_papers_tagged":1088,"with_a_code_link":438,"where_syntology_ran_a_sample":177,"not_listed_spam_title":0,"listed":1088,"listed_where_code_ran":177,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":148,"every_run_a_failure_of_syntologys_instrument":29,"listed_with_a_run_with_no_instrument_failure":148,"listed_every_run_a_failure_of_syntologys_instrument":29,"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"},"first_page":"/task/memorization/papers/ran/1","prev":"/task/memorization/papers/ran/1","next":null,"papers":[{"url":"/paper/generalization-in-diffusion-models-arises","slug":"generalization-in-diffusion-models-arises","title":"Generalization in diffusion models arises from geometry-adaptive harmonic representations","date":"2023-10-04","arxiv_id":"2310.02557","repositories_listed":1,"syntology":{"n":16,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/generalization-in-diffusion-models-arises#ran","syntology_url":"https://syntology.ai/paper/2310.02557","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.02557"}},"official":{"repos":["labforcomputationalvision/memorization_generalization_in_diffusion_models"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/on-memorization-in-diffusion-models","slug":"on-memorization-in-diffusion-models","title":"On Memorization in Diffusion Models","date":"2023-10-04","arxiv_id":"2310.02664","repositories_listed":2,"syntology":{"n":14,"n_ran":10,"n_constructed":0,"n_ran_checked":6,"n_instrument":4,"n_unverified":4,"n_honours":2,"n_violates":0,"n_no_contract":4,"n_pointer_only":5,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 2 honoured, 0 violated, 4 with no contract checked; 4 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/on-memorization-in-diffusion-models#ran","syntology_url":"https://syntology.ai/paper/2310.02664","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.02664"}},"official":{"repos":["sail-sg/DiffMemorize"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/automatikz-text-guided-synthesis-of","slug":"automatikz-text-guided-synthesis-of","title":"AutomaTikZ: Text-Guided Synthesis of Scientific Vector Graphics with TikZ","date":"2023-09-30","arxiv_id":"2310.00367","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 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) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/automatikz-text-guided-synthesis-of#ran","syntology_url":"https://syntology.ai/paper/2310.00367","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.00367"}},"official":{"repos":["potamides/automatikz"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/on-memorization-and-privacy-risks-of","slug":"on-memorization-and-privacy-risks-of","title":"On Memorization and Privacy Risks of Sharpness Aware Minimization","date":"2023-09-30","arxiv_id":"2310.00488","repositories_listed":0,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"7 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/on-memorization-and-privacy-risks-of#ran","syntology_url":"https://syntology.ai/paper/2310.00488","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.00488"}},"official":null}},{"url":"/paper/leave-one-out-distinguishability-in-machine","slug":"leave-one-out-distinguishability-in-machine","title":"Leave-one-out Distinguishability in Machine Learning","date":"2023-09-29","arxiv_id":"2309.17310","repositories_listed":2,"syntology":{"n":16,"n_ran":11,"n_constructed":1,"n_ran_checked":7,"n_instrument":4,"n_unverified":5,"n_honours":3,"n_violates":3,"n_no_contract":1,"n_pointer_only":0,"phrase":"11 ran (of which 1 constructed an object rather than computing a result; 7 with no instrument failure: 3 honoured, 3 violated, 1 with no contract checked; 4 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/leave-one-out-distinguishability-in-machine#ran","syntology_url":"https://syntology.ai/paper/2309.17310","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.17310"}},"official":{"repos":["privacytrustlab/lood_in_ml"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/lawbench-benchmarking-legal-knowledge-of","slug":"lawbench-benchmarking-legal-knowledge-of","title":"LawBench: Benchmarking Legal Knowledge of Large Language Models","date":"2023-09-28","arxiv_id":"2309.16289","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/lawbench-benchmarking-legal-knowledge-of#ran","syntology_url":"https://syntology.ai/paper/2309.16289","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.16289"}},"official":{"repos":["open-compass/lawbench"],"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/2309-05936","slug":"2309-05936","title":"Do PLMs Know and Understand Ontological Knowledge?","date":"2023-09-12","arxiv_id":"2309.05936","repositories_listed":1,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":12,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/2309-05936#ran","syntology_url":"https://syntology.ai/paper/2309.05936","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.05936"}},"official":{"repos":["vickywu1022/ontoprobe-plms"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/a-probabilistic-fluctuation-based-membership","slug":"a-probabilistic-fluctuation-based-membership","title":"A Probabilistic Fluctuation based Membership Inference Attack for Diffusion Models","date":"2023-08-23","arxiv_id":"2308.12143","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/a-probabilistic-fluctuation-based-membership#ran","syntology_url":"https://syntology.ai/paper/2308.12143","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.12143"}},"official":{"repos":["wjfu99/mia-gen"],"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/can-neural-network-memorization-be-localized","slug":"can-neural-network-memorization-be-localized","title":"Can Neural Network Memorization Be Localized?","date":"2023-07-18","arxiv_id":"2307.09542","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 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; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/can-neural-network-memorization-be-localized#ran","syntology_url":"https://syntology.ai/paper/2307.09542","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.09542"}},"official":{"repos":["pratyushmaini/localizing-memorization"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/an-empirical-investigation-of-pre-trained-1","slug":"an-empirical-investigation-of-pre-trained-1","title":"An Empirical Study of Pre-trained Model Selection for Out-of-Distribution Generalization and Calibration","date":"2023-07-17","arxiv_id":"2307.08187","repositories_listed":1,"syntology":{"n":15,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"8 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; 2 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/an-empirical-investigation-of-pre-trained-1#ran","syntology_url":"https://syntology.ai/paper/2307.08187","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.08187"}},"official":{"repos":["hiroki11x/timm_ood_calibration"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/in-context-autoencoder-for-context","slug":"in-context-autoencoder-for-context","title":"In-context Autoencoder for Context Compression in a Large Language Model","date":"2023-07-13","arxiv_id":"2307.06945","repositories_listed":2,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/in-context-autoencoder-for-context#ran","syntology_url":"https://syntology.ai/paper/2307.06945","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.06945"}},"official":{"repos":["getao/icae"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/how-to-detect-unauthorized-data-usages-in","slug":"how-to-detect-unauthorized-data-usages-in","title":"DIAGNOSIS: Detecting Unauthorized Data Usages in Text-to-image Diffusion Models","date":"2023-07-06","arxiv_id":"2307.03108","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":1,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/how-to-detect-unauthorized-data-usages-in#ran","syntology_url":"https://syntology.ai/paper/2307.03108","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.03108"}},"official":{"repos":["zhentingwang/diagnosis"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/exposing-flaws-of-generative-model-evaluation-1","slug":"exposing-flaws-of-generative-model-evaluation-1","title":"Exposing flaws of generative model evaluation metrics and their unfair treatment of diffusion models","date":"2023-06-07","arxiv_id":"2306.04675","repositories_listed":4,"syntology":{"n":63,"n_ran":53,"n_constructed":0,"n_ran_checked":34,"n_instrument":19,"n_unverified":10,"n_honours":6,"n_violates":1,"n_no_contract":27,"n_pointer_only":12,"phrase":"53 ran (of which 0 constructed an object rather than computing a result; 34 with no instrument failure: 6 honoured, 1 violated, 27 with no contract checked; 19 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/exposing-flaws-of-generative-model-evaluation-1#ran","syntology_url":"https://syntology.ai/paper/2306.04675","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.04675"}},"official":{"repos":["layer6ai-labs/dgm-eval"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["found_in_text","official","unlocated"]}}},{"url":"/paper/exploring-model-dynamics-for-accumulative","slug":"exploring-model-dynamics-for-accumulative","title":"Exploring Model Dynamics for Accumulative Poisoning Discovery","date":"2023-06-06","arxiv_id":"2306.03726","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":0,"n_instrument":6,"n_unverified":1,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 6 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/exploring-model-dynamics-for-accumulative#ran","syntology_url":"https://syntology.ai/paper/2306.03726","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.03726"}},"official":{"repos":["tmlr-group/memorization-discrepancy"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/brain-tumor-segmentation-using-synthetic-mr","slug":"brain-tumor-segmentation-using-synthetic-mr","title":"Brain tumor segmentation using synthetic MR images -- A comparison of GANs and diffusion models","date":"2023-06-05","arxiv_id":"2306.02986","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/brain-tumor-segmentation-using-synthetic-mr#ran","syntology_url":"https://syntology.ai/paper/2306.02986","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.02986"}},"official":{"repos":["muhamadusman/assist"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/understanding-and-mitigating-copying-in-1","slug":"understanding-and-mitigating-copying-in-1","title":"Understanding and Mitigating Copying in Diffusion Models","date":"2023-05-31","arxiv_id":"2305.20086","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":0,"n_instrument":5,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"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) · 1 unverified","sample_list":"/paper/understanding-and-mitigating-copying-in-1#ran","syntology_url":"https://syntology.ai/paper/2305.20086","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.20086"}},"official":{"repos":["somepago/dcr"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/knowledge-augmented-reasoning-distillation-1","slug":"knowledge-augmented-reasoning-distillation-1","title":"Knowledge-Augmented Reasoning Distillation for Small Language Models in Knowledge-Intensive Tasks","date":"2023-05-28","arxiv_id":"2305.18395","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/knowledge-augmented-reasoning-distillation-1#ran","syntology_url":"https://syntology.ai/paper/2305.18395","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.18395"}},"official":{"repos":["nardien/kard"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a-causal-view-of-entity-bias-in-large","slug":"a-causal-view-of-entity-bias-in-large","title":"A Causal View of Entity Bias in (Large) Language Models","date":"2023-05-24","arxiv_id":"2305.14695","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-causal-view-of-entity-bias-in-large#ran","syntology_url":"https://syntology.ai/paper/2305.14695","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.14695"}},"official":{"repos":["luka-group/causal-view-of-entity-bias"],"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/causal-reasoning-and-large-language-models","slug":"causal-reasoning-and-large-language-models","title":"Causal Reasoning and Large Language Models: Opening a New Frontier for Causality","date":"2023-04-28","arxiv_id":"2305.00050","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/causal-reasoning-and-large-language-models#ran","syntology_url":"https://syntology.ai/paper/2305.00050","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.00050"}},"official":{"repos":["py-why/pywhy-llm"],"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/speak-memory-an-archaeology-of-books-known-to","slug":"speak-memory-an-archaeology-of-books-known-to","title":"Speak, Memory: An Archaeology of Books Known to ChatGPT/GPT-4","date":"2023-04-28","arxiv_id":"2305.00118","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":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/speak-memory-an-archaeology-of-books-known-to#ran","syntology_url":"https://syntology.ai/paper/2305.00118","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.00118"}},"official":{"repos":["bamman-group/gpt4-books"],"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/do-ssl-models-have-deja-vu-a-case-of-1","slug":"do-ssl-models-have-deja-vu-a-case-of-1","title":"Do SSL Models Have Déjà Vu? A Case of Unintended Memorization in Self-supervised Learning","date":"2023-04-26","arxiv_id":"2304.13850","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"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: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/do-ssl-models-have-deja-vu-a-case-of-1#ran","syntology_url":"https://syntology.ai/paper/2304.13850","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.13850"}},"official":{"repos":["facebookresearch/dejavu"],"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/emergent-and-predictable-memorization-in-1","slug":"emergent-and-predictable-memorization-in-1","title":"Emergent and Predictable Memorization in Large Language Models","date":"2023-04-21","arxiv_id":"2304.11158","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/emergent-and-predictable-memorization-in-1#ran","syntology_url":"https://syntology.ai/paper/2304.11158","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.11158"}},"official":{"repos":["eleutherai/gpt-neox","eleutherai/pythia"],"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/c-sfda-a-curriculum-learning-aided-self","slug":"c-sfda-a-curriculum-learning-aided-self","title":"C-SFDA: A Curriculum Learning Aided Self-Training Framework for Efficient Source Free Domain Adaptation","date":"2023-03-30","arxiv_id":"2303.17132","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":2,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/c-sfda-a-curriculum-learning-aided-self#ran","syntology_url":"https://syntology.ai/paper/2303.17132","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.17132"}},"official":{"repos":["nazmul-karim170/C-SFDA_Source-Free-Domain-Adaptation"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/koala-an-index-for-quantifying-overlaps-with","slug":"koala-an-index-for-quantifying-overlaps-with","title":"Koala: An Index for Quantifying Overlaps with Pre-training Corpora","date":"2023-03-26","arxiv_id":"2303.14770","repositories_listed":0,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/koala-an-index-for-quantifying-overlaps-with#ran","syntology_url":"https://syntology.ai/paper/2303.14770","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.14770"}},"official":null}},{"url":"/paper/where-we-are-and-what-we-re-looking-at-query","slug":"where-we-are-and-what-we-re-looking-at-query","title":"Where We Are and What We're Looking At: Query Based Worldwide Image Geo-localization Using Hierarchies and Scenes","date":"2023-03-07","arxiv_id":"2303.04249","repositories_listed":0,"syntology":{"n":23,"n_ran":17,"n_constructed":11,"n_ran_checked":15,"n_instrument":2,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":23,"phrase":"17 ran (of which 11 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 2 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/where-we-are-and-what-we-re-looking-at-query#ran","syntology_url":"https://syntology.ai/paper/2303.04249","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.04249"}},"official":null}},{"url":"/paper/what-makes-a-language-easy-to-deep-learn","slug":"what-makes-a-language-easy-to-deep-learn","title":"What makes a language easy to deep-learn? Deep neural networks and humans similarly benefit from compositional structure","date":"2023-02-23","arxiv_id":"2302.12239","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"5 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; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/what-makes-a-language-easy-to-deep-learn#ran","syntology_url":"https://syntology.ai/paper/2302.12239","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.12239"}},"official":{"repos":["lgalke/easy2deeplearn"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/progress-measures-for-grokking-via","slug":"progress-measures-for-grokking-via","title":"Progress measures for grokking via mechanistic interpretability","date":"2023-01-12","arxiv_id":"2301.05217","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"1 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; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/progress-measures-for-grokking-via#ran","syntology_url":"https://syntology.ai/paper/2301.05217","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.05217"}},"official":{"repos":["mechanistic-interpretability-grokking/progress-measures-paper"],"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/odim-an-efficient-method-to-detect-outliers","slug":"odim-an-efficient-method-to-detect-outliers","title":"ODIM: Outlier Detection via Likelihood of Under-Fitted Generative Models","date":"2023-01-11","arxiv_id":"2301.04257","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"7 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; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/odim-an-efficient-method-to-detect-outliers#ran","syntology_url":"https://syntology.ai/paper/2301.04257","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.04257"}},"official":{"repos":["jshwang0311/odim"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text"]}}},{"url":"/paper/bygpt5-end-to-end-style-conditioned-poetry","slug":"bygpt5-end-to-end-style-conditioned-poetry","title":"ByGPT5: End-to-End Style-conditioned Poetry Generation with Token-free Language Models","date":"2022-12-20","arxiv_id":"2212.10474","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/bygpt5-end-to-end-style-conditioned-poetry#ran","syntology_url":"https://syntology.ai/paper/2212.10474","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.10474"}},"official":{"repos":["potamides/uniformers"],"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":["official"]}}},{"url":"/paper/when-not-to-trust-language-models","slug":"when-not-to-trust-language-models","title":"When Not to Trust Language Models: Investigating Effectiveness of Parametric and Non-Parametric Memories","date":"2022-12-20","arxiv_id":"2212.10511","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/when-not-to-trust-language-models#ran","syntology_url":"https://syntology.ai/paper/2212.10511","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.10511"}},"official":{"repos":["alextmallen/adaptive-retrieval"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/leveraging-unlabeled-data-to-track","slug":"leveraging-unlabeled-data-to-track","title":"Leveraging Unlabeled Data to Track Memorization","date":"2022-12-08","arxiv_id":"2212.04461","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/leveraging-unlabeled-data-to-track#ran","syntology_url":"https://syntology.ai/paper/2212.04461","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.04461"}},"official":{"repos":["mahf93/tracking-memorization"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/ds-1000-a-natural-and-reliable-benchmark-for","slug":"ds-1000-a-natural-and-reliable-benchmark-for","title":"DS-1000: A Natural and Reliable Benchmark for Data Science Code Generation","date":"2022-11-18","arxiv_id":"2211.11501","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/ds-1000-a-natural-and-reliable-benchmark-for#ran","syntology_url":"https://syntology.ai/paper/2211.11501","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.11501"}},"official":{"repos":["HKUNLP/DS-1000"],"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/fregan-exploiting-frequency-components-for","slug":"fregan-exploiting-frequency-components-for","title":"FreGAN: Exploiting Frequency Components for Training GANs under Limited Data","date":"2022-10-11","arxiv_id":"2210.05461","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":2,"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/fregan-exploiting-frequency-components-for#ran","syntology_url":"https://syntology.ai/paper/2210.05461","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.05461"}},"official":{"repos":["kobeshegu/fregan_neurips2022"],"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/on-the-privacy-effect-of-data-enhancement-via","slug":"on-the-privacy-effect-of-data-enhancement-via","title":"On the Privacy Effect of Data Enhancement via the Lens of Memorization","date":"2022-08-17","arxiv_id":"2208.08270","repositories_listed":1,"syntology":{"n":17,"n_ran":14,"n_constructed":0,"n_ran_checked":13,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":1,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/on-the-privacy-effect-of-data-enhancement-via#ran","syntology_url":"https://syntology.ai/paper/2208.08270","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.08270"}},"official":{"repos":["lixiaothu/privacy_and_aug"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-better-evaluation-for-dynamic-link","slug":"towards-better-evaluation-for-dynamic-link","title":"Towards Better Evaluation for Dynamic Link Prediction","date":"2022-07-20","arxiv_id":"2207.10128","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-better-evaluation-for-dynamic-link#ran","syntology_url":"https://syntology.ai/paper/2207.10128","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.10128"}},"official":{"repos":["fpour/dgb"],"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":["official"]}}},{"url":"/paper/beyond-the-imitation-game-quantifying-and","slug":"beyond-the-imitation-game-quantifying-and","title":"Beyond the Imitation Game: Quantifying and extrapolating the capabilities of language models","date":"2022-06-09","arxiv_id":"2206.04615","repositories_listed":6,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/beyond-the-imitation-game-quantifying-and#ran","syntology_url":"https://syntology.ai/paper/2206.04615","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.04615"}},"official":{"repos":["google/BIG-bench"],"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/large-loss-matters-in-weakly-supervised-multi-1","slug":"large-loss-matters-in-weakly-supervised-multi-1","title":"Large Loss Matters in Weakly Supervised Multi-Label Classification","date":"2022-06-08","arxiv_id":"2206.03740","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/large-loss-matters-in-weakly-supervised-multi-1#ran","syntology_url":"https://syntology.ai/paper/2206.03740","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.03740"}},"official":{"repos":["snucml/largelossmatters"],"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/decoupling-knowledge-from-memorization","slug":"decoupling-knowledge-from-memorization","title":"Decoupling Knowledge from Memorization: Retrieval-augmented Prompt Learning","date":"2022-05-29","arxiv_id":"2205.14704","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/decoupling-knowledge-from-memorization#ran","syntology_url":"https://syntology.ai/paper/2205.14704","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.14704"}},"official":{"repos":["zjunlp/promptkg"],"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/are-large-pre-trained-language-models-leaking","slug":"are-large-pre-trained-language-models-leaking","title":"Are Large Pre-Trained Language Models Leaking Your Personal Information?","date":"2022-05-25","arxiv_id":"2205.12628","repositories_listed":1,"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/are-large-pre-trained-language-models-leaking#ran","syntology_url":"https://syntology.ai/paper/2205.12628","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.12628"}},"official":{"repos":["jeffhj/lm_personalinfoleak"],"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/contrastive-learning-with-boosted","slug":"contrastive-learning-with-boosted","title":"Contrastive Learning with Boosted Memorization","date":"2022-05-25","arxiv_id":"2205.12693","repositories_listed":1,"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":0,"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/contrastive-learning-with-boosted#ran","syntology_url":"https://syntology.ai/paper/2205.12693","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.12693"}},"official":{"repos":["MediaBrain-SJTU/BCL"],"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":["official"]}}},{"url":"/paper/towards-understanding-grokking-an-effective","slug":"towards-understanding-grokking-an-effective","title":"Towards Understanding Grokking: An Effective Theory of Representation Learning","date":"2022-05-20","arxiv_id":"2205.10343","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-understanding-grokking-an-effective#ran","syntology_url":"https://syntology.ai/paper/2205.10343","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10343"}},"official":{"repos":["ejmichaud/grokking-squared"],"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/provably-confidential-language-modelling-1","slug":"provably-confidential-language-modelling-1","title":"Provably Confidential Language Modelling","date":"2022-05-04","arxiv_id":"2205.01863","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/provably-confidential-language-modelling-1#ran","syntology_url":"https://syntology.ai/paper/2205.01863","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.01863"}},"official":{"repos":["xuandongzhao/crt"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text"]}}},{"url":"/paper/selc-self-ensemble-label-correction-improves","slug":"selc-self-ensemble-label-correction-improves","title":"SELC: Self-Ensemble Label Correction Improves Learning with Noisy Labels","date":"2022-05-02","arxiv_id":"2205.01156","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"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 1 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; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/selc-self-ensemble-label-correction-improves#ran","syntology_url":"https://syntology.ai/paper/2205.01156","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.01156"}},"official":{"repos":["maclll/selc"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/palm-scaling-language-modeling-with-pathways-1","slug":"palm-scaling-language-modeling-with-pathways-1","title":"PaLM: Scaling Language Modeling with Pathways","date":"2022-04-05","arxiv_id":"2204.02311","repositories_listed":7,"syntology":{"n":37,"n_ran":32,"n_constructed":16,"n_ran_checked":24,"n_instrument":8,"n_unverified":5,"n_honours":2,"n_violates":1,"n_no_contract":21,"n_pointer_only":0,"phrase":"32 ran (of which 16 constructed an object rather than computing a result; 24 with no instrument failure: 2 honoured, 1 violated, 21 with no contract checked; 8 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/palm-scaling-language-modeling-with-pathways-1#ran","syntology_url":"https://syntology.ai/paper/2204.02311","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.02311"}},"official":null}},{"url":"/paper/unicon-combating-label-noise-through-uniform","slug":"unicon-combating-label-noise-through-uniform","title":"UNICON: Combating Label Noise Through Uniform Selection and Contrastive Learning","date":"2022-03-28","arxiv_id":"2203.14542","repositories_listed":1,"syntology":{"n":15,"n_ran":12,"n_constructed":0,"n_ran_checked":9,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":4,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/unicon-combating-label-noise-through-uniform#ran","syntology_url":"https://syntology.ai/paper/2203.14542","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.14542"}},"official":{"repos":["nazmul-karim170/unicon-noisy-label"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/quantifying-memorization-across-neural","slug":"quantifying-memorization-across-neural","title":"Quantifying Memorization Across Neural Language Models","date":"2022-02-15","arxiv_id":"2202.07646","repositories_listed":2,"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/quantifying-memorization-across-neural#ran","syntology_url":"https://syntology.ai/paper/2202.07646","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.07646"}},"official":null}},{"url":"/paper/grokking-generalization-beyond-overfitting-on","slug":"grokking-generalization-beyond-overfitting-on","title":"Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets","date":"2022-01-06","arxiv_id":"2201.02177","repositories_listed":6,"syntology":{"n":14,"n_ran":11,"n_constructed":0,"n_ran_checked":9,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/grokking-generalization-beyond-overfitting-on#ran","syntology_url":"https://syntology.ai/paper/2201.02177","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.02177"}},"official":{"repos":["openai/grok"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/evidentiality-guided-generation-for-knowledge","slug":"evidentiality-guided-generation-for-knowledge","title":"Evidentiality-guided Generation for Knowledge-Intensive NLP Tasks","date":"2021-12-16","arxiv_id":"2112.08688","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":7,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/evidentiality-guided-generation-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/2112.08688","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.08688"}},"official":{"repos":["akariasai/evidentiality_qa"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/quantifying-adaptability-in-pre-trained","slug":"quantifying-adaptability-in-pre-trained","title":"Quantifying Adaptability in Pre-trained Language Models with 500 Tasks","date":"2021-12-06","arxiv_id":"2112.03204","repositories_listed":2,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"7 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/quantifying-adaptability-in-pre-trained#ran","syntology_url":"https://syntology.ai/paper/2112.03204","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.03204"}},"official":{"repos":["belindal/taskbench500","facebookresearch/task_bench"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/combining-recurrent-convolutional-and","slug":"combining-recurrent-convolutional-and","title":"Combining Recurrent, Convolutional, and Continuous-time Models with Linear State-Space Layers","date":"2021-10-26","arxiv_id":"2110.13985","repositories_listed":2,"syntology":{"n":53,"n_ran":19,"n_constructed":0,"n_ran_checked":5,"n_instrument":14,"n_unverified":34,"n_honours":2,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"19 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 0 violated, 3 with no contract checked; 14 where Syntology's instrument failed) · 34 unverified","sample_list":"/paper/combining-recurrent-convolutional-and#ran","syntology_url":"https://syntology.ai/paper/2110.13985","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.13985"}},"official":{"repos":["hazyresearch/state-spaces"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":16,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/adaptive-early-learning-correction-for","slug":"adaptive-early-learning-correction-for","title":"Adaptive Early-Learning Correction for Segmentation from Noisy Annotations","date":"2021-10-07","arxiv_id":"2110.03740","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":2,"n_pointer_only":3,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 1 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adaptive-early-learning-correction-for#ran","syntology_url":"https://syntology.ai/paper/2110.03740","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.03740"}},"official":{"repos":["kangningthu/adele"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/excess-capacity-and-backdoor-poisoning","slug":"excess-capacity-and-backdoor-poisoning","title":"Excess Capacity and Backdoor Poisoning","date":"2021-09-02","arxiv_id":"2109.00685","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/excess-capacity-and-backdoor-poisoning#ran","syntology_url":"https://syntology.ai/paper/2109.00685","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.00685"}},"official":{"repos":["narenmanoj/mnist-adv-training"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text"]}}},{"url":"/paper/learning-transferable-parameters-for","slug":"learning-transferable-parameters-for","title":"Learning Transferable Parameters for Unsupervised Domain Adaptation","date":"2021-08-13","arxiv_id":"2108.06129","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":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-transferable-parameters-for#ran","syntology_url":"https://syntology.ai/paper/2108.06129","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.06129"}},"official":{"repos":["zhyhan/transpar"],"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/adaptive-sample-selection-for-robust-learning","slug":"adaptive-sample-selection-for-robust-learning","title":"Adaptive Sample Selection for Robust Learning under Label Noise","date":"2021-06-29","arxiv_id":"2106.15292","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 1 unverified","sample_list":"/paper/adaptive-sample-selection-for-robust-learning#ran","syntology_url":"https://syntology.ai/paper/2106.15292","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.15292"}},"official":{"repos":["dbp1994/bare-wacv-2023"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/antipodes-of-label-differential-privacy-pate","slug":"antipodes-of-label-differential-privacy-pate","title":"Antipodes of Label Differential Privacy: PATE and ALIBI","date":"2021-06-07","arxiv_id":"2106.03408","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":1,"n_honours":5,"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; 5 with no instrument failure: 5 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/antipodes-of-label-differential-privacy-pate#ran","syntology_url":"https://syntology.ai/paper/2106.03408","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.03408"}},"official":{"repos":["facebookresearch/label_dp_antipodes"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["community","official"]}}},{"url":"/paper/exploring-memorization-in-adversarial","slug":"exploring-memorization-in-adversarial","title":"Exploring Memorization in Adversarial Training","date":"2021-06-03","arxiv_id":"2106.01606","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":1,"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/exploring-memorization-in-adversarial#ran","syntology_url":"https://syntology.ai/paper/2106.01606","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.01606"}},"official":{"repos":["dongyp13/memorization-AT"],"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/contrast-to-divide-self-supervised-pre-1","slug":"contrast-to-divide-self-supervised-pre-1","title":"Contrast to Divide: Self-Supervised Pre-Training for Learning with Noisy Labels","date":"2021-03-25","arxiv_id":"2103.13646","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":1,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 1 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/contrast-to-divide-self-supervised-pre-1#ran","syntology_url":"https://syntology.ai/paper/2103.13646","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.13646"}},"official":{"repos":["ContrastToDivide/C2D"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/when-is-memorization-of-irrelevant-training","slug":"when-is-memorization-of-irrelevant-training","title":"When is Memorization of Irrelevant Training Data Necessary for High-Accuracy Learning?","date":"2020-12-11","arxiv_id":"2012.06421","repositories_listed":1,"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/when-is-memorization-of-irrelevant-training#ran","syntology_url":"https://syntology.ai/paper/2012.06421","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.06421"}},"official":{"repos":["gavinrbrown1/training-data-memorization"],"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":["official"]}}},{"url":"/paper/noisy-concurrent-training-for-efficient","slug":"noisy-concurrent-training-for-efficient","title":"Noisy Concurrent Training for Efficient Learning under Label Noise","date":"2020-09-17","arxiv_id":"2009.08325","repositories_listed":2,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/noisy-concurrent-training-for-efficient#ran","syntology_url":"https://syntology.ai/paper/2009.08325","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.08325"}},"official":{"repos":["NeurAI-Lab/NCT"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-explanations-that-are-hard-to-vary","slug":"learning-explanations-that-are-hard-to-vary","title":"Learning explanations that are hard to vary","date":"2020-09-01","arxiv_id":"2009.00329","repositories_listed":4,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/learning-explanations-that-are-hard-to-vary#ran","syntology_url":"https://syntology.ai/paper/2009.00329","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.00329"}},"official":{"repos":["gibipara92/learning-explanations-hard-to-vary","pytorch/ignite"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/what-neural-networks-memorize-and-why","slug":"what-neural-networks-memorize-and-why","title":"What Neural Networks Memorize and Why: Discovering the Long Tail via Influence Estimation","date":"2020-08-09","arxiv_id":"2008.03703","repositories_listed":1,"syntology":{"n":9,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/what-neural-networks-memorize-and-why#ran","syntology_url":"https://syntology.ai/paper/2008.03703","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.03703"}},"official":null}},{"url":"/paper/question-and-answer-test-train-overlap-in","slug":"question-and-answer-test-train-overlap-in","title":"Question and Answer Test-Train Overlap in Open-Domain Question Answering Datasets","date":"2020-08-06","arxiv_id":"2008.02637","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/question-and-answer-test-train-overlap-in#ran","syntology_url":"https://syntology.ai/paper/2008.02637","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.02637"}},"official":{"repos":["facebookresearch/QA-Overlap"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/distributed-memory-based-self-supervised","slug":"distributed-memory-based-self-supervised","title":"Distributed Associative Memory Network with Memory Refreshing Loss","date":"2020-07-21","arxiv_id":"2007.10637","repositories_listed":1,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 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; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/distributed-memory-based-self-supervised#ran","syntology_url":"https://syntology.ai/paper/2007.10637","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.10637"}},"official":{"repos":["taewonpark/DAM"],"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/early-learning-regularization-prevents","slug":"early-learning-regularization-prevents","title":"Early-Learning Regularization Prevents Memorization of Noisy Labels","date":"2020-06-30","arxiv_id":"2007.00151","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"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, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/early-learning-regularization-prevents#ran","syntology_url":"https://syntology.ai/paper/2007.00151","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.00151"}},"official":{"repos":["shengliu66/ELR"],"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/rethink-the-connections-among-generalization","slug":"rethink-the-connections-among-generalization","title":"Rethink the Connections among Generalization, Memorization and the Spectral Bias of DNNs","date":"2020-04-29","arxiv_id":"2004.13954","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/rethink-the-connections-among-generalization#ran","syntology_url":"https://syntology.ai/paper/2004.13954","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.13954"}},"official":{"repos":["ZhangXiao96/RethinkSpectralBias"],"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/do-we-need-zero-training-loss-after-achieving","slug":"do-we-need-zero-training-loss-after-achieving","title":"Do We Need Zero Training Loss After Achieving Zero Training Error?","date":"2020-02-20","arxiv_id":"2002.08709","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"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; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/do-we-need-zero-training-loss-after-achieving#ran","syntology_url":"https://syntology.ai/paper/2002.08709","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.08709"}},"official":{"repos":["takashiishida/flooding"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-generalization-by-controlling-label","slug":"improving-generalization-by-controlling-label","title":"Improving Generalization by Controlling Label-Noise Information in Neural Network Weights","date":"2020-02-19","arxiv_id":"2002.07933","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":0,"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/improving-generalization-by-controlling-label#ran","syntology_url":"https://syntology.ai/paper/2002.07933","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.07933"}},"official":{"repos":["hrayrhar/limit-label-memorization"],"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/self-assttentive-associative-memory","slug":"self-assttentive-associative-memory","title":"Self-Attentive Associative Memory","date":"2020-02-10","arxiv_id":"2002.03519","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"4 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/self-assttentive-associative-memory#ran","syntology_url":"https://syntology.ai/paper/2002.03519","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.03519"}},"official":{"repos":["thaihungle/SAM"],"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/towards-robust-learning-with-different-label","slug":"towards-robust-learning-with-different-label","title":"Towards Robust Learning with Different Label Noise Distributions","date":"2019-12-18","arxiv_id":"1912.08741","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":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/towards-robust-learning-with-different-label#ran","syntology_url":"https://syntology.ai/paper/1912.08741","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.08741"}},"official":null}},{"url":"/paper/generalization-through-memorization-nearest","slug":"generalization-through-memorization-nearest","title":"Generalization through Memorization: Nearest Neighbor Language Models","date":"2019-11-01","arxiv_id":"1911.00172","repositories_listed":5,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/generalization-through-memorization-nearest#ran","syntology_url":"https://syntology.ai/paper/1911.00172","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.00172"}},"official":{"repos":["urvashik/knnlm"],"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/span-selection-pre-training-for-question","slug":"span-selection-pre-training-for-question","title":"Span Selection Pre-training for Question Answering","date":"2019-09-09","arxiv_id":"1909.04120","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"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) · 0 unverified","sample_list":"/paper/span-selection-pre-training-for-question#ran","syntology_url":"https://syntology.ai/paper/1909.04120","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.04120"}},"official":{"repos":["IBM/span-selection-pretraining"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/das3h-modeling-student-learning-and","slug":"das3h-modeling-student-learning-and","title":"DAS3H: Modeling Student Learning and Forgetting for Optimally Scheduling Distributed Practice of Skills","date":"2019-05-14","arxiv_id":"1905.06873","repositories_listed":4,"syntology":{"n":22,"n_ran":15,"n_constructed":0,"n_ran_checked":13,"n_instrument":2,"n_unverified":7,"n_honours":1,"n_violates":2,"n_no_contract":10,"n_pointer_only":10,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 1 honoured, 2 violated, 10 with no contract checked; 2 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/das3h-modeling-student-learning-and#ran","syntology_url":"https://syntology.ai/paper/1905.06873","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.06873"}},"official":{"repos":["BenoitChoffin/das3h"],"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/learning-to-remember-more-with-less","slug":"learning-to-remember-more-with-less","title":"Learning to Remember More with Less Memorization","date":"2019-01-05","arxiv_id":"1901.01347","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":0,"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/learning-to-remember-more-with-less#ran","syntology_url":"https://syntology.ai/paper/1901.01347","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.01347"}},"official":null}},{"url":"/paper/co-teaching-robust-training-of-deep-neural","slug":"co-teaching-robust-training-of-deep-neural","title":"Co-teaching: Robust Training of Deep Neural Networks with Extremely Noisy Labels","date":"2018-04-18","arxiv_id":"1804.06872","repositories_listed":5,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":1,"n_instrument":6,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"7 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; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/co-teaching-robust-training-of-deep-neural#ran","syntology_url":"https://syntology.ai/paper/1804.06872","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.06872"}},"official":{"repos":["bhanML/Co-teaching"],"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/memorization-precedes-generation-learning","slug":"memorization-precedes-generation-learning","title":"Memorization Precedes Generation: Learning Unsupervised GANs with Memory Networks","date":"2018-03-05","arxiv_id":"1803.01500","repositories_listed":1,"syntology":{"n":6,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/memorization-precedes-generation-learning#ran","syntology_url":"https://syntology.ai/paper/1803.01500","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.01500"}},"official":{"repos":["whyjay/memoryGAN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/mixup-beyond-empirical-risk-minimization","slug":"mixup-beyond-empirical-risk-minimization","title":"mixup: Beyond Empirical Risk Minimization","date":"2017-10-25","arxiv_id":"1710.09412","repositories_listed":71,"syntology":{"n":47,"n_ran":36,"n_constructed":5,"n_ran_checked":16,"n_instrument":20,"n_unverified":11,"n_honours":0,"n_violates":0,"n_no_contract":16,"n_pointer_only":15,"phrase":"36 ran (of which 5 constructed an object rather than computing a result; 16 with no instrument failure: 0 honoured, 0 violated, 16 with no contract checked; 20 where Syntology's instrument failed) · 11 unverified","sample_list":"/paper/mixup-beyond-empirical-risk-minimization#ran","syntology_url":"https://syntology.ai/paper/1710.09412","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.09412"}},"official":{"repos":["facebookresearch/mixup-cifar10"],"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/wide-deep-learning-for-recommender-systems","slug":"wide-deep-learning-for-recommender-systems","title":"Wide & Deep Learning for Recommender Systems","date":"2016-06-24","arxiv_id":"1606.07792","repositories_listed":39,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/wide-deep-learning-for-recommender-systems#ran","syntology_url":"https://syntology.ai/paper/1606.07792","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.07792"}},"official":null}}],"record_sha256":"45df844287c1969164b12cf6c0195c1751305bb4b71aee4b48ce1d5844eab8fa","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}