A Joint Exponential Mechanism For Differentially Private Top-$k

A Joint Exponential Mechanism For Differentially Private Top-$k

We present a differentially private algorithm for releasing the sequence of $k$ elements with the highest counts from a data domain of $d$ elements. The algorithm is a "joint" instance of the exponential mechanism, and its output space consists of all $O(d^k)$ length-$k$ sequences. Our mai...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Gillenwater, Jennifer, Joseph, Matthew, Medina, Andrés Muñoz, Ribero, Mónica
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Cryptography and Security
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Gillenwater, Jennifer
Joseph, Matthew
Medina, Andrés Muñoz
Ribero, Mónica
description We present a differentially private algorithm for releasing the sequence of $k$ elements with the highest counts from a data domain of $d$ elements. The algorithm is a "joint" instance of the exponential mechanism, and its output space consists of all $O(d^k)$ length-$k$ sequences. Our main contribution is a method to sample this exponential mechanism in time $O(dk\log(k) + d\log(d))$ and space $O(dk)$. Experiments show that this approach outperforms existing pure differential privacy methods and improves upon even approximate differential privacy methods for moderate $k$.
doi_str_mv 10.48550/arxiv.2201.12333
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2201_12333</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2201_12333</sourcerecordid><originalsourceid>FETCH-LOGICAL-a673-86053be2c584b1d1e3002741cacbdda9469181f1e6d5a5aea5c7aa3944f6ddcb3</originalsourceid><addsrcrecordid>eNotzz1vwjAUhWEvHSrKD-hUD12T-vraTjIhRKEfomqH7NGNP1SLkEQmQvDvUaHTGV7pSA9jjyByVWotXiid4jGXUkAOEhHv2WLJP4fYT3x9Gofe91Okjn95-0t9POz5Zkj8NYbg0y11Z_6T4pEmz-thzJ53D-wuUHfw8_-dsXqzrlfv2fb77WO13GZkCsxKIzS2XlpdqhYceBRCFgos2dY5qpSpoIQA3jhNmjxpWxBhpVQwztkWZ-zpdnsVNGOKe0rn5k_SXCV4AVQQQzg</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A Joint Exponential Mechanism For Differentially Private Top-$k</title><source>arXiv.org</source><creator>Gillenwater, Jennifer ; Joseph, Matthew ; Medina, Andrés Muñoz ; Ribero, Mónica</creator><creatorcontrib>Gillenwater, Jennifer ; Joseph, Matthew ; Medina, Andrés Muñoz ; Ribero, Mónica</creatorcontrib><description>We present a differentially private algorithm for releasing the sequence of $k$ elements with the highest counts from a data domain of $d$ elements. The algorithm is a "joint" instance of the exponential mechanism, and its output space consists of all $O(d^k)$ length-$k$ sequences. Our main contribution is a method to sample this exponential mechanism in time $O(dk\log(k) + d\log(d))$ and space $O(dk)$. Experiments show that this approach outperforms existing pure differential privacy methods and improves upon even approximate differential privacy methods for moderate $k$.</description><identifier>DOI: 10.48550/arxiv.2201.12333</identifier><language>eng</language><subject>Computer Science - Cryptography and Security</subject><creationdate>2022-01</creationdate><rights>http://creativecommons.org/licenses/by/4.0</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>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2201.12333$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2201.12333$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Gillenwater, Jennifer</creatorcontrib><creatorcontrib>Joseph, Matthew</creatorcontrib><creatorcontrib>Medina, Andrés Muñoz</creatorcontrib><creatorcontrib>Ribero, Mónica</creatorcontrib><title>A Joint Exponential Mechanism For Differentially Private Top-$k</title><description>We present a differentially private algorithm for releasing the sequence of $k$ elements with the highest counts from a data domain of $d$ elements. The algorithm is a "joint" instance of the exponential mechanism, and its output space consists of all $O(d^k)$ length-$k$ sequences. Our main contribution is a method to sample this exponential mechanism in time $O(dk\log(k) + d\log(d))$ and space $O(dk)$. Experiments show that this approach outperforms existing pure differential privacy methods and improves upon even approximate differential privacy methods for moderate $k$.</description><subject>Computer Science - Cryptography and Security</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzz1vwjAUhWEvHSrKD-hUD12T-vraTjIhRKEfomqH7NGNP1SLkEQmQvDvUaHTGV7pSA9jjyByVWotXiid4jGXUkAOEhHv2WLJP4fYT3x9Gofe91Okjn95-0t9POz5Zkj8NYbg0y11Z_6T4pEmz-thzJ53D-wuUHfw8_-dsXqzrlfv2fb77WO13GZkCsxKIzS2XlpdqhYceBRCFgos2dY5qpSpoIQA3jhNmjxpWxBhpVQwztkWZ-zpdnsVNGOKe0rn5k_SXCV4AVQQQzg</recordid><startdate>20220128</startdate><enddate>20220128</enddate><creator>Gillenwater, Jennifer</creator><creator>Joseph, Matthew</creator><creator>Medina, Andrés Muñoz</creator><creator>Ribero, Mónica</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20220128</creationdate><title>A Joint Exponential Mechanism For Differentially Private Top-$k</title><author>Gillenwater, Jennifer ; Joseph, Matthew ; Medina, Andrés Muñoz ; Ribero, Mónica</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a673-86053be2c584b1d1e3002741cacbdda9469181f1e6d5a5aea5c7aa3944f6ddcb3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Computer Science - Cryptography and Security</topic><toplevel>online_resources</toplevel><creatorcontrib>Gillenwater, Jennifer</creatorcontrib><creatorcontrib>Joseph, Matthew</creatorcontrib><creatorcontrib>Medina, Andrés Muñoz</creatorcontrib><creatorcontrib>Ribero, Mónica</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Gillenwater, Jennifer</au><au>Joseph, Matthew</au><au>Medina, Andrés Muñoz</au><au>Ribero, Mónica</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Joint Exponential Mechanism For Differentially Private Top-$k</atitle><date>2022-01-28</date><risdate>2022</risdate><abstract>We present a differentially private algorithm for releasing the sequence of $k$ elements with the highest counts from a data domain of $d$ elements. The algorithm is a "joint" instance of the exponential mechanism, and its output space consists of all $O(d^k)$ length-$k$ sequences. Our main contribution is a method to sample this exponential mechanism in time $O(dk\log(k) + d\log(d))$ and space $O(dk)$. Experiments show that this approach outperforms existing pure differential privacy methods and improves upon even approximate differential privacy methods for moderate $k$.</abstract><doi>10.48550/arxiv.2201.12333</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2201.12333
ispartof
issn
language eng
recordid cdi_arxiv_primary_2201_12333
source arXiv.org
subjects Computer Science - Cryptography and Security
title A Joint Exponential Mechanism For Differentially Private Top-$k
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-25T16%3A46%3A50IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Joint%20Exponential%20Mechanism%20For%20Differentially%20Private%20Top-$k&rft.au=Gillenwater,%20Jennifer&rft.date=2022-01-28&rft_id=info:doi/10.48550/arxiv.2201.12333&rft_dat=%3Carxiv_GOX%3E2201_12333%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true