Iterative Methods for Private Synthetic Data: Unifying Framework and New Methods
We study private synthetic data generation for query release, where the goal is to construct a sanitized version of a sensitive dataset, subject to differential privacy, that approximately preserves the answers to a large collection of statistical queries. We first present an algorithmic framework t...
Gespeichert in:
Veröffentlicht in: | arXiv.org 2021-12 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | arXiv.org |
container_volume | |
creator | Liu, Terrance Vietri, Giuseppe Wu, Zhiwei Steven |
description | We study private synthetic data generation for query release, where the goal is to construct a sanitized version of a sensitive dataset, subject to differential privacy, that approximately preserves the answers to a large collection of statistical queries. We first present an algorithmic framework that unifies a long line of iterative algorithms in the literature. Under this framework, we propose two new methods. The first method, private entropy projection (PEP), can be viewed as an advanced variant of MWEM that adaptively reuses past query measurements to boost accuracy. Our second method, generative networks with the exponential mechanism (GEM), circumvents computational bottlenecks in algorithms such as MWEM and PEP by optimizing over generative models parameterized by neural networks, which capture a rich family of distributions while enabling fast gradient-based optimization. We demonstrate that PEP and GEM empirically outperform existing algorithms. Furthermore, we show that GEM nicely incorporates prior information from public data while overcoming limitations of PMW^Pub, the existing state-of-the-art method that also leverages public data. |
format | Article |
fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2541127869</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2541127869</sourcerecordid><originalsourceid>FETCH-proquest_journals_25411278693</originalsourceid><addsrcrecordid>eNqNi70KwjAYAIMgWLTv8IFzoU36p6tadFAK6lyC_WpTNdEkbenb66C70w13NyIOZSzw0pDSCXGNaXzfp3FCo4g5JN9Z1NyKDmGPtlalgUppyLXouEU4DtLWaMUF1tzyJZylqAYhr5Bp_sBe6RtwWcIB-98-I-OK3w26X07JPNucVlvvqdWrRWOLRrVaflRBozAIaJLGC_Zf9QZBVj6p</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2541127869</pqid></control><display><type>article</type><title>Iterative Methods for Private Synthetic Data: Unifying Framework and New Methods</title><source>Free E- Journals</source><creator>Liu, Terrance ; Vietri, Giuseppe ; Wu, Zhiwei Steven</creator><creatorcontrib>Liu, Terrance ; Vietri, Giuseppe ; Wu, Zhiwei Steven</creatorcontrib><description>We study private synthetic data generation for query release, where the goal is to construct a sanitized version of a sensitive dataset, subject to differential privacy, that approximately preserves the answers to a large collection of statistical queries. We first present an algorithmic framework that unifies a long line of iterative algorithms in the literature. Under this framework, we propose two new methods. The first method, private entropy projection (PEP), can be viewed as an advanced variant of MWEM that adaptively reuses past query measurements to boost accuracy. Our second method, generative networks with the exponential mechanism (GEM), circumvents computational bottlenecks in algorithms such as MWEM and PEP by optimizing over generative models parameterized by neural networks, which capture a rich family of distributions while enabling fast gradient-based optimization. We demonstrate that PEP and GEM empirically outperform existing algorithms. Furthermore, we show that GEM nicely incorporates prior information from public data while overcoming limitations of PMW^Pub, the existing state-of-the-art method that also leverages public data.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Iterative algorithms ; Iterative methods ; Neural networks ; Optimization ; Privacy ; Synthetic data</subject><ispartof>arXiv.org, 2021-12</ispartof><rights>2021. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>780,784</link.rule.ids></links><search><creatorcontrib>Liu, Terrance</creatorcontrib><creatorcontrib>Vietri, Giuseppe</creatorcontrib><creatorcontrib>Wu, Zhiwei Steven</creatorcontrib><title>Iterative Methods for Private Synthetic Data: Unifying Framework and New Methods</title><title>arXiv.org</title><description>We study private synthetic data generation for query release, where the goal is to construct a sanitized version of a sensitive dataset, subject to differential privacy, that approximately preserves the answers to a large collection of statistical queries. We first present an algorithmic framework that unifies a long line of iterative algorithms in the literature. Under this framework, we propose two new methods. The first method, private entropy projection (PEP), can be viewed as an advanced variant of MWEM that adaptively reuses past query measurements to boost accuracy. Our second method, generative networks with the exponential mechanism (GEM), circumvents computational bottlenecks in algorithms such as MWEM and PEP by optimizing over generative models parameterized by neural networks, which capture a rich family of distributions while enabling fast gradient-based optimization. We demonstrate that PEP and GEM empirically outperform existing algorithms. Furthermore, we show that GEM nicely incorporates prior information from public data while overcoming limitations of PMW^Pub, the existing state-of-the-art method that also leverages public data.</description><subject>Algorithms</subject><subject>Iterative algorithms</subject><subject>Iterative methods</subject><subject>Neural networks</subject><subject>Optimization</subject><subject>Privacy</subject><subject>Synthetic data</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNqNi70KwjAYAIMgWLTv8IFzoU36p6tadFAK6lyC_WpTNdEkbenb66C70w13NyIOZSzw0pDSCXGNaXzfp3FCo4g5JN9Z1NyKDmGPtlalgUppyLXouEU4DtLWaMUF1tzyJZylqAYhr5Bp_sBe6RtwWcIB-98-I-OK3w26X07JPNucVlvvqdWrRWOLRrVaflRBozAIaJLGC_Zf9QZBVj6p</recordid><startdate>20211209</startdate><enddate>20211209</enddate><creator>Liu, Terrance</creator><creator>Vietri, Giuseppe</creator><creator>Wu, Zhiwei Steven</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20211209</creationdate><title>Iterative Methods for Private Synthetic Data: Unifying Framework and New Methods</title><author>Liu, Terrance ; Vietri, Giuseppe ; Wu, Zhiwei Steven</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_25411278693</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Algorithms</topic><topic>Iterative algorithms</topic><topic>Iterative methods</topic><topic>Neural networks</topic><topic>Optimization</topic><topic>Privacy</topic><topic>Synthetic data</topic><toplevel>online_resources</toplevel><creatorcontrib>Liu, Terrance</creatorcontrib><creatorcontrib>Vietri, Giuseppe</creatorcontrib><creatorcontrib>Wu, Zhiwei Steven</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Liu, Terrance</au><au>Vietri, Giuseppe</au><au>Wu, Zhiwei Steven</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Iterative Methods for Private Synthetic Data: Unifying Framework and New Methods</atitle><jtitle>arXiv.org</jtitle><date>2021-12-09</date><risdate>2021</risdate><eissn>2331-8422</eissn><abstract>We study private synthetic data generation for query release, where the goal is to construct a sanitized version of a sensitive dataset, subject to differential privacy, that approximately preserves the answers to a large collection of statistical queries. We first present an algorithmic framework that unifies a long line of iterative algorithms in the literature. Under this framework, we propose two new methods. The first method, private entropy projection (PEP), can be viewed as an advanced variant of MWEM that adaptively reuses past query measurements to boost accuracy. Our second method, generative networks with the exponential mechanism (GEM), circumvents computational bottlenecks in algorithms such as MWEM and PEP by optimizing over generative models parameterized by neural networks, which capture a rich family of distributions while enabling fast gradient-based optimization. We demonstrate that PEP and GEM empirically outperform existing algorithms. Furthermore, we show that GEM nicely incorporates prior information from public data while overcoming limitations of PMW^Pub, the existing state-of-the-art method that also leverages public data.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | EISSN: 2331-8422 |
ispartof | arXiv.org, 2021-12 |
issn | 2331-8422 |
language | eng |
recordid | cdi_proquest_journals_2541127869 |
source | Free E- Journals |
subjects | Algorithms Iterative algorithms Iterative methods Neural networks Optimization Privacy Synthetic data |
title | Iterative Methods for Private Synthetic Data: Unifying Framework and New Methods |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-10T05%3A07%3A59IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Iterative%20Methods%20for%20Private%20Synthetic%20Data:%20Unifying%20Framework%20and%20New%20Methods&rft.jtitle=arXiv.org&rft.au=Liu,%20Terrance&rft.date=2021-12-09&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2541127869%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2541127869&rft_id=info:pmid/&rfr_iscdi=true |