arrow
Return

Fast Deep Belief Propagation: An Efficient Learning-Based Algorithm for Solving Constraint Optimization Problems

delete2025-10-21
delete0
PRE
AI
孔树锋 cover
孔树锋 (Shufeng Kong)
F
Feifan Chen
Z
Zijie Wang
刘
刘才华 (Caihua Liu) *
DOI:10.3390/math13203349delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Belief Propagation (BP) is a fundamental heuristic for solving Constraint Optimization Problems (COPs), yet its practical applicability is constrained by slow convergence and instability in loopy factor graphs. While Damped BP (DBP) improves convergence by using manually tuned damping factors, its reliance on labor-intensive hyperparameter optimization limits scalability. Deep Attentive BP (DABP) addresses this by automating damping through recurrent neural networks (RNNs), but introduces significant memory overhead and sequential computation bottlenecks. To reduce memory usage and accelerate deep belief propagation, this paper introduces Fast Deep Belief Propagation (FDBP), a deep learning framework that improves COP solving through online self-supervised learning and graphics processing unit (GPU) acceleration. FDBP decouples the learning of damping factors from BP message passing, inferring all parameters for an entire BP iteration in a single step, and leverages mixed precision to further optimize GPU memory usage. This approach substantially improves both the efficiency and scalability of BP optimization. Extensive evaluations on synthetic and real-world benchmarks highlight the superiority of FDBP, especially for large-scale instances where DABP fails due to memory constraints. Moreover, FDBP achieves an average speedup of 2.87x over DABP with the same restart counts. Because BP for COPs is a mathematically grounded GPU-parallel message-passing framework that bridges applied mathematics, computing, and machine learning, and is widely applicable across science and engineering, our work offers a promising step toward more efficient solutions to these problems.
Keywords:
constraint optimization problems
learning to optimize
belief propagation
machine learning
artificial intelligence
optimization algorithms

Journal

Mathematics cover
Mathematics
IF:
2.2
Papers:
3.1K
Citations:
3.6W

Organization

S
sun yat sen university
Scholars:
1.2W
Papers: 3.9K
Citations: 1.2K
C
cornell university
Scholars:
5.6K
Papers: 2.3K
Citations: 0
Cited Papers

Cited Papers

Factor graphs and the sum-product algorithm
err2001-01-01
err0
PREAI
errF.R. Kschischang; B.J. Frey; H.-A. Loeliger
errShare
errSave
errShare
errSave
Branch-and-Bound Methods: A Survey
err1966-08-01
err0
PREAI
errE. L. Lawler; D. E. Wood
errShare
errSave
errShare
errSave
Mini-buckets
err2003-03-01
err0
PREAI
errRina Dechter; Irina Rish
errShare
errSave
researcher View more