arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2503.23966cs.ETcs.LG
收藏

面向动态变化问题的、基于伊辛机的机器学习辅助高速组合优化

Machine Learning-assisted High-speed Combinatorial Optimization with Ising Machines for Dynamically Changing Problems

Toshiba Corporation(东芝公司)

Yohei Hamakawa, Tomoya Kashimata, Masaya Yamasaki, Kosuke Tatsumura

AI总结:

针对动态组合优化问题中伊辛机延迟高、参数需逐次调优的问题,提出结合定制模拟分岔伊辛机架构与机器学习参数估计的嵌入式高速求解方法,在TDMA调度场景中验证了速度优势。

摘要:

量子或受量子启发的伊辛机(Ising machine)近期展现出短时间内求解组合优化问题的潜力。无线多跳网络的时分多址(TDMA)调度、金融交易等实际应用需要按顺序求解规模和特征动态变化的此类问题。然而,伊辛机的应用面临两大挑战:一是因伊辛模型数据量大、需云端访问导致系统级延迟难以缩短,二是需为每个问题确定参数。本文提出一种采用嵌入式伊辛机的组合优化方法,无需运行时参数调优即可高速求解各类问题。我们定制了基于模拟分岔(simulated bifurcation)的伊辛机的算法与电路架构,以压缩伊辛模型并加速计算,随后构建了机器学习模型,利用大量训练数据估计合适的参数。在无线多跳网络的TDMA调度场景中,实验演示表明该精细化系统可适配问题变化,且相比传统方法具备速度优势。

英文摘要:

Quantum or quantum-inspired Ising machines have recently shown promise in solving combinatorial optimization problems in a short time. Real-world applications, such as time division multiple access (TDMA) scheduling for wireless multi-hop networks and financial trading, require solving those problems sequentially where the size and characteristics change dynamically. However, using Ising machines involves challenges to shorten system-wide latency due to the transfer of large Ising model or the cloud access and to determine the parameters for each problem. Here we show a combinatorial optimization method using embedded Ising machines, which enables solving diverse problems at high speed without runtime parameter tuning. We customize the algorithm and circuit architecture of the simulated bifurcation-based Ising machine to compress the Ising model and accelerate computation and then built a machine learning model to estimate appropriate parameters using extensive training data. In TDMA scheduling for wireless multi-hop networks, our demonstration has shown that the sophisticated system can adapt to changes in the problem and showed that it has a speed advantage over conventional methods.

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

↑