vix.ing · top · new · best · stats · spec

Black-box optimization for integer-variable problems using Ising machines and factorization machines

2022/09/01 by Yuya Seki, Ryo Tamura, Seki, Yuya +3 · 2 citations
Computer Science · #Evolutionary Algorithms and Applications #FOS: Computer and information sciences #FOS: Physical sciences #Machine Learning (cs.LG) #Metaheuristic Optimization Algorithms Research #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph)

paper · pdf · doi:10.48550/arxiv.2209.01016

openalex publication_date 2022/09/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Black-box optimization has potential in numerous applications such as hyperparameter optimization in machine learning and optimization in design of experiments. Ising machines are useful for binary optimization problems because variables can be represented by a single binary variable of Ising machines. However, conventional approaches using an Ising machine cannot handle black-box optimization problems with non-binary values. To overcome this limitation, we propose an approach for integer-variable black-box optimization problems by using Ising/annealing machines and factorization machines in cooperation with three different integer-encoding methods. The performance of our approach is numerically evaluated with different encoding methods using a simple problem of calculating the energy of the hydrogen molecule in the most stable state. The proposed approach can calculate the energy using any of the integer-encoding methods. However, one-hot encoding is useful for problems with a small size.

Cited by

Related