AI Paper Atlas

Research map / Optimization / Optimizers

Automatic differentiation of nonsmooth iterative algorithms

NeurIPS 2022 · Optimization › Optimizers · approach: Randomized gradient estimation

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 changedWhereMeasuredEffect
Use nonsmooth piggyback differentiation under a contraction assumptionLipschitz path-differentiable iterative algorithms · Fixed-point mapsconvergence to the fixed-point derivativeHelped
Use a Lipschitz gradient selection for the iteration mappingNonsmooth piggyback differentiation · Semialgebraic piecewise smooth selection functionsderivative convergence rate: C (√ρ + ε)^kHelped
Apply nonsmooth piggyback differentiation to Heavy-Ball with α = 1 and β = 3/4Heavy-Ball · Strongly convex piecewise quadratic counterexamplestability of propagated derivatives: −9/8Hurt
Use Heavy-Ball rather than a non-inertial method for the nonsmooth exampleIterative solver differentiation · Piecewise quadratic objective at θ = 0derivative propagation stability: −9/8Hurt

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy