atlas

Research map / Optimization / Nonconvex and smooth optimization

Accelerated Message Passing for Entropy-Regularized MAP Inference

ICML 2020 · Optimization › Nonconvex and smooth optimization · approach: Coordinate and Adam convergence analysis · 0 citations (OpenAlex)

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
Apply Nesterov-inspired randomized acceleration to EMPEMP · MAP inference over L2iterations sufficient for expected epsilon-optimality: O(1/ε^3) -> O(1/ε^2)Helped
Apply Nesterov-inspired randomized acceleration to SMPSMP · MAP inference over L2iterations sufficient for expected epsilon-optimality: O(1/ε^3) -> O(1/ε^2)Helped
Use accelerated rather than standard message passingEMP and SMP · Synthetic Erdős-Rényi graph, primal objectiveprimal objective errorNo clear effect
Use accelerated rather than standard message passingEMP and SMP · Synthetic Erdős-Rényi graphslog-competitive ratioHelped
Use SMP instead of EMPStandard message passing · Synthetic Erdős-Rényi graphconvergence iterationsHelped
Use EMP instead of coordinate descentStandard coordinate descent · Synthetic Erdős-Rényi graphconvergence iterationsHelped

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