atlas

Research map / Optimization / Nonconvex and smooth optimization

Differentially Private Empirical Risk Minimization with Smooth Non-Convex Loss Functions: A Non-Stationary View

AAAI 2019 · Optimization › Nonconvex and smooth optimization · approach: Stochastic convex optimization complexity · 41 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use zCDP-based noise calibration instead of moments accountant or advanced composition constantsDP-GD / DP-PGD · Covertype and synthetic, sigmoid loss with l1 regularizerl2 norm of projected gradientHelped
increase privacy budget epsilon (ablation)DP-GD · Covertype and syntheticl2 norm of gradientHelped
increase sample size n (ablation)DP-GD · Covertype and syntheticl2 norm of gradientHelped
increase iteration number T (ablation)DP-GD · Covertype and syntheticl2 norm of gradientNo clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy