{"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/1","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":1,"pages_in_order":2,"rows_per_page":100,"rows":[1,100],"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":null,"next":"/task/memorization/papers/ran/2","papers":[{"url":"/paper/reasoning-or-memorization-unreliable-results","slug":"reasoning-or-memorization-unreliable-results","title":"Reasoning or Memorization? Unreliable Results of Reinforcement Learning Due to Data Contamination","date":"2025-07-14","arxiv_id":"2507.10532","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/reasoning-or-memorization-unreliable-results#ran","syntology_url":"https://syntology.ai/paper/2507.10532","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2507.10532"}},"official":{"repos":["wumingqi/LLM-Math-Evaluation"],"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/dataset-distillation-for-memorized-data-soft","slug":"dataset-distillation-for-memorized-data-soft","title":"Dataset distillation for memorized data: Soft labels can leak held-out teacher knowledge","date":"2025-06-17","arxiv_id":"2506.14457","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":2,"n_instrument":5,"n_unverified":0,"n_honours":2,"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; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/dataset-distillation-for-memorized-data-soft#ran","syntology_url":"https://syntology.ai/paper/2506.14457","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.14457"}},"official":{"repos":["spoc-group/dataset-distillation-memorization"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/sharpness-aware-machine-unlearning","slug":"sharpness-aware-machine-unlearning","title":"Sharpness-Aware Machine Unlearning","date":"2025-06-16","arxiv_id":"2506.13715","repositories_listed":0,"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/sharpness-aware-machine-unlearning#ran","syntology_url":"https://syntology.ai/paper/2506.13715","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.13715"}},"official":null}},{"url":"/paper/diffusion-models-under-low-noise-regime","slug":"diffusion-models-under-low-noise-regime","title":"Diffusion models under low-noise regime","date":"2025-06-09","arxiv_id":"2506.07841","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":5,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":4,"phrase":"9 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; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/diffusion-models-under-low-noise-regime#ran","syntology_url":"https://syntology.ai/paper/2506.07841","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.07841"}},"official":{"repos":["lizardp1/diffusion_low_noise_regime"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/heurigym-an-agentic-benchmark-for-llm-crafted","slug":"heurigym-an-agentic-benchmark-for-llm-crafted","title":"HeuriGym: An Agentic Benchmark for LLM-Crafted Heuristics in Combinatorial Optimization","date":"2025-06-09","arxiv_id":"2506.07972","repositories_listed":1,"syntology":{"n":12,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/heurigym-an-agentic-benchmark-for-llm-crafted#ran","syntology_url":"https://syntology.ai/paper/2506.07972","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.07972"}},"official":{"repos":["cornell-zhang/heurigym"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/matharena-evaluating-llms-on-uncontaminated","slug":"matharena-evaluating-llms-on-uncontaminated","title":"MathArena: Evaluating LLMs on Uncontaminated Math Competitions","date":"2025-05-29","arxiv_id":"2505.23281","repositories_listed":1,"syntology":{"n":19,"n_ran":15,"n_constructed":0,"n_ran_checked":15,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":0,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/matharena-evaluating-llms-on-uncontaminated#ran","syntology_url":"https://syntology.ai/paper/2505.23281","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.23281"}},"official":{"repos":["eth-sri/matharena"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":15,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/grokking-explaind-unifying-model-data-and","slug":"grokking-explaind-unifying-model-data-and","title":"Grokking ExPLAIND: Unifying Model, Data, and Training Attribution to Study Model Behavior","date":"2025-05-26","arxiv_id":"2505.20076","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":3,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 3 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; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/grokking-explaind-unifying-model-data-and#ran","syntology_url":"https://syntology.ai/paper/2505.20076","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.20076"}},"official":{"repos":["mainlp/explaind"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/r1-searcher-incentivizing-the-dynamic","slug":"r1-searcher-incentivizing-the-dynamic","title":"R1-Searcher++: Incentivizing the Dynamic Knowledge Acquisition of LLMs via Reinforcement Learning","date":"2025-05-22","arxiv_id":"2505.17005","repositories_listed":3,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"9 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/r1-searcher-incentivizing-the-dynamic#ran","syntology_url":"https://syntology.ai/paper/2505.17005","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.17005"}},"official":{"repos":["rucaibox/r1-searcher-plus"],"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/pre-training-large-memory-language-models","slug":"pre-training-large-memory-language-models","title":"Pre-training Large Memory Language Models with Internal and External Knowledge","date":"2025-05-21","arxiv_id":"2505.15962","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/pre-training-large-memory-language-models#ran","syntology_url":"https://syntology.ai/paper/2505.15962","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.15962"}},"official":{"repos":["kilian-group/lmlm"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/llm-srbench-a-new-benchmark-for-scientific","slug":"llm-srbench-a-new-benchmark-for-scientific","title":"LLM-SRBench: A New Benchmark for Scientific Equation Discovery with Large Language Models","date":"2025-04-14","arxiv_id":"2504.10415","repositories_listed":2,"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":4,"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/llm-srbench-a-new-benchmark-for-scientific#ran","syntology_url":"https://syntology.ai/paper/2504.10415","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.10415"}},"official":{"repos":["deep-symbolic-mathematics/llm-sr","deep-symbolic-mathematics/llm-srbench"],"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/rare-retrieval-augmented-reasoning-modeling","slug":"rare-retrieval-augmented-reasoning-modeling","title":"RARE: Retrieval-Augmented Reasoning Modeling","date":"2025-03-30","arxiv_id":"2503.23513","repositories_listed":1,"syntology":{"n":14,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":0,"phrase":"13 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/rare-retrieval-augmented-reasoning-modeling#ran","syntology_url":"https://syntology.ai/paper/2503.23513","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.23513"}},"official":{"repos":["open-dataflow/rare"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/data-unlearning-in-diffusion-models","slug":"data-unlearning-in-diffusion-models","title":"Data Unlearning in Diffusion Models","date":"2025-03-02","arxiv_id":"2503.01034","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/data-unlearning-in-diffusion-models#ran","syntology_url":"https://syntology.ai/paper/2503.01034","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.01034"}},"official":{"repos":["claserken/SISS"],"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/memorization-and-regularization-in-generative","slug":"memorization-and-regularization-in-generative","title":"Memorization and Regularization in Generative Diffusion Models","date":"2025-01-27","arxiv_id":"2501.15785","repositories_listed":1,"syntology":{"n":12,"n_ran":7,"n_constructed":0,"n_ran_checked":4,"n_instrument":3,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"phrase":"7 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; 3 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/memorization-and-regularization-in-generative#ran","syntology_url":"https://syntology.ai/paper/2501.15785","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.15785"}},"official":{"repos":["baptistar/DiffusionModelDynamics"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/the-complexity-dynamics-of-grokking","slug":"the-complexity-dynamics-of-grokking","title":"The Complexity Dynamics of Grokking","date":"2024-12-13","arxiv_id":"2412.09810","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/the-complexity-dynamics-of-grokking#ran","syntology_url":"https://syntology.ai/paper/2412.09810","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.09810"}},"official":{"repos":["brantondemoss/GrokkingComplexity"],"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/the-pitfalls-of-memorization-when","slug":"the-pitfalls-of-memorization-when","title":"The Pitfalls of Memorization: When Memorization Hurts Generalization","date":"2024-12-10","arxiv_id":"2412.07684","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 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; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-pitfalls-of-memorization-when#ran","syntology_url":"https://syntology.ai/paper/2412.07684","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.07684"}},"official":{"repos":["facebookresearch/pitfalls-of-memorization"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/parameter-efficient-instruction-tuning-an","slug":"parameter-efficient-instruction-tuning-an","title":"Parameter Efficient Instruction Tuning: An Empirical Study","date":"2024-11-25","arxiv_id":"2411.16775","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":4,"n_pointer_only":3,"phrase":"7 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/parameter-efficient-instruction-tuning-an#ran","syntology_url":"https://syntology.ai/paper/2411.16775","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.16775"}},"official":{"repos":["AdaBit-AI/parameter_efficient_instruction_tuning"],"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","unlocated"]}}},{"url":"/paper/classifier-free-guidance-inside-the","slug":"classifier-free-guidance-inside-the","title":"Classifier-Free Guidance inside the Attraction Basin May Cause Memorization","date":"2024-11-23","arxiv_id":"2411.16738","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/classifier-free-guidance-inside-the#ran","syntology_url":"https://syntology.ai/paper/2411.16738","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.16738"}},"official":{"repos":["anubhav1997/mitigating_memorization"],"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/what-do-learning-dynamics-reveal-about","slug":"what-do-learning-dynamics-reveal-about","title":"What Do Learning Dynamics Reveal About Generalization in LLM Reasoning?","date":"2024-11-12","arxiv_id":"2411.07681","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":3,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/what-do-learning-dynamics-reveal-about#ran","syntology_url":"https://syntology.ai/paper/2411.07681","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.07681"}},"official":{"repos":["katiekang1998/reasoning_generalization"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/continual-memorization-of-factoids-in-large","slug":"continual-memorization-of-factoids-in-large","title":"Continual Memorization of Factoids in Large Language Models","date":"2024-11-11","arxiv_id":"2411.07175","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/continual-memorization-of-factoids-in-large#ran","syntology_url":"https://syntology.ai/paper/2411.07175","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.07175"}},"official":{"repos":["princeton-nlp/continual-factoid-memorization"],"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/understanding-generalizability-of-diffusion","slug":"understanding-generalizability-of-diffusion","title":"Understanding Generalizability of Diffusion Models Requires Rethinking the Hidden Gaussian Structure","date":"2024-10-31","arxiv_id":"2410.24060","repositories_listed":1,"syntology":{"n":20,"n_ran":12,"n_constructed":0,"n_ran_checked":8,"n_instrument":4,"n_unverified":8,"n_honours":3,"n_violates":0,"n_no_contract":5,"n_pointer_only":20,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 3 honoured, 0 violated, 5 with no contract checked; 4 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/understanding-generalizability-of-diffusion#ran","syntology_url":"https://syntology.ai/paper/2410.24060","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.24060"}},"official":{"repos":["Morefre/Understanding-Generalizability-of-Diffusion-Models-Requires-Rethinking-the-Hidden-Gaussian-Structure"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/dash-warm-starting-neural-network-training-in","slug":"dash-warm-starting-neural-network-training-in","title":"DASH: Warm-Starting Neural Network Training in Stationary Settings without Loss of Plasticity","date":"2024-10-30","arxiv_id":"2410.23495","repositories_listed":2,"syntology":{"n":14,"n_ran":11,"n_constructed":0,"n_ran_checked":9,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":8,"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, 1 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/dash-warm-starting-neural-network-training-in#ran","syntology_url":"https://syntology.ai/paper/2410.23495","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.23495"}},"official":{"repos":["NAVER-INTEL-Co-Lab/gaudi-dash","baekrok/DASH-Direction-Aware-SHrinking"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/capacity-control-is-an-effective-memorization","slug":"capacity-control-is-an-effective-memorization","title":"Capacity Control is an Effective Memorization Mitigation Mechanism in Text-Conditional Diffusion Models","date":"2024-10-29","arxiv_id":"2410.22149","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":10,"phrase":"9 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/capacity-control-is-an-effective-memorization#ran","syntology_url":"https://syntology.ai/paper/2410.22149","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.22149"}},"official":{"repos":["raman1121/diffusion_memorization_hpo"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/arithmetic-without-algorithms-language-models","slug":"arithmetic-without-algorithms-language-models","title":"Arithmetic Without Algorithms: Language Models Solve Math With a Bag of Heuristics","date":"2024-10-28","arxiv_id":"2410.21272","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/arithmetic-without-algorithms-language-models#ran","syntology_url":"https://syntology.ai/paper/2410.21272","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.21272"}},"official":{"repos":["technion-cs-nlp/llm-arithmetic-heuristics"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/knowledgesg-privacy-preserving-synthetic-text","slug":"knowledgesg-privacy-preserving-synthetic-text","title":"KnowledgeSG: Privacy-Preserving Synthetic Text Generation with Knowledge Distillation from Server","date":"2024-10-08","arxiv_id":"2410.05725","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":8,"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) · 3 unverified","sample_list":"/paper/knowledgesg-privacy-preserving-synthetic-text#ran","syntology_url":"https://syntology.ai/paper/2410.05725","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.05725"}},"official":{"repos":["wwh0411/knowledgesg"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/forgetting-curve-a-reliable-method-for","slug":"forgetting-curve-a-reliable-method-for","title":"Forgetting Curve: A Reliable Method for Evaluating Memorization Capability for Long-context Models","date":"2024-10-07","arxiv_id":"2410.04727","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/forgetting-curve-a-reliable-method-for#ran","syntology_url":"https://syntology.ai/paper/2410.04727","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.04727"}},"official":{"repos":["1azybug/forgettingcurve"],"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/quantifying-generalization-complexity-for","slug":"quantifying-generalization-complexity-for","title":"Quantifying Generalization Complexity for Large Language Models","date":"2024-10-02","arxiv_id":"2410.01769","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":4,"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/quantifying-generalization-complexity-for#ran","syntology_url":"https://syntology.ai/paper/2410.01769","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.01769"}},"official":{"repos":["zhentingqi/scylla"],"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/composing-global-optimizers-to-reasoning","slug":"composing-global-optimizers-to-reasoning","title":"Composing Global Optimizers to Reasoning Tasks via Algebraic Objects in Neural Nets","date":"2024-10-02","arxiv_id":"2410.01779","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":2,"n_no_contract":1,"n_pointer_only":7,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 2 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/composing-global-optimizers-to-reasoning#ran","syntology_url":"https://syntology.ai/paper/2410.01779","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.01779"}},"official":{"repos":["facebookresearch/luckmatters"],"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/federated-learning-from-vision-language","slug":"federated-learning-from-vision-language","title":"Federated Learning from Vision-Language Foundation Models: Theoretical Analysis and Method","date":"2024-09-29","arxiv_id":"2409.19610","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":3,"n_instrument":4,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":10,"phrase":"7 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; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/federated-learning-from-vision-language#ran","syntology_url":"https://syntology.ai/paper/2409.19610","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.19610"}},"official":{"repos":["PanBikang/PromptFolio"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/meow-memory-supervised-llm-unlearning-via","slug":"meow-memory-supervised-llm-unlearning-via","title":"MEOW: MEMOry Supervised LLM Unlearning Via Inverted Facts","date":"2024-09-18","arxiv_id":"2409.11844","repositories_listed":1,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":11,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/meow-memory-supervised-llm-unlearning-via#ran","syntology_url":"https://syntology.ai/paper/2409.11844","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.11844"}},"official":{"repos":["carol-gutianle/meow"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-data-contamination-detection-for","slug":"towards-data-contamination-detection-for","title":"Towards Data Contamination Detection for Modern Large Language Models: Limitations, Inconsistencies, and Oracle Challenges","date":"2024-09-16","arxiv_id":"2409.09927","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/towards-data-contamination-detection-for#ran","syntology_url":"https://syntology.ai/paper/2409.09927","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.09927"}},"official":{"repos":["vsamuel2003/data-contamination"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/memorag-moving-towards-next-gen-rag-via","slug":"memorag-moving-towards-next-gen-rag-via","title":"MemoRAG: Moving towards Next-Gen RAG Via Memory-Inspired Knowledge Discovery","date":"2024-09-09","arxiv_id":"2409.05591","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":6,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":6,"phrase":"9 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; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/memorag-moving-towards-next-gen-rag-via#ran","syntology_url":"https://syntology.ai/paper/2409.05591","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.05591"}},"official":{"repos":["qhjqhj00/memorag"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/the-unreasonable-ineffectiveness-of-nucleus","slug":"the-unreasonable-ineffectiveness-of-nucleus","title":"The Unreasonable Ineffectiveness of Nucleus Sampling on Mitigating Text Memorization","date":"2024-08-29","arxiv_id":"2408.16345","repositories_listed":1,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":7,"n_pointer_only":11,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 1 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/the-unreasonable-ineffectiveness-of-nucleus#ran","syntology_url":"https://syntology.ai/paper/2408.16345","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.16345"}},"official":{"repos":["lukaborec/memorization-nucleus-sampling"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-robust-and-cost-efficient-knowledge","slug":"towards-robust-and-cost-efficient-knowledge","title":"Towards Robust and Parameter-Efficient Knowledge Unlearning for LLMs","date":"2024-08-13","arxiv_id":"2408.06621","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/towards-robust-and-cost-efficient-knowledge#ran","syntology_url":"https://syntology.ai/paper/2408.06621","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.06621"}},"official":{"repos":["csm9493/efficient-llm-unlearning"],"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/detecting-explaining-and-mitigating","slug":"detecting-explaining-and-mitigating","title":"Detecting, Explaining, and Mitigating Memorization in Diffusion Models","date":"2024-07-31","arxiv_id":"2407.21720","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/detecting-explaining-and-mitigating#ran","syntology_url":"https://syntology.ai/paper/2407.21720","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.21720"}},"official":{"repos":["yuxinwenrick/diffusion_memorization"],"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/demystifying-verbatim-memorization-in-large","slug":"demystifying-verbatim-memorization-in-large","title":"Demystifying Verbatim Memorization in Large Language Models","date":"2024-07-25","arxiv_id":"2407.17817","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/demystifying-verbatim-memorization-in-large#ran","syntology_url":"https://syntology.ai/paper/2407.17817","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.17817"}},"official":{"repos":["explanare/verbatim-memorization"],"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/iterative-ensemble-training-with-anti","slug":"iterative-ensemble-training-with-anti","title":"Iterative Ensemble Training with Anti-Gradient Control for Mitigating Memorization in Diffusion Models","date":"2024-07-22","arxiv_id":"2407.15328","repositories_listed":1,"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":8,"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/iterative-ensemble-training-with-anti#ran","syntology_url":"https://syntology.ai/paper/2407.15328","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.15328"}},"official":{"repos":["liuxiao-guan/iet_agc"],"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/generalization-v-s-memorization-tracing","slug":"generalization-v-s-memorization-tracing","title":"Generalization v.s. Memorization: Tracing Language Models' Capabilities Back to Pretraining Data","date":"2024-07-20","arxiv_id":"2407.14985","repositories_listed":0,"syntology":{"n":15,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 1 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/generalization-v-s-memorization-tracing#ran","syntology_url":"https://syntology.ai/paper/2407.14985","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.14985"}},"official":null}},{"url":"/paper/how-to-engage-your-readers-generating-guiding","slug":"how-to-engage-your-readers-generating-guiding","title":"How to Engage Your Readers? Generating Guiding Questions to Promote Active Reading","date":"2024-07-19","arxiv_id":"2407.14309","repositories_listed":1,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":11,"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) · 1 unverified","sample_list":"/paper/how-to-engage-your-readers-generating-guiding#ran","syntology_url":"https://syntology.ai/paper/2407.14309","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.14309"}},"official":{"repos":["eth-lre/engage-your-readers"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/understanding-counting-in-small-transformers","slug":"understanding-counting-in-small-transformers","title":"Counting in Small Transformers: The Delicate Interplay between Attention and Feed-Forward Layers","date":"2024-07-16","arxiv_id":"2407.11542","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":8,"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) · 1 unverified","sample_list":"/paper/understanding-counting-in-small-transformers#ran","syntology_url":"https://syntology.ai/paper/2407.11542","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.11542"}},"official":{"repos":["SPOC-group/counting-attention"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/we-math-does-your-large-multimodal-model","slug":"we-math-does-your-large-multimodal-model","title":"We-Math: Does Your Large Multimodal Model Achieve Human-like Mathematical Reasoning?","date":"2024-07-01","arxiv_id":"2407.01284","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":0,"n_instrument":5,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"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) · 0 unverified","sample_list":"/paper/we-math-does-your-large-multimodal-model#ran","syntology_url":"https://syntology.ai/paper/2407.01284","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.01284"}},"official":{"repos":["we-math/we-math"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/deciphering-the-factors-influencing-the","slug":"deciphering-the-factors-influencing-the","title":"Deciphering the Factors Influencing the Efficacy of Chain-of-Thought: Probability, Memorization, and Noisy Reasoning","date":"2024-07-01","arxiv_id":"2407.01687","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"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) · 3 unverified","sample_list":"/paper/deciphering-the-factors-influencing-the#ran","syntology_url":"https://syntology.ai/paper/2407.01687","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.01687"}},"official":{"repos":["aksh555/deciphering_cot"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/advancing-cross-domain-discriminability-in","slug":"advancing-cross-domain-discriminability-in","title":"Advancing Cross-domain Discriminability in Continual Learning of Vision-Language Models","date":"2024-06-27","arxiv_id":"2406.18868","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/advancing-cross-domain-discriminability-in#ran","syntology_url":"https://syntology.ai/paper/2406.18868","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.18868"}},"official":{"repos":["linghan1997/regression-based-analytic-incremental-learning"],"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/sonnet-or-not-bot-poetry-evaluation-for-large","slug":"sonnet-or-not-bot-poetry-evaluation-for-large","title":"Sonnet or Not, Bot? Poetry Evaluation for Large Models and Datasets","date":"2024-06-27","arxiv_id":"2406.18906","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":2,"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: 0 honoured, 2 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/sonnet-or-not-bot-poetry-evaluation-for-large#ran","syntology_url":"https://syntology.ai/paper/2406.18906","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.18906"}},"official":{"repos":["maria-antoniak/poetry-eval"],"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/investigating-how-large-language-models","slug":"investigating-how-large-language-models","title":"Hierarchical Deconstruction of LLM Reasoning: A Graph-Based Framework for Analyzing Knowledge Utilization","date":"2024-06-27","arxiv_id":"2406.19502","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/investigating-how-large-language-models#ran","syntology_url":"https://syntology.ai/paper/2406.19502","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.19502"}},"official":{"repos":["kaistai/knowledge-reasoning"],"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":["official"]}}},{"url":"/paper/recite-reconstruct-recollect-memorization-in","slug":"recite-reconstruct-recollect-memorization-in","title":"Recite, Reconstruct, Recollect: Memorization in LMs as a Multifaceted Phenomenon","date":"2024-06-25","arxiv_id":"2406.17746","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":6,"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) · 2 unverified","sample_list":"/paper/recite-reconstruct-recollect-memorization-in#ran","syntology_url":"https://syntology.ai/paper/2406.17746","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.17746"}},"official":{"repos":["eleutherai/semantic-memorization"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/inherent-challenges-of-post-hoc-membership","slug":"inherent-challenges-of-post-hoc-membership","title":"SoK: Membership Inference Attacks on LLMs are Rushing Nowhere (and How to Fix It)","date":"2024-06-25","arxiv_id":"2406.17975","repositories_listed":1,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":9,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":12,"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) · 1 unverified","sample_list":"/paper/inherent-challenges-of-post-hoc-membership#ran","syntology_url":"https://syntology.ai/paper/2406.17975","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.17975"}},"official":{"repos":["computationalprivacy/mia_llms_benchmark"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/allenoise-large-scale-text-classification","slug":"allenoise-large-scale-text-classification","title":"AlleNoise: large-scale text classification benchmark dataset with real-world label noise","date":"2024-06-24","arxiv_id":"2407.10992","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/allenoise-large-scale-text-classification#ran","syntology_url":"https://syntology.ai/paper/2407.10992","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.10992"}},"official":{"repos":["allegro/allenoise"],"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/can-llm-graph-reasoning-generalize-beyond","slug":"can-llm-graph-reasoning-generalize-beyond","title":"Can LLM Graph Reasoning Generalize beyond Pattern Memorization?","date":"2024-06-23","arxiv_id":"2406.15992","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/can-llm-graph-reasoning-generalize-beyond#ran","syntology_url":"https://syntology.ai/paper/2406.15992","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.15992"}},"official":{"repos":["matthewyzhang/nlgift"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/data-contamination-can-cross-language","slug":"data-contamination-can-cross-language","title":"Data Contamination Can Cross Language Barriers","date":"2024-06-19","arxiv_id":"2406.13236","repositories_listed":1,"syntology":{"n":14,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":14,"phrase":"13 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/data-contamination-can-cross-language#ran","syntology_url":"https://syntology.ai/paper/2406.13236","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.13236"}},"official":{"repos":["shangdatalab/deep-contam"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/jogging-the-memory-of-unlearned-model-through","slug":"jogging-the-memory-of-unlearned-model-through","title":"Jogging the Memory of Unlearned LLMs Through Targeted Relearning Attacks","date":"2024-06-19","arxiv_id":"2406.13356","repositories_listed":1,"syntology":{"n":16,"n_ran":13,"n_constructed":0,"n_ran_checked":11,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":4,"phrase":"13 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; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/jogging-the-memory-of-unlearned-model-through#ran","syntology_url":"https://syntology.ai/paper/2406.13356","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.13356"}},"official":{"repos":["s-huu/jog_llm_memory"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/how-do-large-language-models-acquire-factual","slug":"how-do-large-language-models-acquire-factual","title":"How Do Large Language Models Acquire Factual Knowledge During Pretraining?","date":"2024-06-17","arxiv_id":"2406.11813","repositories_listed":2,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":1,"n_instrument":6,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"7 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; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/how-do-large-language-models-acquire-factual#ran","syntology_url":"https://syntology.ai/paper/2406.11813","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.11813"}},"official":{"repos":["kaistai/factual-knowledge-acquisition"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/be-like-a-goldfish-don-t-memorize-mitigating","slug":"be-like-a-goldfish-don-t-memorize-mitigating","title":"Be like a Goldfish, Don't Memorize! Mitigating Memorization in Generative LLMs","date":"2024-06-14","arxiv_id":"2406.10209","repositories_listed":1,"syntology":{"n":18,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":2,"n_no_contract":11,"n_pointer_only":0,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 2 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/be-like-a-goldfish-don-t-memorize-mitigating#ran","syntology_url":"https://syntology.ai/paper/2406.10209","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.10209"}},"official":{"repos":["ahans30/goldfish-loss"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/self-tuning-instructing-llms-to-effectively","slug":"self-tuning-instructing-llms-to-effectively","title":"Self-Tuning: Instructing LLMs to Effectively Acquire New Knowledge through Self-Teaching","date":"2024-06-10","arxiv_id":"2406.06326","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/self-tuning-instructing-llms-to-effectively#ran","syntology_url":"https://syntology.ai/paper/2406.06326","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.06326"}},"official":{"repos":["zhangxy-2019/Effective-Knowledge-Injection"],"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","unlocated"]}}},{"url":"/paper/finding-nemo-localizing-neurons-responsible","slug":"finding-nemo-localizing-neurons-responsible","title":"Finding NeMo: Localizing Neurons Responsible For Memorization in Diffusion Models","date":"2024-06-04","arxiv_id":"2406.02366","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":1,"n_ran_checked":2,"n_instrument":3,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"5 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/finding-nemo-localizing-neurons-responsible#ran","syntology_url":"https://syntology.ai/paper/2406.02366","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.02366"}},"official":{"repos":["ml-research/localizing_memorization_in_diffusion_models"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/perteval-unveiling-real-knowledge-capacity-of","slug":"perteval-unveiling-real-knowledge-capacity-of","title":"PertEval: Unveiling Real Knowledge Capacity of LLMs with Knowledge-Invariant Perturbations","date":"2024-05-30","arxiv_id":"2405.19740","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":1,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 1 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) · 2 unverified","sample_list":"/paper/perteval-unveiling-real-knowledge-capacity-of#ran","syntology_url":"https://syntology.ai/paper/2405.19740","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.19740"}},"official":{"repos":["aigc-apps/perteval"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/when-does-compositional-structure-yield","slug":"when-does-compositional-structure-yield","title":"When does compositional structure yield compositional generalization? A kernel theory","date":"2024-05-26","arxiv_id":"2405.16391","repositories_listed":1,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":4,"n_honours":1,"n_violates":3,"n_no_contract":1,"n_pointer_only":12,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 3 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/when-does-compositional-structure-yield#ran","syntology_url":"https://syntology.ai/paper/2405.16391","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.16391"}},"official":{"repos":["sflippl/compositional-generalization"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/large-scale-knowledge-washing","slug":"large-scale-knowledge-washing","title":"Large Scale Knowledge Washing","date":"2024-05-26","arxiv_id":"2405.16720","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"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) · 0 unverified","sample_list":"/paper/large-scale-knowledge-washing#ran","syntology_url":"https://syntology.ai/paper/2405.16720","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.16720"}},"official":{"repos":["wangyu-ustc/largescalewashing"],"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/unsupervised-meta-learning-via-in-context","slug":"unsupervised-meta-learning-via-in-context","title":"Unsupervised Meta-Learning via In-Context Learning","date":"2024-05-25","arxiv_id":"2405.16124","repositories_listed":0,"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/unsupervised-meta-learning-via-in-context#ran","syntology_url":"https://syntology.ai/paper/2405.16124","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.16124"}},"official":null}},{"url":"/paper/mosaic-memory-fuzzy-duplication-in-copyright","slug":"mosaic-memory-fuzzy-duplication-in-copyright","title":"The Mosaic Memory of Large Language Models","date":"2024-05-24","arxiv_id":"2405.15523","repositories_listed":1,"syntology":{"n":16,"n_ran":16,"n_constructed":0,"n_ran_checked":16,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":16,"n_pointer_only":0,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 0 honoured, 0 violated, 16 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/mosaic-memory-fuzzy-duplication-in-copyright#ran","syntology_url":"https://syntology.ai/paper/2405.15523","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.15523"}},"official":{"repos":["computationalprivacy/mosaic_memory"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":16,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/membership-inference-on-text-to-image","slug":"membership-inference-on-text-to-image","title":"Membership Inference on Text-to-Image Diffusion Models via Conditional Likelihood Discrepancy","date":"2024-05-23","arxiv_id":"2405.14800","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/membership-inference-on-text-to-image#ran","syntology_url":"https://syntology.ai/paper/2405.14800","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.14800"}},"official":{"repos":["zhaisf/clid"],"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/upper-and-lower-memory-capacity-bounds-of","slug":"upper-and-lower-memory-capacity-bounds-of","title":"Next-token prediction capacity: general upper bounds and a lower bound for transformers","date":"2024-05-22","arxiv_id":"2405.13718","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":2,"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/upper-and-lower-memory-capacity-bounds-of#ran","syntology_url":"https://syntology.ai/paper/2405.13718","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.13718"}},"official":{"repos":["curtfox/decoder-memory-capacity"],"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/asymptotic-theory-of-in-context-learning-by","slug":"asymptotic-theory-of-in-context-learning-by","title":"Asymptotic theory of in-context learning by linear attention","date":"2024-05-20","arxiv_id":"2405.11751","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":0,"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/asymptotic-theory-of-in-context-learning-by#ran","syntology_url":"https://syntology.ai/paper/2405.11751","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.11751"}},"official":{"repos":["Pehlevan-Group/icl-asymptotic"],"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/rethinking-graph-backdoor-attacks-a","slug":"rethinking-graph-backdoor-attacks-a","title":"Rethinking Graph Backdoor Attacks: A Distribution-Preserving Perspective","date":"2024-05-17","arxiv_id":"2405.10757","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":7,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/rethinking-graph-backdoor-attacks-a#ran","syntology_url":"https://syntology.ai/paper/2405.10757","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.10757"}},"official":{"repos":["zzwjames/dpgba"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/could-it-be-generated-towards-practical","slug":"could-it-be-generated-towards-practical","title":"An Inversion-based Measure of Memorization for Diffusion Models","date":"2024-05-09","arxiv_id":"2405.05846","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":2,"n_no_contract":5,"n_pointer_only":9,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 2 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/could-it-be-generated-towards-practical#ran","syntology_url":"https://syntology.ai/paper/2405.05846","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.05846"}},"official":{"repos":["Maryeon/InvMM"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/hmt-hierarchical-memory-transformer-for-long","slug":"hmt-hierarchical-memory-transformer-for-long","title":"HMT: Hierarchical Memory Transformer for Long Context Language Processing","date":"2024-05-09","arxiv_id":"2405.06067","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":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) · 3 unverified","sample_list":"/paper/hmt-hierarchical-memory-transformer-for-long#ran","syntology_url":"https://syntology.ai/paper/2405.06067","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.06067"}},"official":{"repos":["OswaldHe/HMT-pytorch"],"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/memllm-finetuning-llms-to-use-an-explicit","slug":"memllm-finetuning-llms-to-use-an-explicit","title":"MemLLM: Finetuning LLMs to Use An Explicit Read-Write Memory","date":"2024-04-17","arxiv_id":"2404.11672","repositories_listed":1,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":10,"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) · 4 unverified","sample_list":"/paper/memllm-finetuning-llms-to-use-an-explicit#ran","syntology_url":"https://syntology.ai/paper/2404.11672","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.11672"}},"official":{"repos":["amodaresi/memllm"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/elephants-never-forget-memorization-and","slug":"elephants-never-forget-memorization-and","title":"Elephants Never Forget: Memorization and Learning of Tabular Data in Large Language Models","date":"2024-04-09","arxiv_id":"2404.06209","repositories_listed":1,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/elephants-never-forget-memorization-and#ran","syntology_url":"https://syntology.ai/paper/2404.06209","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.06209"}},"official":{"repos":["interpretml/llm-tabular-memorization-checker"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/language-models-learn-rare-phenomena-from","slug":"language-models-learn-rare-phenomena-from","title":"Language Models Learn Rare Phenomena from Less Rare Phenomena: The Case of the Missing AANNs","date":"2024-03-28","arxiv_id":"2403.19827","repositories_listed":0,"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/language-models-learn-rare-phenomena-from#ran","syntology_url":"https://syntology.ai/paper/2403.19827","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.19827"}},"official":null}},{"url":"/paper/localizing-paragraph-memorization-in-language","slug":"localizing-paragraph-memorization-in-language","title":"Localizing Paragraph Memorization in Language Models","date":"2024-03-28","arxiv_id":"2403.19851","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/localizing-paragraph-memorization-in-language#ran","syntology_url":"https://syntology.ai/paper/2403.19851","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.19851"}},"official":{"repos":["googleinterns/localizing-paragraph-memorization"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/benchmarking-chinese-commonsense-reasoning-of","slug":"benchmarking-chinese-commonsense-reasoning-of","title":"Benchmarking Chinese Commonsense Reasoning of LLMs: From Chinese-Specifics to Reasoning-Memorization Correlations","date":"2024-03-21","arxiv_id":"2403.14112","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":3,"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) · 2 unverified","sample_list":"/paper/benchmarking-chinese-commonsense-reasoning-of#ran","syntology_url":"https://syntology.ai/paper/2403.14112","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.14112"}},"official":{"repos":["opendatalab/charm"],"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/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/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/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/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/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/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/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/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/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/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/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/disentangled-continual-learning-separating","slug":"disentangled-continual-learning-separating","title":"Infinite dSprites for Disentangled Continual Learning: Separating Memory Edits from Generalization","date":"2023-12-27","arxiv_id":"2312.16731","repositories_listed":2,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/disentangled-continual-learning-separating#ran","syntology_url":"https://syntology.ai/paper/2312.16731","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.16731"}},"official":{"repos":["sbdzdz/disco","sbdzdz/idsprites"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"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/practical-membership-inference-attacks","slug":"practical-membership-inference-attacks","title":"Practical Membership Inference Attacks against Fine-tuned Large Language Models via Self-prompt Calibration","date":"2023-11-10","arxiv_id":"2311.06062","repositories_listed":2,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":6,"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) · 1 unverified","sample_list":"/paper/practical-membership-inference-attacks#ran","syntology_url":"https://syntology.ai/paper/2311.06062","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.06062"}},"official":{"repos":["tsinghua-fib-lab/neurips2024_spv-mia","wjfu99/MIA-LLMs"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/data-contamination-quiz-a-tool-to-detect-and","slug":"data-contamination-quiz-a-tool-to-detect-and","title":"Data Contamination Quiz: A Tool to Detect and Estimate Contamination in Large Language Models","date":"2023-11-10","arxiv_id":"2311.06233","repositories_listed":2,"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/data-contamination-quiz-a-tool-to-detect-and#ran","syntology_url":"https://syntology.ai/paper/2311.06233","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.06233"}},"official":{"repos":["shahriargolchin/dcq"],"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/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/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/cousins-of-the-vendi-score-a-family-of","slug":"cousins-of-the-vendi-score-a-family-of","title":"Cousins Of The Vendi Score: A Family Of Similarity-Based Diversity Metrics For Science And Machine Learning","date":"2023-10-19","arxiv_id":"2310.12952","repositories_listed":2,"syntology":{"n":16,"n_ran":15,"n_constructed":0,"n_ran_checked":13,"n_instrument":2,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":11,"n_pointer_only":6,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 2 honoured, 0 violated, 11 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/cousins-of-the-vendi-score-a-family-of#ran","syntology_url":"https://syntology.ai/paper/2310.12952","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.12952"}},"official":{"repos":["vertaix/vendi-sampling","vertaix/vendi-score"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":1,"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/beyond-memorization-violating-privacy-via","slug":"beyond-memorization-violating-privacy-via","title":"Beyond Memorization: Violating Privacy Via Inference with Large Language Models","date":"2023-10-11","arxiv_id":"2310.07298","repositories_listed":2,"syntology":{"n":13,"n_ran":13,"n_constructed":0,"n_ran_checked":11,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":10,"n_pointer_only":2,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 1 honoured, 0 violated, 10 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/beyond-memorization-violating-privacy-via#ran","syntology_url":"https://syntology.ai/paper/2310.07298","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.07298"}},"official":{"repos":["eth-sri/llmprivacy"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["listed","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}}],"record_sha256":"14d54bfd5a45ef791d680ddce58f0c9c36017b47ff046e9086c5ad5a49bf37b8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}