AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

SLM: A Smoothed First-Order Lagrangian Method for Structured Constrained Nonconvex Optimization

NeurIPS 2023 · Optimization › Nonconvex and smooth optimization · approach: Complexity of nonconvex first-order methods

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 SLM instead of V-PBGDbilevel hyper-cleaning · MNIST hyper-cleaningtest accuracy after >3000 iterations: 88.1 -> 88.8Helped
use SLM instead of V-PBGDbilevel hyper-cleaning · MNIST hyper-cleaningconstraint error: 0.68 -> 0.001Helped
use SLM instead of V-PBGDbilevel hyper-cleaning · MNIST hyper-cleaningpeak test accuracyNo clear effect
use SLM (delta = 1) instead of V-PBGD2-layer NN · MNISTpeak test accuracy: 94.65 -> 94.74No clear effect
use SLM (delta = 1) instead of BOME2-layer NN · MNISTpeak test accuracy: 94.52 -> 94.74Helped
reduce constraint tolerance delta from 1 to 0.5 (ablation)SLM · 2-layer NN on MNISTconvergence speed and peak accuracy: 94.74 -> 94.53Hurt
use SLM instead of BOME and V-PBGDbilevel toy example · toy exampleupper-level objective valueHelped
use SLM instead of BOME2-layer NN · MNISTlate-stage test accuracyHelped

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