Research map / Optimization / Nonconvex and smooth optimization
Fast and Provable ADMM for Learning with Generative Priors
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 ℓ∞-norm denoising for ℓ∞-bounded adversarial attacks instead of ℓ2 projection | GAN-prior image denoising on MNIST · MNIST adversarial denoising | test error | Helped |
| Use ADMM for ℓ∞ projection rather than GD | GAN-prior image denoising on MNIST · MNIST ℓ∞ denoising | ℓ∞ reconstruction error | Helped |
| Use ADMM rather than ADAM | GAN-prior image denoising on MNIST · MNIST ℓ∞ denoising | ℓ∞ reconstruction error | Helped |
Closest papers by meaning
- Adaptive Relaxed ADMM: Convergence Theory and Practical Implementation (CVPR 2017 · similarity 0.88)
- ADMM without a Fixed Penalty Parameter: Faster Convergence with New Adaptive Penalization (NeurIPS 2017 · similarity 0.88)
- Federated ADMM from Bayesian Duality (ICLR 2026 · similarity 0.87)
- Decoupling Training-Free Guided Diffusion by ADMM (CVPR 2025 · similarity 0.86)
- ADMM for Nonconvex Optimization under Minimal Continuity Assumption (ICLR 2025 · similarity 0.85)
- Optimizing ADMM and Over-Relaxed ADMM Parameters for Linear Quadratic Problems (AAAI 2024 · similarity 0.85)
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.