{"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/3","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":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":3,"pages_in_order":11,"rows_per_page":100,"rows":[201,300],"of":1088,"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","prev":"/task/memorization/papers/2","next":"/task/memorization/papers/4","papers":[{"url":"/paper/consistent-diffusion-meets-tweedie-training","slug":"consistent-diffusion-meets-tweedie-training","title":"Consistent Diffusion Meets Tweedie: Training Exact Ambient Diffusion Models with Noisy Data","date":"2024-03-20","arxiv_id":"2404.10177","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"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) · 2 unverified","sample_list":"/paper/consistent-diffusion-meets-tweedie-training#ran","syntology_url":"https://syntology.ai/paper/2404.10177","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.10177"}},"official":{"repos":["giannisdaras/ambient-tweedie"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/tackling-noisy-labels-with-network-parameter","slug":"tackling-noisy-labels-with-network-parameter","title":"Tackling Noisy Labels with Network Parameter Additive Decomposition","date":"2024-03-20","arxiv_id":"2403.13241","repositories_listed":1,"syntology":null},{"url":"/paper/self-generated-replay-memories-for-continual","slug":"self-generated-replay-memories-for-continual","title":"Self-generated Replay Memories for Continual Neural Machine Translation","date":"2024-03-19","arxiv_id":"2403.13130","repositories_listed":1,"syntology":{"n":9,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":7,"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) · 7 unverified","sample_list":"/paper/self-generated-replay-memories-for-continual#ran","syntology_url":"https://syntology.ai/paper/2403.13130","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.13130"}},"official":{"repos":["m-resta/sg-rep"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/uncertainty-aware-pseudo-label-filtering-for","slug":"uncertainty-aware-pseudo-label-filtering-for","title":"Uncertainty-Aware Pseudo-Label Filtering for Source-Free Unsupervised Domain Adaptation","date":"2024-03-17","arxiv_id":"2403.11256","repositories_listed":1,"syntology":null},{"url":"/paper/unveiling-and-mitigating-memorization-in-text","slug":"unveiling-and-mitigating-memorization-in-text","title":"Unveiling and Mitigating Memorization in Text-to-image Diffusion Models through Cross Attention","date":"2024-03-17","arxiv_id":"2403.11052","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/unveiling-and-mitigating-memorization-in-text#ran","syntology_url":"https://syntology.ai/paper/2403.11052","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.11052"}},"official":{"repos":["renjie3/memattn"],"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/meaningful-learning-advancing-abstract","slug":"meaningful-learning-advancing-abstract","title":"Meaningful Learning: Enhancing Abstract Reasoning in Large Language Models via Generic Fact Guidance","date":"2024-03-14","arxiv_id":"2403.09085","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":9,"phrase":"6 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; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/meaningful-learning-advancing-abstract#ran","syntology_url":"https://syntology.ai/paper/2403.09085","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.09085"}},"official":{"repos":["waste-wood/meanlearn"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/a-decade-s-battle-on-dataset-bias-are-we","slug":"a-decade-s-battle-on-dataset-bias-are-we","title":"A Decade's Battle on Dataset Bias: Are We There Yet?","date":"2024-03-13","arxiv_id":"2403.08632","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-memorization-the-challenge-of-random","slug":"beyond-memorization-the-challenge-of-random","title":"Beyond Memorization: The Challenge of Random Memory Access in Language Models","date":"2024-03-12","arxiv_id":"2403.07805","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/beyond-memorization-the-challenge-of-random#ran","syntology_url":"https://syntology.ai/paper/2403.07805","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.07805"}},"official":{"repos":["sail-sg/lm-random-memory-access"],"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/elephants-never-forget-testing-language","slug":"elephants-never-forget-testing-language","title":"Elephants Never Forget: Testing Language Models for Memorization of Tabular Data","date":"2024-03-11","arxiv_id":"2403.06644","repositories_listed":1,"syntology":null},{"url":"/paper/quantifying-contamination-in-evaluating-code","slug":"quantifying-contamination-in-evaluating-code","title":"Quantifying Contamination in Evaluating Code Generation Capabilities of Language Models","date":"2024-03-06","arxiv_id":"2403.04811","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/quantifying-contamination-in-evaluating-code#ran","syntology_url":"https://syntology.ai/paper/2403.04811","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.04811"}},"official":{"repos":["yale-nlp/code-llm-contamination"],"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/alpaca-against-vicuna-using-llms-to-uncover","slug":"alpaca-against-vicuna-using-llms-to-uncover","title":"Alpaca against Vicuna: Using LLMs to Uncover Memorization of LLMs","date":"2024-03-05","arxiv_id":"2403.04801","repositories_listed":1,"syntology":null},{"url":"/paper/sciassess-benchmarking-llm-proficiency-in","slug":"sciassess-benchmarking-llm-proficiency-in","title":"SciAssess: Benchmarking LLM Proficiency in Scientific Literature Analysis","date":"2024-03-04","arxiv_id":"2403.01976","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":3,"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/sciassess-benchmarking-llm-proficiency-in#ran","syntology_url":"https://syntology.ai/paper/2403.01976","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.01976"}},"official":{"repos":["sci-assess/sciassess"],"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/generalization-or-memorization-data","slug":"generalization-or-memorization-data","title":"Generalization or Memorization: Data Contamination and Trustworthy Evaluation for Large Language Models","date":"2024-02-24","arxiv_id":"2402.15938","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":1,"n_honours":2,"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; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/generalization-or-memorization-data#ran","syntology_url":"https://syntology.ai/paper/2402.15938","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.15938"}},"official":{"repos":["yihongdong/cdd-ted4llms"],"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/retrieval-helps-or-hurts-a-deeper-dive-into","slug":"retrieval-helps-or-hurts-a-deeper-dive-into","title":"Retrieval Helps or Hurts? A Deeper Dive into the Efficacy of Retrieval Augmentation to Language Models","date":"2024-02-21","arxiv_id":"2402.13492","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/retrieval-helps-or-hurts-a-deeper-dive-into#ran","syntology_url":"https://syntology.ai/paper/2402.13492","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.13492"}},"official":{"repos":["megagonlabs/witqa"],"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/amplifying-training-data-exposure-through","slug":"amplifying-training-data-exposure-through","title":"Amplifying Training Data Exposure through Fine-Tuning with Pseudo-Labeled Memberships","date":"2024-02-19","arxiv_id":"2402.12189","repositories_listed":1,"syntology":null},{"url":"/paper/artifacts-or-abduction-how-do-llms-answer","slug":"artifacts-or-abduction-how-do-llms-answer","title":"Artifacts or Abduction: How Do LLMs Answer Multiple-Choice Questions Without the Question?","date":"2024-02-19","arxiv_id":"2402.12483","repositories_listed":1,"syntology":{"n":10,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":10,"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) · 6 unverified","sample_list":"/paper/artifacts-or-abduction-how-do-llms-answer#ran","syntology_url":"https://syntology.ai/paper/2402.12483","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.12483"}},"official":{"repos":["nbalepur/mcqa-artifacts"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/copyright-traps-for-large-language-models","slug":"copyright-traps-for-large-language-models","title":"Copyright Traps for Large Language Models","date":"2024-02-14","arxiv_id":"2402.09363","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/copyright-traps-for-large-language-models#ran","syntology_url":"https://syntology.ai/paper/2402.09363","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.09363"}},"official":{"repos":["computationalprivacy/copyright-traps"],"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/the-mirrored-influence-hypothesis-efficient","slug":"the-mirrored-influence-hypothesis-efficient","title":"The Mirrored Influence Hypothesis: Efficient Data Influence Estimation by Harnessing Forward Passes","date":"2024-02-14","arxiv_id":"2402.08922","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":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/the-mirrored-influence-hypothesis-efficient#ran","syntology_url":"https://syntology.ai/paper/2402.08922","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.08922"}},"official":{"repos":["ruoxi-jia-group/forward-inf"],"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/grandmaster-level-chess-without-search","slug":"grandmaster-level-chess-without-search","title":"Amortized Planning with Large-Scale Transformers: A Case Study on Chess","date":"2024-02-07","arxiv_id":"2402.04494","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 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; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/grandmaster-level-chess-without-search#ran","syntology_url":"https://syntology.ai/paper/2402.04494","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.04494"}},"official":{"repos":["google-deepmind/searchless_chess"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/unconditional-latent-diffusion-models","slug":"unconditional-latent-diffusion-models","title":"Unconditional Latent Diffusion Models Memorize Patient Imaging Data: Implications for Openly Sharing Synthetic Data","date":"2024-02-01","arxiv_id":"2402.01054","repositories_listed":1,"syntology":null},{"url":"/paper/conserve-update-revise-to-cure-generalization","slug":"conserve-update-revise-to-cure-generalization","title":"Conserve-Update-Revise to Cure Generalization and Robustness Trade-off in Adversarial Training","date":"2024-01-26","arxiv_id":"2401.14948","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/conserve-update-revise-to-cure-generalization#ran","syntology_url":"https://syntology.ai/paper/2401.14948","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.14948"}},"official":{"repos":["neurai-lab/cure"],"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","unlocated"]}}},{"url":"/paper/do-llms-dream-of-ontologies","slug":"do-llms-dream-of-ontologies","title":"Do LLMs Dream of Ontologies?","date":"2024-01-26","arxiv_id":"2401.14931","repositories_listed":1,"syntology":null},{"url":"/paper/memorization-in-self-supervised-learning","slug":"memorization-in-self-supervised-learning","title":"Memorization in Self-Supervised Learning Improves Downstream Generalization","date":"2024-01-19","arxiv_id":"2401.12233","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"n_honours":1,"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; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/memorization-in-self-supervised-learning#ran","syntology_url":"https://syntology.ai/paper/2401.12233","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.12233"}},"official":{"repos":["sprintml/memorizationssl"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/imputation-with-inter-series-information-from","slug":"imputation-with-inter-series-information-from","title":"Imputation with Inter-Series Information from Prototypes for Irregular Sampled Time Series","date":"2024-01-14","arxiv_id":"2401.07249","repositories_listed":1,"syntology":null},{"url":"/paper/erasediff-erasing-data-influence-in-diffusion","slug":"erasediff-erasing-data-influence-in-diffusion","title":"Erasing Undesirable Influence in Diffusion Models","date":"2024-01-11","arxiv_id":"2401.05779","repositories_listed":1,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":6,"n_instrument":5,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":12,"phrase":"11 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; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/erasediff-erasing-data-influence-in-diffusion#ran","syntology_url":"https://syntology.ai/paper/2401.05779","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.05779"}},"official":{"repos":["jingwu321/erasediff"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/a-good-score-does-not-lead-to-a-good","slug":"a-good-score-does-not-lead-to-a-good","title":"A Good Score Does not Lead to A Good Generative Model","date":"2024-01-10","arxiv_id":"2401.04856","repositories_listed":1,"syntology":{"n":16,"n_ran":11,"n_constructed":0,"n_ran_checked":8,"n_instrument":3,"n_unverified":5,"n_honours":2,"n_violates":0,"n_no_contract":6,"n_pointer_only":16,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 2 honoured, 0 violated, 6 with no contract checked; 3 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/a-good-score-does-not-lead-to-a-good#ran","syntology_url":"https://syntology.ai/paper/2401.04856","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.04856"}},"official":{"repos":["sixuli/ddpm_and_kde"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/roleeval-a-bilingual-role-evaluation","slug":"roleeval-a-bilingual-role-evaluation","title":"RoleEval: A Bilingual Role Evaluation Benchmark for Large Language Models","date":"2023-12-26","arxiv_id":"2312.16132","repositories_listed":1,"syntology":null},{"url":"/paper/feddiv-collaborative-noise-filtering-for","slug":"feddiv-collaborative-noise-filtering-for","title":"FedDiv: Collaborative Noise Filtering for Federated Learning with Noisy Labels","date":"2023-12-19","arxiv_id":"2312.12263","repositories_listed":1,"syntology":null},{"url":"/paper/preserving-privacy-through-dememorization-an","slug":"preserving-privacy-through-dememorization-an","title":"Preserving Privacy Through Dememorization: An Unlearning Technique For Mitigating Memorization Risks In Language Models","date":"2023-12-09","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/sok-unintended-interactions-among-machine","slug":"sok-unintended-interactions-among-machine","title":"SoK: Unintended Interactions among Machine Learning Defenses and Risks","date":"2023-12-07","arxiv_id":"2312.04542","repositories_listed":1,"syntology":null},{"url":"/paper/continual-referring-expression-comprehension","slug":"continual-referring-expression-comprehension","title":"Continual Referring Expression Comprehension via Dual Modular Memorization","date":"2023-11-25","arxiv_id":"2311.14909","repositories_listed":1,"syntology":null},{"url":"/paper/sparse-low-rank-adaptation-of-pre-trained","slug":"sparse-low-rank-adaptation-of-pre-trained","title":"Sparse Low-rank Adaptation of Pre-trained Language Models","date":"2023-11-20","arxiv_id":"2311.11696","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"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) · 1 unverified","sample_list":"/paper/sparse-low-rank-adaptation-of-pre-trained#ran","syntology_url":"https://syntology.ai/paper/2311.11696","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.11696"}},"official":{"repos":["tsinghuac3i/sora"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/negotiated-representations-for-machine","slug":"negotiated-representations-for-machine","title":"Negotiated Representations for Machine Mearning Application","date":"2023-11-19","arxiv_id":"2311.11410","repositories_listed":1,"syntology":null},{"url":"/paper/fuse-to-forget-bias-reduction-and-selective","slug":"fuse-to-forget-bias-reduction-and-selective","title":"Fuse to Forget: Bias Reduction and Selective Memorization through Model Fusion","date":"2023-11-13","arxiv_id":"2311.07682","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/fuse-to-forget-bias-reduction-and-selective#ran","syntology_url":"https://syntology.ai/paper/2311.07682","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.07682"}},"official":{"repos":["keremzaman/fusetoforget"],"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/minimum-description-length-hopfield-networks","slug":"minimum-description-length-hopfield-networks","title":"Minimum Description Length Hopfield Networks","date":"2023-11-11","arxiv_id":"2311.06518","repositories_listed":1,"syntology":null},{"url":"/paper/data-factors-for-better-compositional","slug":"data-factors-for-better-compositional","title":"Data Factors for Better Compositional Generalization","date":"2023-11-08","arxiv_id":"2311.04420","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"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) · 0 unverified","sample_list":"/paper/data-factors-for-better-compositional#ran","syntology_url":"https://syntology.ai/paper/2311.04420","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.04420"}},"official":{"repos":["owenzx/data4comp"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/from-trojan-horses-to-castle-walls-unveiling","slug":"from-trojan-horses-to-castle-walls-unveiling","title":"From Trojan Horses to Castle Walls: Unveiling Bilateral Data Poisoning Effects in Diffusion Models","date":"2023-11-04","arxiv_id":"2311.02373","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"4 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/from-trojan-horses-to-castle-walls-unveiling#ran","syntology_url":"https://syntology.ai/paper/2311.02373","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.02373"}},"official":{"repos":["optml-group/bibaddiff"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/depn-detecting-and-editing-privacy-neurons-in","slug":"depn-detecting-and-editing-privacy-neurons-in","title":"DEPN: Detecting and Editing Privacy Neurons in Pretrained Language Models","date":"2023-10-31","arxiv_id":"2310.20138","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":1,"n_honours":3,"n_violates":0,"n_no_contract":3,"n_pointer_only":9,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 3 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/depn-detecting-and-editing-privacy-neurons-in#ran","syntology_url":"https://syntology.ai/paper/2310.20138","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.20138"}},"official":{"repos":["flamewei123/DEPN"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/grokking-tickets-lottery-tickets-accelerate","slug":"grokking-tickets-lottery-tickets-accelerate","title":"Bridging Lottery Ticket and Grokking: Understanding Grokking from Inner Structure of Networks","date":"2023-10-30","arxiv_id":"2310.19470","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":5,"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) · 2 unverified","sample_list":"/paper/grokking-tickets-lottery-tickets-accelerate#ran","syntology_url":"https://syntology.ai/paper/2310.19470","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.19470"}},"official":{"repos":["gouki510/grokking-tickets"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/copyright-violations-and-large-language","slug":"copyright-violations-and-large-language","title":"Copyright Violations and Large Language Models","date":"2023-10-20","arxiv_id":"2310.13771","repositories_listed":1,"syntology":null},{"url":"/paper/implications-of-annotation-artifacts-in-edge","slug":"implications-of-annotation-artifacts-in-edge","title":"Implications of Annotation Artifacts in Edge Probing Test Datasets","date":"2023-10-20","arxiv_id":"2310.13856","repositories_listed":1,"syntology":null},{"url":"/paper/agenttuning-enabling-generalized-agent","slug":"agenttuning-enabling-generalized-agent","title":"AgentTuning: Enabling Generalized Agent Abilities for LLMs","date":"2023-10-19","arxiv_id":"2310.12823","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/agenttuning-enabling-generalized-agent#ran","syntology_url":"https://syntology.ai/paper/2310.12823","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.12823"}},"official":{"repos":["thudm/agenttuning"],"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/to-grok-or-not-to-grok-disentangling","slug":"to-grok-or-not-to-grok-disentangling","title":"To grok or not to grok: Disentangling generalization and memorization on corrupted algorithmic datasets","date":"2023-10-19","arxiv_id":"2310.13061","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":10,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/to-grok-or-not-to-grok-disentangling#ran","syntology_url":"https://syntology.ai/paper/2310.13061","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.13061"}},"official":{"repos":["d-doshi/Grokking"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/on-the-over-memorization-during-natural","slug":"on-the-over-memorization-during-natural","title":"On the Over-Memorization During Natural, Robust and Catastrophic Overfitting","date":"2023-10-13","arxiv_id":"2310.08847","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"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) · 3 unverified","sample_list":"/paper/on-the-over-memorization-during-natural#ran","syntology_url":"https://syntology.ai/paper/2310.08847","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.08847"}},"official":{"repos":["tmllab/2024_iclr_dom"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/the-emergence-of-reproducibility-and","slug":"the-emergence-of-reproducibility-and","title":"The Emergence of Reproducibility and Generalizability in Diffusion Models","date":"2023-10-08","arxiv_id":"2310.05264","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/the-emergence-of-reproducibility-and#ran","syntology_url":"https://syntology.ai/paper/2310.05264","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.05264"}},"official":null}},{"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/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/memorization-with-neural-nets-going-beyond","slug":"memorization-with-neural-nets-going-beyond","title":"Memorization With Neural Nets: Going Beyond the Worst Case","date":"2023-09-30","arxiv_id":"2310.00327","repositories_listed":1,"syntology":null},{"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/response-emergent-analogical-reasoning-in","slug":"response-emergent-analogical-reasoning-in","title":"Response: Emergent analogical reasoning in large language models","date":"2023-08-30","arxiv_id":"2308.16118","repositories_listed":1,"syntology":null},{"url":"/paper/black-box-unsupervised-domain-adaptation-with","slug":"black-box-unsupervised-domain-adaptation-with","title":"Black-box Unsupervised Domain Adaptation with Bi-directional Atkinson-Shiffrin Memory","date":"2023-08-25","arxiv_id":"2308.13236","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/black-box-unsupervised-domain-adaptation-with#ran","syntology_url":"https://syntology.ai/paper/2308.13236","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.13236"}},"official":{"repos":["jingyi0000/bimem"],"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/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/memochat-tuning-llms-to-use-memos-for","slug":"memochat-tuning-llms-to-use-memos-for","title":"MemoChat: Tuning LLMs to Use Memos for Consistent Long-Range Open-Domain Conversation","date":"2023-08-16","arxiv_id":"2308.08239","repositories_listed":1,"syntology":null},{"url":"/paper/simplyretrieve-a-private-and-lightweight","slug":"simplyretrieve-a-private-and-lightweight","title":"SimplyRetrieve: A Private and Lightweight Retrieval-Centric Generative AI Tool","date":"2023-08-08","arxiv_id":"2308.03983","repositories_listed":1,"syntology":null},{"url":"/paper/3d-ex-a-unified-dataset-of-definitions-and","slug":"3d-ex-a-unified-dataset-of-definitions-and","title":"3D-EX : A Unified Dataset of Definitions and Dictionary Examples","date":"2023-08-06","arxiv_id":"2308.03043","repositories_listed":1,"syntology":null},{"url":"/paper/does-fine-tuning-gpt-3-with-the-openai-api","slug":"does-fine-tuning-gpt-3-with-the-openai-api","title":"Does fine-tuning GPT-3 with the OpenAI API leak personally-identifiable information?","date":"2023-07-31","arxiv_id":"2307.16382","repositories_listed":1,"syntology":null},{"url":"/paper/image-synthesis-under-limited-data-a-survey","slug":"image-synthesis-under-limited-data-a-survey","title":"Image Synthesis under Limited Data: A Survey and Taxonomy","date":"2023-07-31","arxiv_id":"2307.16879","repositories_listed":1,"syntology":null},{"url":"/paper/long-tail-theory-under-gaussian-mixtures","slug":"long-tail-theory-under-gaussian-mixtures","title":"Long-Tail Theory under Gaussian Mixtures","date":"2023-07-20","arxiv_id":"2307.10736","repositories_listed":1,"syntology":null},{"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/drive-like-a-human-rethinking-autonomous","slug":"drive-like-a-human-rethinking-autonomous","title":"Drive Like a Human: Rethinking Autonomous Driving with Large Language Models","date":"2023-07-14","arxiv_id":"2307.07162","repositories_listed":1,"syntology":null},{"url":"/paper/ethicist-targeted-training-data-extraction","slug":"ethicist-targeted-training-data-extraction","title":"Ethicist: Targeted Training Data Extraction Through Loss Smoothed Soft Prompting and Calibrated Confidence Estimation","date":"2023-07-10","arxiv_id":"2307.04401","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/ethicist-targeted-training-data-extraction#ran","syntology_url":"https://syntology.ai/paper/2307.04401","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.04401"}},"official":{"repos":["thu-coai/targeted-data-extraction"],"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/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/on-information-captured-by-neural-networks","slug":"on-information-captured-by-neural-networks","title":"On information captured by neural networks: connections with memorization and generalization","date":"2023-06-28","arxiv_id":"2306.15918","repositories_listed":1,"syntology":null},{"url":"/paper/pseudo-bag-mixup-augmentation-for-multiple","slug":"pseudo-bag-mixup-augmentation-for-multiple","title":"Pseudo-Bag Mixup Augmentation for Multiple Instance Learning-Based Whole Slide Image Classification","date":"2023-06-28","arxiv_id":"2306.16180","repositories_listed":1,"syntology":null},{"url":"/paper/a-preference-aware-meta-optimization","slug":"a-preference-aware-meta-optimization","title":"A Preference-aware Meta-optimization Framework for Personalized Vehicle Energy Consumption Estimation","date":"2023-06-26","arxiv_id":"2306.14421","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-quantum-machine-learning-also","slug":"understanding-quantum-machine-learning-also","title":"Understanding quantum machine learning also requires rethinking generalization","date":"2023-06-23","arxiv_id":"2306.13461","repositories_listed":1,"syntology":null},{"url":"/paper/mild-modeling-the-instance-learning-dynamics","slug":"mild-modeling-the-instance-learning-dynamics","title":"MILD: Modeling the Instance Learning Dynamics for Learning with Noisy Labels","date":"2023-06-20","arxiv_id":"2306.11560","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-text-embedding-space-generation","slug":"unsupervised-text-embedding-space-generation","title":"Unsupervised Text Embedding Space Generation Using Generative Adversarial Networks for Text Synthesis","date":"2023-06-19","arxiv_id":"2306.17181","repositories_listed":1,"syntology":null},{"url":"/paper/improving-generalization-in-meta-learning-via","slug":"improving-generalization-in-meta-learning-via","title":"Improving Generalization in Meta-Learning via Meta-Gradient Augmentation","date":"2023-06-14","arxiv_id":"2306.08460","repositories_listed":1,"syntology":null},{"url":"/paper/can-forward-gradient-match-backpropagation","slug":"can-forward-gradient-match-backpropagation","title":"Can Forward Gradient Match Backpropagation?","date":"2023-06-12","arxiv_id":"2306.06968","repositories_listed":1,"syntology":null},{"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/memorization-capacity-of-multi-head-attention","slug":"memorization-capacity-of-multi-head-attention","title":"Memorization Capacity of Multi-Head Attention in Transformers","date":"2023-06-03","arxiv_id":"2306.02010","repositories_listed":1,"syntology":null},{"url":"/paper/conditionally-strongly-log-concave-generative","slug":"conditionally-strongly-log-concave-generative","title":"Conditionally Strongly Log-Concave Generative Models","date":"2023-05-31","arxiv_id":"2306.00181","repositories_listed":1,"syntology":null},{"url":"/paper/large-language-models-are-not-abstract","slug":"large-language-models-are-not-abstract","title":"Large Language Models Are Not Strong Abstract Reasoners","date":"2023-05-31","arxiv_id":"2305.19555","repositories_listed":1,"syntology":null},{"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/continual-dialogue-state-tracking-via-example","slug":"continual-dialogue-state-tracking-via-example","title":"Continual Dialogue State Tracking via Example-Guided Question Answering","date":"2023-05-23","arxiv_id":"2305.13721","repositories_listed":1,"syntology":null},{"url":"/paper/how-old-is-gpt-the-humbel-framework-for","slug":"how-old-is-gpt-the-humbel-framework-for","title":"HumBEL: A Human-in-the-Loop Approach for Evaluating Demographic Factors of Language Models in Human-Machine Conversations","date":"2023-05-23","arxiv_id":"2305.14195","repositories_listed":1,"syntology":null},{"url":"/paper/mitigating-label-noise-through-data","slug":"mitigating-label-noise-through-data","title":"Mitigating Label Noise through Data Ambiguation","date":"2023-05-23","arxiv_id":"2305.13764","repositories_listed":1,"syntology":null},{"url":"/paper/sources-of-hallucination-by-large-language","slug":"sources-of-hallucination-by-large-language","title":"Sources of Hallucination by Large Language Models on Inference Tasks","date":"2023-05-23","arxiv_id":"2305.14552","repositories_listed":1,"syntology":null},{"url":"/paper/to-copy-rather-than-memorize-a-vertical","slug":"to-copy-rather-than-memorize-a-vertical","title":"To Copy Rather Than Memorize: A Vertical Learning Paradigm for Knowledge Graph Completion","date":"2023-05-23","arxiv_id":"2305.14126","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":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/to-copy-rather-than-memorize-a-vertical#ran","syntology_url":"https://syntology.ai/paper/2305.14126","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.14126"}},"official":{"repos":["rui9812/vlp"],"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/stability-generalization-and-privacy-precise","slug":"stability-generalization-and-privacy-precise","title":"How Spurious Features Are Memorized: Precise Analysis for Random and NTK Features","date":"2023-05-20","arxiv_id":"2305.12100","repositories_listed":1,"syntology":null},{"url":"/paper/assessing-hidden-risks-of-llms-an-empirical","slug":"assessing-hidden-risks-of-llms-an-empirical","title":"Assessing Hidden Risks of LLMs: An Empirical Study on Robustness, Consistency, and Credibility","date":"2023-05-15","arxiv_id":"2305.10235","repositories_listed":1,"syntology":null},{"url":"/paper/memorization-for-good-encryption-with","slug":"memorization-for-good-encryption-with","title":"Memorization for Good: Encryption with Autoregressive Language Models","date":"2023-05-15","arxiv_id":"2305.10445","repositories_listed":1,"syntology":null},{"url":"/paper/bot-or-human-detecting-chatgpt-imposters-with","slug":"bot-or-human-detecting-chatgpt-imposters-with","title":"Bot or Human? Detecting ChatGPT Imposters with A Single Question","date":"2023-05-10","arxiv_id":"2305.06424","repositories_listed":1,"syntology":null},{"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/transition-propagation-graph-neural-networks","slug":"transition-propagation-graph-neural-networks","title":"Transition Propagation Graph Neural Networks for Temporal Networks","date":"2023-04-15","arxiv_id":"2304.07501","repositories_listed":1,"syntology":null},{"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/forget-me-not-learning-to-forget-in-text-to","slug":"forget-me-not-learning-to-forget-in-text-to","title":"Forget-Me-Not: Learning to Forget in Text-to-Image Diffusion Models","date":"2023-03-30","arxiv_id":"2303.17591","repositories_listed":1,"syntology":null},{"url":"/paper/capabilities-of-gpt-4-on-medical-challenge","slug":"capabilities-of-gpt-4-on-medical-challenge","title":"Capabilities of GPT-4 on Medical Challenge Problems","date":"2023-03-20","arxiv_id":"2303.13375","repositories_listed":1,"syntology":null},{"url":"/paper/ancient-chinese-word-segmentation-and-part-of-1","slug":"ancient-chinese-word-segmentation-and-part-of-1","title":"Ancient Chinese Word Segmentation and Part-of-Speech Tagging Using Distant Supervision","date":"2023-03-03","arxiv_id":"2303.01912","repositories_listed":1,"syntology":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/dynamic-named-entity-recognition","slug":"dynamic-named-entity-recognition","title":"Dynamic Named Entity Recognition","date":"2023-02-16","arxiv_id":"2302.10314","repositories_listed":1,"syntology":null},{"url":"/paper/out-of-distribution-detection-based-on-in","slug":"out-of-distribution-detection-based-on-in","title":"Out-of-Distribution Detection based on In-Distribution Data Patterns Memorization with Modern Hopfield Energy","date":"2023-01-21","arxiv_id":null,"repositories_listed":1,"syntology":null}],"record_sha256":"3ddf0b66d267495915cecc619ffb41d892218831ad77d7f3a5ab01f9ee4eca2c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}