Continuous black-box optimization with an Ising machine and random subspace coding
A black-box optimization algorithm such as Bayesian optimization finds the extremum of an unknown function by alternating the inference of the underlying function and optimization of an acquisition function. In a high-dimensional space, such algorithms perform poorly due to the difficulty of acquisi...
Main Authors: | Syun Izawa, Koki Kitai, Shu Tanaka, Ryo Tamura, Koji Tsuda |
---|---|
Format: | Article |
Language: | English |
Published: |
American Physical Society
2022-04-01
|
Series: | Physical Review Research |
Online Access: | http://doi.org/10.1103/PhysRevResearch.4.023062 |
Similar Items
-
Designing metamaterials with quantum annealing and factorization machines
by: Koki Kitai, et al.
Published: (2020-03-01) -
Performance Comparison of Typical Binary-Integer Encodings in an Ising Machine
by: Kensuke Tamura, et al.
Published: (2021-01-01) -
Optimization of Core–Shell Nanoparticles Using a Combination of Machine Learning and Ising Machine
by: Makoto Urushihara, et al.
Published: (2023-12-01) -
Determination of quasi-primary odors by endpoint detection
by: Hanxiao Xu, et al.
Published: (2021-06-01) -
Continuous-spin Ising ferromagnets.
by: Sylvester, Garrett Smith
Published: (2007)