# Privately Counting Partially Ordered Data

arXiv: https://arxiv.org/abs/2410.06881 · HTML: https://mlsanity.com/paper/2410.06881/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 9 Oct 2024.

## Built on by (most cited first, 1 of 1)

- [Continual Release Moment Estimation with Differential Privacy](https://mlsanity.com/paper/2502.06597/) (2025)

## Abstract (arXiv)

We consider differentially private counting when each data point consists of d bits satisfying a partial order. Our main technical contribution is a problem-specific K-norm mechanism that runs in time O(d2). Experiments show that, depending on the partial order in question, our solution dominates existing pure differentially private mechanisms, and can reduce their error by an order of magnitude or more.