atlas

Research map / Optimization / Nonconvex and smooth optimization

Gradient-Free Method for Heavily Constrained Nonconvex Optimization

ICML 2022 · 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
DSZOG (doubly stochastic ZO with momentum and adaptive step) vs. constrained ZO baselinesconstrained classification with pairwise constraints · a9a, w8a, gen, svmtest accuracy (%)Mixed
DSZOG vs. constrained ZO baselinesclassification with fairness constraints · D1-D4test accuracy (%): DSZOG highest on D1-D4 among the reported methodsHelped
DSZOG vs. AccSZOFW on pairwise constraints for w8aw8a classification with pairwise constraints · w8atest accuracy (%)No clear effect
DSZOG vs. AccSZOFW on fairness constraints D2D2 classification with fairness constraints · D2test accuracy (%)Mixed
No ablation of momentum (EMA), adaptive step size, or stochastic constraint sampling was reportedDSZOG · allaccuracyNo clear effect

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