arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2311.09275cs.LGcond-mat.dis-nn
收藏

改进的稀疏伊辛优化

Improved Sparse Ising Optimization

Northrop Grumman Systems Corporation(诺斯罗普·格鲁曼系统公司)

Kenneth M. Zick

AI总结:

本文提出一种新的启发式算法,在Gset基准的大型稀疏伊辛问题上,以比现有方法快2-4个数量级的速度找到更优解,并提供了验证比特串。

摘要:

稀疏伊辛问题可应用于物流、凝聚态物理和深度玻尔兹曼网络训练等领域,但以高效率和准确性处理这些问题可能非常困难。本报告展示了新数据,表明在包含多达20,000个变量的若干长期基准问题上性能显著提高。这些数据来自一种新的启发式算法,该算法在Gset基准套件的大型稀疏实例上进行了测试。相对于领先的已报道速度与准确性组合(例如,来自东芝的模拟分叉机和突破性局部搜索),一个概念验证实现达到目标的速度快了2-4个数量级。对于两个实例(G72和G77),新算法发现了比所有先前报道值更好的解。提供了确认这两个最优解的比特串。这些数据表明,推动稀疏伊辛性能前沿的令人兴奋的可能性,可能增强算法组合、AI工具包和决策系统。

英文摘要:

Sparse Ising problems can be found in application areas such as logistics, condensed matter physics and training of deep Boltzmann networks, but can be very difficult to tackle with high efficiency and accuracy. This report presents new data demonstrating significantly higher performance on some longstanding benchmark problems with up to 20,000 variables. The data come from a new heuristic algorithm tested on the large sparse instances from the Gset benchmark suite. Relative to leading reported combinations of speed and accuracy (e.g., from Toshiba's Simulated Bifurcation Machine and Breakout Local Search), a proof-of-concept implementation reached targets 2-4 orders of magnitude faster. For two instances (G72 and G77) the new algorithm discovered a better solution than all previously reported values. Solution bitstrings confirming these two best solutions are provided. The data suggest exciting possibilities for pushing the sparse Ising performance frontier to potentially strengthen algorithm portfolios, AI toolkits and decision-making systems.

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

↑