2000 character limit reached
Fast convergence to an approximate solution by message-passing for complex optimizations (2312.11909v2)
Published 19 Dec 2023 in physics.soc-ph, cond-mat.dis-nn, and cond-mat.stat-mech
Abstract: Message-passing (MP) is a powerful tool for finding an approximate solution in optimization. We generalize it to nonlinear product-sum form, and numerically show the fast convergence for the minimum feedback vertex set and the minimum vertex cover known as NP-hard problems. From the linearity of MP in a logarithmic space, it is derived that an equilibrium solution exists in a neighborhood of random initial values. These results will give one of the reason why the convergence is very fast in collective computation based on a common mathematical background.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
