{"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/6","list_of":"/task/memorization","task":"Memorization","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":6,"pages_in_order":11,"rows_per_page":100,"rows":[501,600],"of":1088,"counts":{"archive_papers_tagged":1088,"with_a_code_link":438,"where_syntology_ran_a_sample":177,"not_listed_spam_title":0,"listed":1088,"listed_where_code_ran":177,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":148,"every_run_a_failure_of_syntologys_instrument":29,"listed_with_a_run_with_no_instrument_failure":148,"listed_every_run_a_failure_of_syntologys_instrument":29,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/memorization","prev":"/task/memorization/papers/5","next":"/task/memorization/papers/7","papers":[{"url":null,"slug":"few-shot-generation-of-brain-tumors-for","title":"Few-Shot Generation of Brain Tumors for Secure and Fair Data Sharing","date":"2025-03-31","arxiv_id":"2504.00150","repositories_listed":0,"syntology":null},{"url":null,"slug":"winowhat-a-parallel-corpus-of-paraphrased","title":"WinoWhat: A Parallel Corpus of Paraphrased WinoGrande Sentences with Common Sense Categorization","date":"2025-03-31","arxiv_id":"2503.23779","repositories_listed":0,"syntology":null},{"url":null,"slug":"factored-agents-decoupling-in-context","title":"Factored Agents: Decoupling In-Context Learning and Memorization for Robust Tool Use","date":"2025-03-29","arxiv_id":"2503.22931","repositories_listed":0,"syntology":null},{"url":null,"slug":"suv-scalable-large-language-model-copyright","title":"SUV: Scalable Large Language Model Copyright Compliance with Regularized Selective Unlearning","date":"2025-03-29","arxiv_id":"2503.22948","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-reasoning-memorization-interplay-in","title":"The Reasoning-Memorization Interplay in Language Models Is Mediated by a Single Direction","date":"2025-03-29","arxiv_id":"2503.23084","repositories_listed":0,"syntology":null},{"url":null,"slug":"malicious-and-unintentional-disclosure-risks","title":"Malicious and Unintentional Disclosure Risks in Large Language Models for Code Generation","date":"2025-03-27","arxiv_id":"2503.22760","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantifying-the-ease-of-reproducing-training","title":"Quantifying the Ease of Reproducing Training Data in Unconditional Diffusion Models","date":"2025-03-25","arxiv_id":"2503.19429","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploring-the-hidden-reasoning-process-of","title":"Exploring the Hidden Reasoning Process of Large Language Models by Misleading Them","date":"2025-03-20","arxiv_id":"2503.16401","repositories_listed":0,"syntology":null},{"url":null,"slug":"blia-detect-model-memorization-in-binary","title":"BLIA: Detect model memorization in binary classification model through passive Label Inference attack","date":"2025-03-17","arxiv_id":"2503.12801","repositories_listed":0,"syntology":null},{"url":null,"slug":"empirical-privacy-variance","title":"Empirical Privacy Variance","date":"2025-03-16","arxiv_id":"2503.12314","repositories_listed":0,"syntology":null},{"url":null,"slug":"privacyscalpel-enhancing-llm-privacy-via","title":"PrivacyScalpel: Enhancing LLM Privacy via Interpretable Feature Intervention with Sparse Autoencoders","date":"2025-03-14","arxiv_id":"2503.11232","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynacode-a-dynamic-complexity-aware-code","title":"DynaCode: A Dynamic Complexity-Aware Code Benchmark for Evaluating Large Language Models in Code Generation","date":"2025-03-13","arxiv_id":"2503.10452","repositories_listed":0,"syntology":null},{"url":null,"slug":"trustworthy-machine-learning-via-memorization","title":"Trustworthy Machine Learning via Memorization and the Granular Long-Tail: A Survey on Interactions, Tradeoffs, and Beyond","date":"2025-03-10","arxiv_id":"2503.07501","repositories_listed":0,"syntology":null},{"url":null,"slug":"privacy-auditing-of-large-language-models","title":"Privacy Auditing of Large Language Models","date":"2025-03-09","arxiv_id":"2503.06808","repositories_listed":0,"syntology":null},{"url":null,"slug":"mitigating-memorization-in-llms-using","title":"Mitigating Memorization in LLMs using Activation Steering","date":"2025-03-08","arxiv_id":"2503.06040","repositories_listed":0,"syntology":null},{"url":null,"slug":"cmmcot-enhancing-complex-multi-image","title":"CMMCoT: Enhancing Complex Multi-Image Comprehension via Multi-Modal Chain-of-Thought and Memory Augmentation","date":"2025-03-07","arxiv_id":"2503.05255","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-kgqa-a-scalable-framework-for","title":"Dynamic-KGQA: A Scalable Framework for Generating Adaptive Question Answering Datasets","date":"2025-03-06","arxiv_id":"2503.05049","repositories_listed":0,"syntology":null},{"url":null,"slug":"memorize-or-generalize-evaluating-llm-code","title":"Memorize or Generalize? Evaluating LLM Code Generation with Evolved Questions","date":"2025-03-04","arxiv_id":"2503.02296","repositories_listed":0,"syntology":null},{"url":null,"slug":"privacy-preserving-fair-synthetic-tabular","title":"Privacy-Preserving Fair Synthetic Tabular Data","date":"2025-03-04","arxiv_id":"2503.02968","repositories_listed":0,"syntology":null},{"url":null,"slug":"superficial-self-improved-reasoners-benefit","title":"Superficial Self-Improved Reasoners Benefit from Model Merging","date":"2025-03-03","arxiv_id":"2503.02103","repositories_listed":0,"syntology":null},{"url":null,"slug":"asynchronous-personalized-federated-learning","title":"Asynchronous Personalized Federated Learning through Global Memorization","date":"2025-03-01","arxiv_id":"2503.00407","repositories_listed":0,"syntology":null},{"url":null,"slug":"holistic-audit-dataset-generation-for-llm","title":"Holistic Audit Dataset Generation for LLM Unlearning via Knowledge Graph Traversal and Redundancy Removal","date":"2025-02-26","arxiv_id":"2502.18810","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-interpolation-effect-of-score","title":"On the Interpolation Effect of Score Smoothing","date":"2025-02-26","arxiv_id":"2502.19499","repositories_listed":0,"syntology":null},{"url":null,"slug":"igda-interactive-graph-discovery-through","title":"IGDA: Interactive Graph Discovery through Large Language Model Agents","date":"2025-02-24","arxiv_id":"2502.17189","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-dichotomy-between-privacy-and","title":"On the Dichotomy Between Privacy and Traceability in $\\ell_p$ Stochastic Convex Optimization","date":"2025-02-24","arxiv_id":"2502.17384","repositories_listed":0,"syntology":null},{"url":null,"slug":"reasoning-with-latent-thoughts-on-the-power","title":"Reasoning with Latent Thoughts: On the Power of Looped Transformers","date":"2025-02-24","arxiv_id":"2502.17416","repositories_listed":0,"syntology":null},{"url":null,"slug":"swallowing-the-poison-pills-insights-from","title":"Swallowing the Poison Pills: Insights from Vulnerability Disparity Among LLMs","date":"2025-02-23","arxiv_id":"2502.18518","repositories_listed":0,"syntology":null},{"url":null,"slug":"interrogating-llm-design-under-a-fair","title":"Interrogating LLM design under a fair learning doctrine","date":"2025-02-22","arxiv_id":"2502.16290","repositories_listed":0,"syntology":null},{"url":null,"slug":"copyjudge-automated-copyright-infringement","title":"CopyJudge: Automated Copyright Infringement Identification and Mitigation in Text-to-Image Diffusion Models","date":"2025-02-21","arxiv_id":"2502.15278","repositories_listed":0,"syntology":null},{"url":null,"slug":"generative-ai-training-and-copyright-law","title":"Generative AI Training and Copyright Law","date":"2025-02-21","arxiv_id":"2502.15858","repositories_listed":0,"syntology":null},{"url":null,"slug":"lift-improving-long-context-understanding-of","title":"LIFT: Improving Long Context Understanding of Large Language Models through Long Input Fine-Tuning","date":"2025-02-20","arxiv_id":"2502.14644","repositories_listed":0,"syntology":null},{"url":null,"slug":"obliviate-efficient-unmemorization-for","title":"Obliviate: Efficient Unmemorization for Protecting Intellectual Property in Large Language Models","date":"2025-02-20","arxiv_id":"2502.15010","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantifying-memorization-and-retriever","title":"Quantifying Memorization and Retriever Performance in Retrieval-Augmented Vision-Language Models","date":"2025-02-19","arxiv_id":"2502.13836","repositories_listed":0,"syntology":null},{"url":null,"slug":"none-of-the-others-a-general-technique-to","title":"None of the Others: a General Technique to Distinguish Reasoning from Memorization in Multiple-Choice LLM Evaluation Benchmarks","date":"2025-02-18","arxiv_id":"2502.12896","repositories_listed":0,"syntology":null},{"url":null,"slug":"pruning-as-a-defense-reducing-memorization-in","title":"Pruning as a Defense: Reducing Memorization in Large Language Models","date":"2025-02-18","arxiv_id":"2502.15796","repositories_listed":0,"syntology":null},{"url":null,"slug":"continual-learning-should-move-beyond","title":"Continual Learning Should Move Beyond Incremental Classification","date":"2025-02-17","arxiv_id":"2502.11927","repositories_listed":0,"syntology":null},{"url":null,"slug":"rethinking-benign-overfitting-in-two-layer","title":"Rethinking Benign Overfitting in Two-Layer Neural Networks","date":"2025-02-17","arxiv_id":"2502.11893","repositories_listed":0,"syntology":null},{"url":null,"slug":"logarithmic-width-suffices-for-robust","title":"Logarithmic Width Suffices for Robust Memorization","date":"2025-02-16","arxiv_id":"2502.11162","repositories_listed":0,"syntology":null},{"url":null,"slug":"retrieval-augmented-encoders-for-extreme","title":"Retrieval-augmented Encoders for Extreme Multi-label Text Classification","date":"2025-02-15","arxiv_id":"2502.10615","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-vendiscope-an-algorithmic-microscope-for","title":"The Vendiscope: An Algorithmic Microscope For Data Collections","date":"2025-02-15","arxiv_id":"2502.10828","repositories_listed":0,"syntology":null},{"url":null,"slug":"diffusing-debias-a-recipe-for-turning-a-bug","title":"Diffusing DeBias: a Recipe for Turning a Bug into a Feature","date":"2025-02-13","arxiv_id":"2502.09564","repositories_listed":0,"syntology":null},{"url":null,"slug":"democratizing-ai-open-source-scalable-llm","title":"Democratizing AI: Open-source Scalable LLM Training on GPU-based Supercomputers","date":"2025-02-12","arxiv_id":"2502.08145","repositories_listed":0,"syntology":null},{"url":null,"slug":"captured-by-captions-on-memorization-and-its","title":"Captured by Captions: On Memorization and its Mitigation in CLIP Models","date":"2025-02-11","arxiv_id":"2502.07830","repositories_listed":0,"syntology":null},{"url":null,"slug":"math-perturb-benchmarking-llms-math-reasoning","title":"MATH-Perturb: Benchmarking LLMs' Math Reasoning Abilities against Hard Perturbations","date":"2025-02-10","arxiv_id":"2502.06453","repositories_listed":0,"syntology":null},{"url":null,"slug":"mitigating-sensitive-information-leakage-in","title":"Mitigating Sensitive Information Leakage in LLMs4Code through Machine Unlearning","date":"2025-02-09","arxiv_id":"2502.05739","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-lightweight-method-to-disrupt-memorized","title":"A Lightweight Method to Disrupt Memorized Sequences in LLM","date":"2025-02-07","arxiv_id":"2502.05159","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-analysis-for-reasoning-bias-of-language","title":"An Analysis for Reasoning Bias of Language Models with Small Initialization","date":"2025-02-05","arxiv_id":"2502.04375","repositories_listed":0,"syntology":null},{"url":null,"slug":"taking-a-big-step-large-learning-rates-in","title":"Taking a Big Step: Large Learning Rates in Denoising Score Matching Prevent Memorization","date":"2025-02-05","arxiv_id":"2502.03435","repositories_listed":0,"syntology":null},{"url":null,"slug":"tremu-towards-neuro-symbolic-temporal","title":"TReMu: Towards Neuro-Symbolic Temporal Reasoning for LLM-Agents with Memory in Multi-Session Dialogues","date":"2025-02-03","arxiv_id":"2502.01630","repositories_listed":0,"syntology":null},{"url":null,"slug":"compositional-generalization-requires-more","title":"Compositional Generalization Requires More Than Disentangled Representations","date":"2025-01-30","arxiv_id":"2501.18797","repositories_listed":0,"syntology":null},{"url":null,"slug":"integrating-lmm-planners-and-3d-skill","title":"Integrating LMM Planners and 3D Skill Policies for Generalizable Manipulation","date":"2025-01-30","arxiv_id":"2501.18733","repositories_listed":0,"syntology":null},{"url":null,"slug":"funu-boosting-machine-unlearning-efficiency","title":"FUNU: Boosting Machine Unlearning Efficiency by Filtering Unnecessary Unlearning","date":"2025-01-28","arxiv_id":"2501.16614","repositories_listed":0,"syntology":null},{"url":null,"slug":"memorize-and-rank-elevating-large-language","title":"Memorize and Rank: Elevating Large Language Models for Clinical Diagnosis Prediction","date":"2025-01-28","arxiv_id":"2501.17326","repositories_listed":0,"syntology":null},{"url":null,"slug":"sft-memorizes-rl-generalizes-a-comparative","title":"SFT Memorizes, RL Generalizes: A Comparative Study of Foundation Model Post-training","date":"2025-01-28","arxiv_id":"2501.17161","repositories_listed":0,"syntology":null},{"url":null,"slug":"decoding-generalization-from-memorization-in","title":"Decoding Generalization from Memorization in Deep Neural Networks","date":"2025-01-24","arxiv_id":"2501.14687","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-reasoning-capacity-of-ai-models-and","title":"On the Reasoning Capacity of AI Models and How to Quantify It","date":"2025-01-23","arxiv_id":"2501.13833","repositories_listed":0,"syntology":null},{"url":null,"slug":"rpo-retrieval-preference-optimization-for","title":"RPO: Retrieval Preference Optimization for Robust Retrieval-Augmented Generation","date":"2025-01-23","arxiv_id":"2501.13726","repositories_listed":0,"syntology":null},{"url":null,"slug":"test-time-regression-a-unifying-framework-for","title":"Test-time regression: a unifying framework for designing sequence models with associative memory","date":"2025-01-21","arxiv_id":"2501.12352","repositories_listed":0,"syntology":null},{"url":null,"slug":"synthetic-data-can-mislead-evaluations","title":"Synthetic Data Can Mislead Evaluations: Membership Inference as Machine Text Detection","date":"2025-01-20","arxiv_id":"2501.11786","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-generalization-in-chain-of-thought","title":"Enhancing Generalization in Chain of Thought Reasoning for Smaller Models","date":"2025-01-16","arxiv_id":"2501.09804","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-and-mitigating-membership","title":"Modeling Neural Networks with Privacy Using Neural Stochastic Differential Equations","date":"2025-01-12","arxiv_id":"2501.06686","repositories_listed":0,"syntology":null},{"url":null,"slug":"chronosense-exploring-temporal-understanding","title":"ChronoSense: Exploring Temporal Understanding in Large Language Models with Time Intervals of Events","date":"2025-01-06","arxiv_id":"2501.03040","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-memorization-and-rumination-for-pre","title":"Knowledge Memorization and Rumination for Pre-trained Model-based Class-Incremental Learning","date":"2025-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"representation-in-large-language-models","title":"Representation in large language models","date":"2025-01-01","arxiv_id":"2501.00885","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-silent-majority-demystifying-memorization","title":"Uncovering Memorization Effect in the Presence of Spurious Correlations","date":"2025-01-01","arxiv_id":"2501.00961","repositories_listed":0,"syntology":null},{"url":null,"slug":"variance-based-membership-inference-attacks","title":"Variance-Based Membership Inference Attacks Against Large-Scale Image Captioning Models","date":"2025-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"elucidating-flow-matching-ode-dynamics-with","title":"Elucidating Flow Matching ODE Dynamics with Respect to Data Geometries","date":"2024-12-25","arxiv_id":"2412.18730","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-impact-of-input-order-bias-on-large","title":"The Impact of Input Order Bias on Large Language Models for Software Fault Localization","date":"2024-12-25","arxiv_id":"2412.18750","repositories_listed":0,"syntology":null},{"url":null,"slug":"think-or-remember-detecting-and-directing","title":"Think or Remember? Detecting and Directing LLMs Towards Memorization or Generalization","date":"2024-12-24","arxiv_id":"2412.18497","repositories_listed":0,"syntology":null},{"url":null,"slug":"accessing-the-topological-properties-of-human","title":"Accessing the topological properties of human brain functional sub-circuits in Echo State Networks","date":"2024-12-19","arxiv_id":"2412.14999","repositories_listed":0,"syntology":null},{"url":null,"slug":"memorization-over-reasoning-exposing-and","title":"Memorization Over Reasoning? Exposing and Mitigating Verbatim Memorization in Large Language Models' Character Understanding Evaluation","date":"2024-12-18","arxiv_id":"2412.14368","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-boundary-of-large-language-models-a","title":"Knowledge Boundary of Large Language Models: A Survey","date":"2024-12-17","arxiv_id":"2412.12472","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-impact-of-generalization-techniques-on","title":"The Impact of Generalization Techniques on the Interplay Among Privacy, Utility, and Fairness in Image Classification","date":"2024-12-16","arxiv_id":"2412.11951","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-and-mitigating-memorization-in","title":"Understanding and Mitigating Memorization in Diffusion Models for Tabular Data","date":"2024-12-15","arxiv_id":"2412.11044","repositories_listed":0,"syntology":null},{"url":null,"slug":"too-big-to-fool-resisting-deception-in","title":"Too Big to Fool: Resisting Deception in Language Models","date":"2024-12-13","arxiv_id":"2412.10558","repositories_listed":0,"syntology":null},{"url":null,"slug":"when-can-memorization-improve-fairness","title":"When Can Memorization Improve Fairness?","date":"2024-12-12","arxiv_id":"2412.09254","repositories_listed":0,"syntology":null},{"url":null,"slug":"underestimated-privacy-risks-for-minority","title":"Underestimated Privacy Risks for Minority Populations in Large Language Model Unlearning","date":"2024-12-11","arxiv_id":"2412.08559","repositories_listed":0,"syntology":null},{"url":null,"slug":"memhunter-automated-and-verifiable","title":"MemHunter: Automated and Verifiable Memorization Detection at Dataset-scale in LLMs","date":"2024-12-10","arxiv_id":"2412.07261","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploring-memorization-and-copyright","title":"Exploring Memorization and Copyright Violation in Frontier LLMs: A Study of the New York Times v. OpenAI 2023 Lawsuit","date":"2024-12-09","arxiv_id":"2412.06370","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-noisy-correspondence-learning-via-self","title":"Robust Noisy Correspondence Learning via Self-Drop and Dual-Weight","date":"2024-12-09","arxiv_id":"2412.06172","repositories_listed":0,"syntology":null},{"url":null,"slug":"sometimes-i-am-a-tree-data-drives-unstable","title":"Sometimes I am a Tree: Data Drives Unstable Hierarchical Generalization","date":"2024-12-05","arxiv_id":"2412.04619","repositories_listed":0,"syntology":null},{"url":null,"slug":"t2i-factualbench-benchmarking-the-factuality","title":"T2I-FactualBench: Benchmarking the Factuality of Text-to-Image Models with Knowledge-Intensive Concepts","date":"2024-12-05","arxiv_id":"2412.04300","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-memorization-in-generative","title":"Understanding Memorization in Generative Models via Sharpness in Probability Landscapes","date":"2024-12-05","arxiv_id":"2412.04140","repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-localized-machine-unlearning-through","title":"Improved Localized Machine Unlearning Through the Lens of Memorization","date":"2024-12-03","arxiv_id":"2412.02432","repositories_listed":0,"syntology":null},{"url":null,"slug":"copyrightshield-spatial-similarity-guided","title":"CopyrightShield: Spatial Similarity Guided Backdoor Defense against Copyright Infringement in Diffusion Models","date":"2024-12-02","arxiv_id":"2412.01528","repositories_listed":0,"syntology":null},{"url":null,"slug":"detecting-memorization-in-large-language","title":"Detecting Memorization in Large Language Models","date":"2024-12-02","arxiv_id":"2412.01014","repositories_listed":0,"syntology":null},{"url":null,"slug":"loyaldiffusion-a-diffusion-model-guarding","title":"LoyalDiffusion: A Diffusion Model Guarding Against Data Replication","date":"2024-12-02","arxiv_id":"2412.01118","repositories_listed":0,"syntology":null},{"url":null,"slug":"learned-random-label-predictions-as-a-neural","title":"Learned Random Label Predictions as a Neural Network Complexity Metric","date":"2024-11-29","arxiv_id":"2411.19640","repositories_listed":0,"syntology":null},{"url":null,"slug":"integrating-functionalities-to-a-system-via","title":"Integrating Functionalities To A System Via Autoencoder Hippocampus Network","date":"2024-11-28","arxiv_id":"2412.09635","repositories_listed":0,"syntology":null},{"url":null,"slug":"differential-learning-kinetics-govern-the","title":"Differential learning kinetics govern the transition from memorization to generalization during in-context learning","date":"2024-11-27","arxiv_id":"2412.00104","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-memorization-to-generalization-a","title":"A solvable generative model with a linear, one-step denoiser","date":"2024-11-26","arxiv_id":"2411.17807","repositories_listed":0,"syntology":null},{"url":null,"slug":"are-large-language-models-memorizing-bug","title":"Are Large Language Models Memorizing Bug Benchmarks?","date":"2024-11-20","arxiv_id":"2411.13323","repositories_listed":0,"syntology":null},{"url":null,"slug":"branches-assemble-multi-branch-cooperation","title":"Branches, Assemble! Multi-Branch Cooperation Network for Large-Scale Click-Through Rate Prediction at Taobao","date":"2024-11-20","arxiv_id":"2411.13057","repositories_listed":0,"syntology":null},{"url":null,"slug":"vertical-validation-evaluating-implicit","title":"Vertical Validation: Evaluating Implicit Generative Models for Graphs on Thin Support Regions","date":"2024-11-20","arxiv_id":"2411.13358","repositories_listed":0,"syntology":null},{"url":null,"slug":"education-in-the-era-of-neurosymbolic-ai","title":"Education in the Era of Neurosymbolic AI","date":"2024-11-16","arxiv_id":"2411.12763","repositories_listed":0,"syntology":null},{"url":null,"slug":"measuring-non-adversarial-reproduction-of","title":"Measuring Non-Adversarial Reproduction of Training Data in Large Language Models","date":"2024-11-15","arxiv_id":"2411.10242","repositories_listed":0,"syntology":null},{"url":null,"slug":"unlearning-in-vs-out-of-distribution-data-in","title":"Unlearning in- vs. out-of-distribution data in LLMs under gradient-based method","date":"2024-11-07","arxiv_id":"2411.04388","repositories_listed":0,"syntology":null},{"url":null,"slug":"lshbloom-memory-efficient-extreme-scale","title":"LSHBloom: Memory-efficient, Extreme-scale Document Deduplication","date":"2024-11-06","arxiv_id":"2411.04257","repositories_listed":0,"syntology":null},{"url":null,"slug":"extracting-unlearned-information-from-llms","title":"Extracting Unlearned Information from LLMs with Activation Steering","date":"2024-11-04","arxiv_id":"2411.02631","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalizability-of-memorization-neural","title":"Generalizability of Memorization Neural Networks","date":"2024-11-01","arxiv_id":"2411.00372","repositories_listed":0,"syntology":null}],"record_sha256":"4a16f14f10d4154a8df0d09bb39840c638a74eaebe42323b6a15059475da4580","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}