Research map / Optimization / Nonconvex and smooth optimization
Differentially Private Empirical Risk Minimization Revisited: Faster and More General
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 changed | Where | Measured | Effect |
|---|---|---|---|
| Use DP-SVRG instead of DP-GD | L2-regularized logistic regression · Covertype | optimality gap | Helped |
| Use DP-SVRG instead of DP-GD | L2-regularized logistic regression · Covertype | running time | Helped |
| Use DP-SVRG++ instead of DP-GD | Unregularized logistic regression · Covertype | optimality gap | Helped |
| Use DP-SVRG++ instead of DP-GD | Unregularized logistic regression · Covertype | running time | Helped |
Closest papers by meaning
- Adapting to Linear Separable Subsets with Large-Margin in Differentially Private Learning (ICML 2025 · similarity 0.89)
- Differentially Private Optimization with Sparse Gradients (NeurIPS 2024 · similarity 0.89)
- Faster Algorithms for User-Level Private Stochastic Convex Optimization (NeurIPS 2024 · similarity 0.88)
- Differential Private Stochastic Optimization with Heavy-tailed Data: Towards Optimal Rates (AAAI 2025 · similarity 0.88)
- Improved Rates of Differentially Private Nonconvex-Strongly-Concave Minimax Optimization (AAAI 2025 · similarity 0.88)
- Improved Sample Complexity for Private Nonsmooth Nonconvex Optimization (ICML 2025 · similarity 0.87)
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.