atlas

Research map / Graph learning / Graph algorithms and clustering

Deep Attentive Belief Propagation: Integrating Reasoning and Learning for Solving Constraint Optimization Problems

NeurIPS 2022 · Graph learning › Graph algorithms and clustering · approach: Continuous DAG structure learning · 2 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
Use learned dynamic damping factors and neighbor weights rather than static homogeneous damping and equal neighbor weightsDABP versus DBP-SCFG · Random COPs, WGCPs, scale-free networks, and small-world networksCost: 27.60 -> 27.12; 30.50 -> 30.02; 32.45 -> 32.04Helped
Fix neighbor weights uniformly while retaining heterogeneous learned damping factors (ablation)DABP · COP benchmarks, |X|=60/80/100CostHurt
Fix neighbor weights uniformly and average damping factors into one homogeneous factor (ablation)DABP · COP benchmarks, |X|=60/80/100CostHurt
Use Toulbar2 instead of DABPDABP · WGCPs, |X|=60Cost: 0.18 vs 0.29Hurt
Train on a larger number of effective iterations (ablation)DABP · Random COPs and WGCPs, 80 variablesCostHurt
Reduce the number of restarts (ablation)DABP · Random COPs, WGCPs, scale-free networks, and small-world networksCost: 27.12 -> 27.16 -> 27.19Hurt

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