Abstract:Factorization machine with quadratic-optimization annealing (FMQA) is a black-box optimization method that combines a factorization machine (FM) surrogate with QUBO-based search by an Ising machine. When FMQA is applied to integer or discretized continuous variables via one-hot encoding, uniform random initial sampling can leave many binary variables never active in the initial training data, and the corresponding FM parameters receive no direct gradient updates from the observed responses. We address this by designing the initial training data to achieve complete marginal bit coverage, namely, ensuring that every binary variable obtained by one-hot encoding takes the value one at least once. We use two space-filling sampling methods, Latin hypercube sampling (LHS) and the Sobol' sequence, yielding LHS-FMQA and Sobol'-FMQA. On the human-powered aircraft wing-shape optimization benchmark with 17 and 32 design variables, both proposed methods achieved numerically higher mean final cruising speeds than the baseline FMQA, with the advantage more pronounced on the 32-variable problem.
| Subjects: | Machine Learning (cs.LG); Statistical Mechanics (cond-mat.stat-mech) |
| Cite as: | arXiv:2605.04825 [cs.LG] |
| (or arXiv:2605.04825v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2605.04825 arXiv-issued DOI via DataCite (pending registration) |
From: Taiga Hayashi [view email]
[v1]
Wed, 6 May 2026 12:16:34 UTC (263 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。