{"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/learning-differentially-private-recurrent","title":"Learning Differentially Private Recurrent Language Models","arxiv_id":"1710.06963","date":"2017-10-18","proceeding":"ICLR 2018 1","authors":["H. Brendan McMahan","Daniel Ramage","Kunal Talwar","Li Zhang"],"abstract":"We demonstrate that it is possible to train large recurrent language models\nwith user-level differential privacy guarantees with only a negligible cost in\npredictive accuracy. Our work builds on recent advances in the training of deep\nnetworks on user-partitioned data and privacy accounting for stochastic\ngradient descent. In particular, we add user-level privacy protection to the\nfederated averaging algorithm, which makes \"large step\" updates from user-level\ndata. Our work demonstrates that given a dataset with a sufficiently large\nnumber of users (a requirement easily met by even small internet-scale\ndatasets), achieving differential privacy comes at the cost of increased\ncomputation, rather than in decreased utility as in most prior work. We find\nthat our private LSTM language models are quantitatively and qualitatively\nsimilar to un-noised models when trained on a large dataset.","url_abs":"http://arxiv.org/abs/1710.06963v3","url_pdf":"http://arxiv.org/pdf/1710.06963v3.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":"learning-differentially-private-recurrent","repo_url":"https://github.com/apple/ml-flair","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"NOASSERTION"}}],"tasks":[],"methods":[{"method_slug":"lstm","method_name":"LSTM"},{"method_slug":"sigmoid-activation","method_name":"Sigmoid Activation"},{"method_slug":"tanh-activation","method_name":"Tanh Activation"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1710.06963","atlas_url":"https://app.syntology.ai/?focus=1710.06963","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":"1710.06963"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1710.06963\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1710.06963"},"call":"get_concepts_for_paper(arxiv_id=\"1710.06963\")"}],"by_repo":[{"repo":"apple/ml-flair","kind":"listed","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":"4b4ccf799f6e5a39d52cbff6d20f0a20473f97eea345d9460a8dbdcce2ba9f5b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}