AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Revisiting Decomposable Submodular Function Minimization with Incidence Relations

Pan Li, Olgica Milenkovic

NeurIPS 2018 · Optimization › Nonconvex and smooth optimization · approach: Adaptive first-order convex methods · 6 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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 incidence-aware sampling to update coordinate blocks in parallelRCDM · DSFM, paralleliterations to an ε-optimal solutionImproved
Use uniform random block sampling instead of optimal incidence-based samplingParallel RCDM · DSFM, parallelconvergence-rate approximation: 2-approximationHurt
Use greedy sampling instead of uniform samplingParallel RCDM · Image segmentation and Zachary's Karate Clubconvergence rateImproved
Use accelerated coordinate descent with uniform samplingParallel CD methods · Image segmentation and Zachary's Karate Clubconvergence rateImproved
Use IAP instead of APAP · Image segmentation and Zachary's Karate Clubnumber of projections to reach the target gapImproved

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