Black-box optimization for integer-variable problems using Ising machines and factorization machines
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 7 of its 45 references that are in the map. First posted on arXiv 1 Sep 2022.
Builds on
7 of 45 references.
References · 7
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2013Ising formulations of many NP problemscited by 204
- 2017Traffic flow optimization using a quantum annealercited by 29
- 2018Control of automated guided vehicles without collision by quantum annealer and digital devicescited by 13
- 2015Solving the Optimal Trading Trajectory Problem Using a Quantum Annealercited by 12
- 2019Item Listing Optimization for E-commerce Websites based on Diversitycited by 8
- 2021A Review of Machine Learning Classification Using Quantum Annealing for Real-world Applicationscited by 7
Built on by
Citing papers per year: 2023: 1; 2024: 3; 2025: 2; 2026: 2.
8 papers.
- 2024Function Smoothing Regularization for Precision Factorization Machine Annealing in Continuous Variable Optimization Problemscited by 2
- 2025Real-Time Black-Box Optimization for Dynamic Discrete Environments Using Embedded Ising Machinescited by 2
- 2024Efficient Bit Labeling in Factorization Machines with Annealing for Traveling Salesman Problemcited by 1
- 2025Subsampling Factorization Machine Annealingcited by 1
- 2026Factorization Machine with Quadratic-Optimization Annealing for RNA Inverse Folding and Evaluation of Binary-Integer Encoding and Nucleotide Assignmentcited by 1
- 2023A general learning scheme for classical and quantum Ising machinescited by 0
- 2024Initialization Method for Factorization Machine Based on Low-Rank Approximation for Constructing a Corrected Approximate Ising Modelcited by 0
- 2026Stage-dependent integer-binary encoding in factorization-machine black-box optimizationcited by 0
- 2026Stage-dependent integer-binary encoding in factorization-machine black-box optimization22 Jun 2026
- 2026Factorization Machine with Quadratic-Optimization Annealing for RNA Inverse Folding and Evaluation of Binary-Integer Encoding and Nucleotide Assignment18 Feb 2026
- 2025Subsampling Factorization Machine Annealing12 Aug 2025
- 2025Real-Time Black-Box Optimization for Dynamic Discrete Environments Using Embedded Ising Machines20 Jun 2025
- 2024Initialization Method for Factorization Machine Based on Low-Rank Approximation for Constructing a Corrected Approximate Ising Model16 Oct 2024
- 2024Function Smoothing Regularization for Precision Factorization Machine Annealing in Continuous Variable Optimization Problems5 Jul 2024
- 2024Efficient Bit Labeling in Factorization Machines with Annealing for Traveling Salesman Problem2 Jul 2024
- 2023A general learning scheme for classical and quantum Ising machines27 Oct 2023