Black-box optimization using factorization and Ising machines
Ryo Tamura, Yuya Seki, Yuki Minamoto, Koki Kitai, Yoshiki Matsuda, Shu Tanaka, Koji Tsuda

TL;DR
This paper reviews a novel black-box optimization method using factorization machines transformed into quadratic models solved by Ising machines, enabling efficient large-scale optimization across various scientific fields.
Contribution
It introduces the FMQA algorithm that leverages Ising machines for fast, large-scale black-box optimization, along with Python tools and application examples.
Findings
Enables optimization of complex problems using Ising machines.
Demonstrates successful applications in physics, chemistry, and social sciences.
Handles binary, integer, and graph-based optimization problems.
Abstract
Black-box optimization (BBO) is used in materials design, drug discovery, and hyperparameter tuning in machine learning. The world is experiencing several of these problems. In this review, a factorization machine with quantum annealing or with quadratic-optimization annealing (FMQA) algorithm to realize fast computations of BBO using Ising machines (IMs) is discussed. The FMQA algorithm uses a factorization machine (FM) as a surrogate model for BBO. The FM model can be directly transformed into a quadratic unconstrained binary optimization model that can be solved using IMs. This makes it possible to optimize the acquisition function in BBO, which is a difficult task using conventional methods without IMs. Consequently, it has the advantage of handling large BBO problems. To be able to perform BBO with the FMQA algorithm immediately, we introduce the FMQA algorithm along with Python…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
