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.
Thompson Sampling for Combinatorial Semi-bandits with Sleeping Arms and Long-Term Fairness Constraints
University of Victoria(维多利亚大学);Southeast University(东南大学);Harbin Institute of Technology(哈尔滨工业大学)
研究了具有长期公平性约束的组合睡眠多臂半强盗问题~(CSMAB-F)。针对该问题,采用Thompson Sampling~(TS)方法最大化总报酬,采用虚拟队列技术处理公平性约束,并设计了一种算法\emph{TS with beta priors and Bernoulli likelihoods for CSMAB-F~(TSCSF-B)}。进一步,我们证明了TSCSF-B能满足公平性约束,并且时间平均后悔的上界为$\frac{N}{2η} + O\left(\frac{\sqrt{mNT\ln T}}{T}\right)$,其中$N$是总的手臂数,$m$是每轮中能同时拉动的最大手臂数~(基数约束),$η$是公平性与奖励的权衡参数.通过放松公平性约束(即,令$η\rightarrow \infty$),该界归结为组合睡眠多臂半强盗问题TS算法的第一个与问题无关的界。最后,我们进行了数值实验,并使用一个高收视率的电影推荐应用程序,以显示所提出的算法的有效性和效率。
When Combinatorial Thompson Sampling meets Approximation Regret
Idemia(亿达美)
研究了近似后悔条件下组合多臂强盗问题的组合Thompson抽样策略。虽然CTS吸引了很多人的兴趣,但它有一个缺点,这是其他常见的CMAB策略在考虑非精确预言时所没有的:对于某些预言,CTS具有较差的近似遗憾(与时间范围$T$线性缩放)[Wang和Chen,2018]。然后,有必要进行研究,以区分CTS可以学习的神谕。该研究由Kong et al. [2021]开始:他们给出了贪婪预言机CTS的一次近似后悔分析,获得了$\mathcal{O}(\log(T)/Δ^2)$阶的上界,其中$Δ$是某个最小奖励差距。在本文中,我们的目标是推动这项研究进一步比简单的情况下,贪婪的甲骨文。我们提供了第一个$\mathcal{O}(\log(T)/Δ)$近似遗憾的上限CTS,在一个特定的条件下获得的近似甲骨文,允许减少到确切的甲骨文分析。因此,我们把这个条件称为REDUCE2EXACT,并观察到它在许多具体的例子中得到满足。此外,它可以扩展到概率触发的武器设置,从而捕获更多的问题,如在线影响最大化。
Entropy-Guided Sampling of Flat Modes in Discrete Spaces
Department of Computer Science, College of Science & College of Engineering, Purdue University(计算机科学系、科学与工程学院、普渡大学);Department of Biostatistics & Bioinformatics, Duke University School of Medicine, Duke University(生物统计学与生物信息学系、杜克大学医学学院、杜克大学)
Scalable Discrete Diffusion Samplers: Combinatorial Optimization and Statistical Physics
ELLIS Unit Linz, LIT AI Lab, Johannes Kepler University Linz, Austria(林茨ELLIS单元、LIT AI实验室、林茨约瑟夫·冯·海德里希大学,奥地利);Department of Electrical & Computer Engineering, Georgia Institute of Technology(电气与计算机工程系,佐治亚理工学院);NXAI Lab & NXAI GmbH, Linz, Austria(NXAI实验室及NXAI GmbH,林茨,奥地利)
Variational Annealing on Graphs for Combinatorial Optimization
ELLIS Unit Linz(欧洲学习与智能系统实验室林茨分部);LIT AI Lab(LIT人工智能实验室);Institute for Machine Learning, Johannes Kepler University Linz(林茨约翰内斯·开普勒大学机器学习研究所);Johannes Kepler University Linz(林茨约翰内斯·开普勒大学)