{"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":"/paper/machine-learning-models-that-remember-too","title":"Machine Learning Models that Remember Too Much","arxiv_id":"1709.07886","date":"2017-09-22","proceeding":null,"authors":["Congzheng Song","Thomas Ristenpart","Vitaly Shmatikov"],"abstract":"Machine learning (ML) is becoming a commodity. Numerous ML frameworks and\nservices are available to data holders who are not ML experts but want to train\npredictive models on their data. It is important that ML models trained on\nsensitive inputs (e.g., personal images or documents) not leak too much\ninformation about the training data.\n  We consider a malicious ML provider who supplies model-training code to the\ndata holder, does not observe the training, but then obtains white- or\nblack-box access to the resulting model. In this setting, we design and\nimplement practical algorithms, some of them very similar to standard ML\ntechniques such as regularization and data augmentation, that \"memorize\"\ninformation about the training dataset in the model yet the model is as\naccurate and predictive as a conventionally trained model. We then explain how\nthe adversary can extract memorized information from the model.\n  We evaluate our techniques on standard ML tasks for image classification\n(CIFAR10), face recognition (LFW and FaceScrub), and text analysis (20\nNewsgroups and IMDB). In all cases, we show how our algorithms create models\nthat have high predictive power yet allow accurate extraction of subsets of\ntheir training data.","url_abs":"http://arxiv.org/abs/1709.07886v1","url_pdf":"http://arxiv.org/pdf/1709.07886v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"machine-learning-models-that-remember-too","repo_url":"https://github.com/csong27/ml-model-remember","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"machine-learning","task_name":"BIG-bench Machine Learning"},{"task_slug":"data-augmentation","task_name":"Data Augmentation"},{"task_slug":"face-recognition","task_name":"Face Recognition"},{"task_slug":"image-classification","task_name":"Image Classification"},{"task_slug":"image-classification","task_name":"image-classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1709.07886","atlas_url":"https://app.syntology.ai/?focus=1709.07886","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1709.07886"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1709.07886\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1709.07886"},"call":"get_concepts_for_paper(arxiv_id=\"1709.07886\")"}],"by_repo":[{"repo":"csong27/ml-model-remember","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"f62030105ed46913bad2be88a7f9dfe42280a8e05300db193d8e935a318f4f6c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}