Research map / Optimization / Nonconvex and smooth optimization
Mixing Times and Privacy Analysis for the Projected Langevin Algorithm under a Modulus of Continuity
Mario Bravo, Juan P. Flores-Mella, Cristóbal Guzmán
Read the paperCheck your idea against 137,217 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
- Generalization of noisy SGD in unbounded non-convex settings (ICML 2025 · similarity 0.90)
- Convergent Privacy Loss of Noisy-SGD without Convexity and Smoothness (ICLR 2025 · similarity 0.89)
- Privacy Amplification by Iteration for ADMM with (Strongly) Convex Objective Functions (AAAI 2024 · similarity 0.88)
- Differential Privacy Guarantees of Markov Chain Monte Carlo Algorithms (ICML 2025 · similarity 0.88)
- Public-data Assisted Private Stochastic Optimization: Power and Limitations (NeurIPS 2024 · similarity 0.88)
- Shifted Interpolation for Differential Privacy (ICML 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.
