Research map / Optimization / Nonconvex and smooth optimization
Oracle Efficient Private Non-Convex Optimization
Seth Neel, Aaron Roth, Giuseppe Vietri, Steven Wu
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (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 |
|---|---|---|---|
| Directly optimize 0/1 classification error with discrete objective perturbation instead of privately optimizing logistic loss | Adult · Adult balanced subset | classification accuracy | Improved |
| Use ObjDisc instead of RSPM | Private discrete linear classification · Adult balanced subset | classification error | Improved |
| Use ObjDisc rather than private logistic regression | Adult balanced subset · Adult balanced subset | runtime | Mixed |
Closest papers by meaning
- Oracle-Efficient Differentially Private Learning with Public Data (NeurIPS 2024 · similarity 0.91)
- Faster Algorithms for User-Level Private Stochastic Convex Optimization (NeurIPS 2024 · similarity 0.88)
- Perturb-and-Project: Differentially Private Similarities and Marginals (ICML 2024 · similarity 0.88)
- Private Zeroth-Order Optimization with Public Data (NeurIPS 2025 · similarity 0.88)
- Privacy Amplification by Iteration for ADMM with (Strongly) Convex Objective Functions (AAAI 2024 · similarity 0.88)
- Public-data Assisted Private Stochastic Optimization: Power and Limitations (NeurIPS 2024 · similarity 0.88)
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.
