#machine learning
Feb 2026
Differentially Private Non-convex Distributionally Robust Optimization
A comprehensive study of DP-(finite-sum)-DRO with $\psi$-divergence and non-convex loss, and a novel DP Double-Spider optimization method, called DP Double-Spider, tailored to this structure, which achieves a utility bound matching the best-known result for non-convex DP-ERM.
Di-Fei Xu, Meng Ding, Zebin Ma et al.
· arXiv.org · 2 citations