Optimal Rates for Pure {arepsilon}-Differentially Private Stochastic Convex Optimization with Heavy Tails
DGX agentarXiv:2604.06492v1 Announce Type: new Abstract: We study stochastic convex optimization (SCO) with heavy-tailed gradients under pure epsilon-differential privacy (DP). Instead of assuming a bound on t