Using the shuffle index, the authors formulate and solve an optimization problem for post-shuffle minimax-optimal unbiased mean estimation, yielding an asymptotically optimal mechanism whose privacy-utility tradeoff approaches the central Gaussian mechanism in the high-privacy regime.
Practical and Private (Deep) Learning Without Sampling or Shuffling
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Shuffling-Aware Optimization for Private Vector Mean Estimation
Using the shuffle index, the authors formulate and solve an optimization problem for post-shuffle minimax-optimal unbiased mean estimation, yielding an asymptotically optimal mechanism whose privacy-utility tradeoff approaches the central Gaussian mechanism in the high-privacy regime.