Subsampling Factorization Machine Annealing
arXiv:2508.08778 · doi:10.1103/qgpq-6dmr
Abstract
Quantum computing and machine learning are state-of-the-art technologies that have been investigated intensively in both academia and industry. The hybrid technology of these two ingredients is expected to be a powerful tool to solve complex problems in many branches of science and engineering such as combinatorial optimization problems and accelerate the creation of next-generation technologies. In this work, we develop an algorithm to solve a black-box optimization problem by improving Factorization Machine Annealing (FMA) such that the training of a machine learning model called Factorization Machine is performed not by a full dataset but by a subdataset that is sampled from a full dataset: Subsampling Factorization Machine Annealing (SFMA). According to such a probabilistic training process, the performance of FMA on exploring a solution space gets enhanced. As a result, SFMA exhibits balanced performance of exploration and exploitation, which we call exploitation-exploration functionality. We conduct numerical benchmarking tests to compare the performance of SFMA with that of FMA. Consequently, SFMA certainly exhibits the exploration-exploitation functionality and outperforms FMA in speed and accuracy. In addition, the performance of SFMA can be further improved by sequentially using two subsampling datasets with different sizes such that the size of the latter dataset is substantially smaller than the former. Such a substantial reduction not only enhances the exploration performance of SFMA but also enables us to run it with correspondingly low computational cost even for a large-scale problem. These results indicate the effectiveness of SFMA in a certain class of black-box optimization problems of significant size: the potential scalability of SFMA in solving large-scale problems with correspondingly low computational cost.
29 pages and 17 figures
References in corpus (45)
- Quantum Machine Learning
- Ising formulations of many NP problems
- Quantum Annealing in the Transverse Ising Model
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Quantum computational chemistry
- Adiabatic Quantum Computing
- Parameterized quantum circuits as machine learning models
- A high-bias, low-variance introduction to Machine Learning for physicists
- Quantum information processing with superconducting circuits: a review
- Quantum annealing with more than one hundred qubits
- Quantum algorithms for quantum chemistry and quantum materials science
- From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
- Challenges and Opportunities in Quantum Machine Learning
- Quantum Annealing and Analog Quantum Computation
- Quantum optimization using variational algorithms on near-term quantum devices
- Defining and detecting quantum speedup
- Perspectives of quantum annealing: Methods and implementations
- Physics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer
- A Review on Quantum Approximate Optimization Algorithm and its Variants
- Quantum Boltzmann Machine
- What is the Computational Value of Finite Range Tunneling?
- Is there evidence for exponential quantum advantage in quantum chemistry?
- Computational Role of Multiqubit Tunneling in a Quantum Annealer
- Reverse Quantum Annealing Approach to Portfolio Optimization Problems
- Demonstration of a scaling advantage for a quantum annealer over simulated annealing
- Expanding the horizon of automated metamaterials discovery via quantum annealing
- Challenges and Opportunities in Quantum Optimization
- Quantum Annealing: An Overview
- Quantum Machine Learning for Chemistry and Physics
- On the construction of model Hamiltonians for adiabatic quantum computation and its application to finding low energy conformations of lattice protein models
- Accelerating computational materials discovery with artificial intelligence and cloud high-performance computing: from large-scale screening to experimental validation
- Beyond-classical computation in quantum simulation
- A comprehensive review of Quantum Machine Learning: from NISQ to Fault Tolerance
- Machine Learning Framework for Quantum Sampling of Highly-Constrained, Continuous Optimization Problems
- Application of QUBO solver using black-box optimization to structural design for resonance avoidance
- Benchmark test of Black-box optimization using D-Wave quantum annealer
- Towards optimization of photonic-crystal surface-emitting lasers via quantum annealing
- Using quantum annealing to design lattice proteins
- Quantum algorithms for scientific computing
- Lossy compression of matrices by black-box optimisation of mixed integer nonlinear programming
- Quantum-Classical Computational Molecular Design of Deuterated High-Efficiency OLED Emitters
- Image Analysis Based on Nonnegative/Binary Matrix Factorization
- Lossy compression of statistical data using quantum annealer
- Random Postprocessing for Combinatorial Bayesian Optimization
- SWIFT-FMQA: Enhancing Factorization Machine with Quadratic-Optimization Annealing via Sliding Window