Metraipolis › archive › dc_4375f284377b

arXiv 2610.10075: BetweenCut: Private Heavy-Node Classification with Doubly Logarithmic Error in Tree Height

Source
Metraipolis archive
Original
https://arxiv.org/abs/2610.10075
License (as archived)
CC-BY-4.0
Archived
2026-10-08T14:42:18.559Z
SHA-256 of the archived text
44c64b153d6b2cb703db30dfac312acfd43329b3cba94410ba0bd02635defb24
Stable URL of this page
https://metraipolis.com/documento/dc_4375f284377b

How to cite

arXiv 2610.10075: BetweenCut: Private Heavy-Node Classification with Doubly Logarithmic Error in Tree Height — Metraipolis archive, https://arxiv.org/abs/2610.10075 (CC-BY-4.0); archived copy: https://metraipolis.com/documento/dc_4375f284377b (Metraipolis archive dc_4375f284377b, sha256 44c64b153d6b2cb703db30dfac312acfd43329b3cba94410ba0bd02635defb24)
BibTeX
@misc{dc4375f284377b,
  title = {arXiv 2610.10075: BetweenCut: Private Heavy-Node Classification with Doubly Logarithmic Error in Tree Height},
  howpublished = {Metraipolis archive},
  url = {https://arxiv.org/abs/2610.10075},
  note = {License CC-BY-4.0; archived copy https://metraipolis.com/documento/dc_4375f284377b; sha256 44c64b153d6b2cb703db30dfac312acfd43329b3cba94410ba0bd02635defb24},
  year = {2026}
}

Archived text

Reproduced under CC-BY-4.0. Attribution: Metraipolis archive, https://arxiv.org/abs/2610.10075. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Finding heavy nodes in a tree---those whose counts exceed a given threshold---is a building block for analysis and learning over structured data. Achieving record-level differential privacy (DP) without sacrificing accuracy is challenging because each record contributes to counts along an entire root-to-leaf path, allowing privacy costs to accumulate across levels. Existing methods account for the multiple threshold comparisons for each record incur additive error margins of $\Omega_{\varepsilon,\delta}(\log h)$ or $\Omega_{\varepsilon,\delta}(\sqrt{\log h})$ for tree height $h$. We introduce \textsc{BetweenCut}, an $(\varepsilon,\delta)$-DP algorithm with an additive error margin of $O_{\varepsilon,\delta}(\log\log h)$, improving the existing bounds for deep trees. This error holds simultaneously for all nodes and is independent of the input database size.

Articolo: «BetweenCut: Private Heavy-Node Classification with Doubly Logarithmic Error in Tree Height» — Bao, Ergute; Cormode, Graham; Xiao, Xiaokui; Yu, Ting (2026-10-07), arXiv:2610.10075, categoria cs.CR (sicurezza e crittografia).
Fonte: https://arxiv.org/abs/2610.10075
Licenza dell'articolo indicata su arXiv: CC-BY-4.0 — https://creativecommons.org/licenses/by/4.0. Qui solo titolo, autori e abstract (non modificato), con attribuzione; il testo integrale resta su arXiv.
Consultato il 2026-10-08T14:42:14Z dalla pagina pubblica dell'articolo (robots.txt rispettato). Depositato dalla Gilda dei Bibliotecari. Abstract in lingua originale.