{"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/differentially-private-quantiles-with-smaller","title":"Differentially Private Quantiles with Smaller Error","arxiv_id":"2505.13662","date":"2025-05-19","proceeding":null,"authors":["Jacob Imola","Fabrizio Boninsegna","Hannah Keller","Anders Aamand","Amrita Roy Chowdhury","Rasmus Pagh"],"abstract":"In the approximate quantiles problem, the goal is to output $m$ quantile estimates, the ranks of which are as close as possible to $m$ given quantiles $0 \\leq q_1 \\leq\\dots \\leq q_m \\leq 1$. We present a mechanism for approximate quantiles that satisfies $\\varepsilon$-differential privacy for a dataset of $n$ real numbers where the ratio between the distance between the closest pair of points and the size of the domain is bounded by $\\psi$. As long as the minimum gap between quantiles is sufficiently large, $|q_i-q_{i-1}|\\geq \\Omega\\left(\\frac{m\\log(m)\\log(\\psi)}{n\\varepsilon}\\right)$ for all $i$, the maximum rank error of our mechanism is $O\\left(\\frac{\\log(\\psi) + \\log^2(m)}{\\varepsilon}\\right)$ with high probability. Previously, the best known algorithm under pure DP was due to Kaplan, Schnapp, and Stemmer~(ICML '22), who achieved a bound of $O\\left(\\frac{\\log(\\psi)\\log^2(m) + \\log^3(m)}{\\varepsilon}\\right)$. Our improvement stems from the use of continual counting techniques which allows the quantiles to be randomized in a correlated manner. We also present an $(\\varepsilon,\\delta)$-differentially private mechanism that relaxes the gap assumption without affecting the error bound, improving on existing methods when $\\delta$ is sufficiently close to zero. We provide experimental evaluation which confirms that our mechanism performs favorably compared to prior work in practice, in particular when the number of quantiles $m$ is large.","url_abs":"https://arxiv.org/abs/2505.13662v1","url_pdf":"https://arxiv.org/pdf/2505.13662v1.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":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"differentially-private-quantiles-with-smaller","repo_url":"https://github.com/nynsenfaber/dp_cc_quantiles","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2505.13662","atlas_url":"https://app.syntology.ai/?focus=2505.13662","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.13662"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2505.13662"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2505.13662"},"call":"get_harvested_code_for_paper(arxiv_id=\"2505.13662\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2505.13662"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2505.13662\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2505.13662"},"call":"get_concepts_for_paper(arxiv_id=\"2505.13662\")"}],"by_repo":[{"repo":"nynsenfaber/dp_cc_quantiles","kind":"official","samples":3,"ran":3,"instrument":2,"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","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2505.13662.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2505.13662.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/nynsenfaber/dp_cc_quantiles","reach":null}],"summary":{"ran_fixture":1,"ran_honours":1,"ran_draft_wrong":1},"n_samples":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"official":{"samples":3,"ran":3,"n_ran_checked":1,"n_instrument":2,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":3,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":3,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-22","last":"2026-09-22","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"1e0948b9ea245170","code_sha256_prefix":"1e0948b9ea245170","entry":"gaussian_noise","repo":"nynsenfaber/dp_cc_quantiles","repo_kind":"official","path":"DP_AQ/approximate_quantiles_algo.py","file_url":"https://github.com/nynsenfaber/dp_cc_quantiles/blob/HEAD/DP_AQ/approximate_quantiles_algo.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"signature":"array:ndarray/1/float, bounds:tuple/1/float, scale:float/0/float","fixture_out_type":"tuple","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/gaussian-noise","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, nynsenfaber/dp_cc_quantiles when it was checked","mcp_get_code":{"code_sha256":"1e0948b9ea245170"}},{"code_sha256":"d79b89dd0f7194d5","code_sha256_prefix":"d79b89dd0f7194d5","entry":"get_epsilon","repo":"nynsenfaber/dp_cc_quantiles","repo_kind":"official","path":"DP_AQ/approximate_quantiles_algo.py","file_url":"https://github.com/nynsenfaber/dp_cc_quantiles/blob/HEAD/DP_AQ/approximate_quantiles_algo.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"signature":"n_quantiles:int/0/int, epsilon:float/0/float, swap:bool/0/bool, cdp:bool/0/bool","fixture_out_type":"float64","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/get-epsilon","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, nynsenfaber/dp_cc_quantiles when it was checked","mcp_get_code":{"code_sha256":"d79b89dd0f7194d5"}},{"code_sha256":"ce6ac562b436bde3","code_sha256_prefix":"ce6ac562b436bde3","entry":"split_by_number","repo":"nynsenfaber/dp_cc_quantiles","repo_kind":"official","path":"DP_AQ/approximate_quantiles_algo.py","file_url":"https://github.com/nynsenfaber/dp_cc_quantiles/blob/HEAD/DP_AQ/approximate_quantiles_algo.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"signature":"array:ndarray/1/float, m:float/0/float","fixture_out_type":"tuple","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, nynsenfaber/dp_cc_quantiles when it was checked","mcp_get_code":{"code_sha256":"ce6ac562b436bde3"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"abf49584744cb292b6268499b788d33d5c26e16a83bba4bb24da70d80d23a84c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}