Machine Learning-assisted High-speed Combinatorial Optimization with Ising Machines for Dynamically Changing Problems
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.
Code (0)
등록된 구현이 없습니다.
Tasks
Combinatorial OptimizationSchedulingMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Demonstrating Real Advantage of Machine-Learning-Enhanced Monte Carlo for Combinatorial Optimization
Combinatorial optimization problems are central to both practical applications and the development of optimization methods. While classical and quantum algorithms have been refined over decades, machine learning--assiste…
A Novel Surrogate-assisted Evolutionary Algorithm Applied to Partition-based Ensemble Learning
We propose a novel surrogate-assisted Evolutionary Algorithm for solving expensive combinatorial optimization problems. We integrate a surrogate model, which is used for fitness value estimation, into a state-of-the-art …
Bayesian OptimizationCombinatorial OptimizationEnsemble LearningAnnealing Machine-assisted Learning of Graph Neural Network for Combinatorial Optimization
While Annealing Machines (AM) have shown increasing capabilities in solving complex combinatorial problems, positioning themselves as a more immediate alternative to the expected advances of future fully quantum solution…
Combinatorial OptimizationGraph Neural NetworkEvoCSFL: Surrogate-Assisted Evolutionary Client Selection for Efficient and Robust Federated Learning
The heterogeneity of client data and systems makes it difficult to achieve satisfactory convergence speed and robustness in federated learning with random client selection. To address this issue, this paper proposes a su…
Federated LearningLarge Language Model Assisted Adversarial Robustness Neural Architecture Search
Motivated by the potential of large language models (LLMs) as optimizers for solving combinatorial optimization problems, this paper proposes a novel LLM-assisted optimizer (LLMO) to address adversarial robustness neural…
Adversarial RobustnessCombinatorial OptimizationLanguage ModelingLanguage Modelling+2