arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2503.04047stat.MLcs.LGmath.OC
收藏

面向组合优化的重加热梯度离散采样

Reheated Gradient-based Discrete Sampling for Combinatorial Optimization

University of Toronto(多伦多大学);Purdue University(普渡大学)

Muheng Li, Ruqi Zhang

AI总结:

本文针对梯度离散采样在组合优化中“等高线徘徊”导致的低效探索问题,提出受物理学临界温度与比热启发的重加热机制,并在多种组合优化问题上验证其优于现有采样与数据驱动方法。

摘要:

近年来,基于梯度的离散采样已成为各类组合优化(CO)问题的高效通用求解器,其性能可与流行的数据驱动方法相媲美甚至更优。然而,我们发现这些方法存在一个关键问题,称之为“在等高线中徘徊”。该行为指长时间采样出目标值非常接近的不同新解,导致计算效率低下,且对潜在解的探索不充分。本文提出一种新颖的重加热机制,其灵感来自物理学中的临界温度和比热概念,旨在克服这一局限。实验表明,我们的方法在多种CO问题上优于现有的基于采样和数据驱动的算法。

英文摘要:

Recently, gradient-based discrete sampling has emerged as a highly efficient, general-purpose solver for various combinatorial optimization (CO) problems, achieving performance comparable to or surpassing the popular data-driven approaches. However, we identify a critical issue in these methods, which we term ''wandering in contours''. This behavior refers to sampling new different solutions that share very similar objective values for a long time, leading to computational inefficiency and suboptimal exploration of potential solutions. In this paper, we introduce a novel reheating mechanism inspired by the concept of critical temperature and specific heat in physics, aimed at overcoming this limitation. Empirically, our method demonstrates superiority over existing sampling-based and data-driven algorithms across a diverse array of CO problems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑