<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/"
         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
<ListRecords>
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/oai_dc/"
           xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
           xmlns:dc="http://purl.org/dc/elements/1.1/"
           xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
           xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
   	<dc:title>Private counting of distinct elements in the turnstile model and extensions</dc:title>
   	<dc:title>LIPIcs</dc:title>
   	<dc:creator>Henzinger, Monika H ; https://orcid.org/0000-0002-5008-6530</dc:creator>
   	<dc:creator>Sricharan, A. R.</dc:creator>
   	<dc:creator>Steiner, Teresa Anna</dc:creator>
   	<dc:subject>ddc:000</dc:subject>
   	<dc:description>Privately counting distinct elements in a stream is a fundamental data analysis problem with many applications in machine learning. In the turnstile model, Jain et al. [NeurIPS2023] initiated the study of this problem parameterized by the maximum flippancy of any element, i.e., the number of times that the count of an element changes from 0 to above 0 or vice versa. They give an item-level (ε,δ)-differentially private algorithm whose additive error is tight with respect to that parameterization. In this work, we show that a very simple algorithm based on the sparse vector technique achieves a tight additive error for item-level (ε,δ)-differential privacy and item-level ε-differential privacy with regards to a different parameterization, namely the sum of all flippancies. Our second result is a bound which shows that for a large class of algorithms, including all existing differentially private algorithms for this problem, the lower bound from item-level differential privacy extends to event-level differential privacy. This partially answers an open question by Jain et al. [NeurIPS2023].</dc:description>
   	<dc:publisher>Schloss Dagstuhl - Leibniz-Zentrum für Informatik</dc:publisher>
   	<dc:date>2024</dc:date>
   	<dc:type>info:eu-repo/semantics/conferenceObject</dc:type>
   	<dc:type>doc-type:conferenceObject</dc:type>
   	<dc:type>text</dc:type>
   	<dc:type>http://purl.org/coar/resource_type/c_5794</dc:type>
   	<dc:identifier>https://research-explorer.ista.ac.at/record/18156</dc:identifier>
   	<dc:identifier>https://research-explorer.ista.ac.at/download/18156/18166</dc:identifier>
   	<dc:source>Henzinger M, Sricharan AR, Steiner TA. Private counting of distinct elements in the turnstile model and extensions. In: &lt;i&gt;International Conference on Approximation Algorithms for Combinatorial Optimization Problems &lt;/i&gt;. Vol 317. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:&lt;a href=&quot;https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.40&quot;&gt;10.4230/LIPIcs.APPROX/RANDOM.2024.40&lt;/a&gt;</dc:source>
   	<dc:language>eng</dc:language>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/doi/10.4230/LIPIcs.APPROX/RANDOM.2024.40</dc:relation>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/issn/1868-8969</dc:relation>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/isbn/9783959773485</dc:relation>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/wos/001545634500040</dc:relation>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/arxiv/2408.11637</dc:relation>
   	<dc:rights>https://creativecommons.org/licenses/by/4.0/</dc:rights>
   	<dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
</oai_dc:dc>
</ListRecords>
</OAI-PMH>
