A new (epsilon, delta)-DP algorithm computes an alpha-multiplicative geometric median approximation in O~(nd + d/alpha^2) time, matching the optimal sample complexity of prior work.
Differentially-private clustering of easy instances
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Private Geometric Median in Nearly-Linear Time
A new (epsilon, delta)-DP algorithm computes an alpha-multiplicative geometric median approximation in O~(nd + d/alpha^2) time, matching the optimal sample complexity of prior work.