{"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/dp-em-differentially-private-expectation","title":"DP-EM: Differentially Private Expectation Maximization","arxiv_id":"1605.06995","date":"2016-05-23","proceeding":null,"authors":["Mijung Park","Jimmy Foulds","Kamalika Chaudhuri","Max Welling"],"abstract":"The iterative nature of the expectation maximization (EM) algorithm presents\na challenge for privacy-preserving estimation, as each iteration increases the\namount of noise needed. We propose a practical private EM algorithm that\novercomes this challenge using two innovations: (1) a novel moment perturbation\nformulation for differentially private EM (DP-EM), and (2) the use of two\nrecently developed composition methods to bound the privacy \"cost\" of multiple\nEM iterations: the moments accountant (MA) and zero-mean concentrated\ndifferential privacy (zCDP). Both MA and zCDP bound the moment generating\nfunction of the privacy loss random variable and achieve a refined tail bound,\nwhich effectively decrease the amount of additive noise. We present empirical\nresults showing the benefits of our approach, as well as similar performance\nbetween these two composition methods in the DP-EM setting for Gaussian mixture\nmodels. Our approach can be readily extended to many iterative learning\nalgorithms, opening up various exciting future directions.","url_abs":"http://arxiv.org/abs/1605.06995v2","url_pdf":"http://arxiv.org/pdf/1605.06995v2.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":"dp-em-differentially-private-expectation","repo_url":"https://github.com/thehimalayanleo/Private-Generative-Models","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"privacy-preserving","task_name":"Privacy Preserving"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"thehimalayanleo/Private-Generative-Models","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":"c54aaa920a5bec794179e2783c94aac0c43531bdd7200b53f3fa9aa5975ca5ea","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}