Research map / Optimization / Optimizers
Privacy of Noisy Stochastic Gradient Descent: More Iterations without More Privacy Loss
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.
Closest papers by meaning
- Shifted Interpolation for Differential Privacy (ICML 2024 · similarity 0.92)
- Differentially Private Stochastic Gradient Descent with Fixed-Size Minibatches: Tighter RDP Guarantees with or without Replacement (NeurIPS 2024 · similarity 0.90)
- Convergent Privacy Loss of Noisy-SGD without Convexity and Smoothness (ICLR 2025 · similarity 0.90)
- Faster Algorithms for User-Level Private Stochastic Convex Optimization (NeurIPS 2024 · similarity 0.90)
- Privacy Amplification by Iteration for ADMM with (Strongly) Convex Objective Functions (AAAI 2024 · similarity 0.90)
- Differential Privacy Guarantees of Markov Chain Monte Carlo Algorithms (ICML 2025 · similarity 0.89)
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.
