ResearchPod Summary
Black-box optimization (BBO) often relies on surrogate models to approximate expensive objective functions. FMQA is a popular BBO framework that uses Factorization Machines (FM) to build these surrogates and Ising machines to search for optimal solutions. A critical challenge is that the binary encoding used to represent integer or continuous variables affects both the surrogate's learning accuracy and the Ising machine's search efficiency. This paper investigates whether using different encodings for the learning and search stages—a stage-dependent approach—can outperform the conventional method of using a single, fixed encoding.
The authors propose a framework that employs one-hot encoding during the machine learning stage and domain-wall encoding during the solution search stage. To enable this, they derive mathematical conversion formulas between one-hot and domain-wall QUBO matrices that preserve the surrogate objective landscape over feasible integer states. They evaluate this "OhDw" (One-hot for learning, Domain-wall for search) variant against standard approaches using the Rastrigin function, testing various input dimensions and discretization levels to isolate the impact of encoding on each stage of the optimization process.
The study reveals that the encoding choice in the machine learning stage is the dominant factor for overall performance, with one-hot encoding consistently producing lower residual errors than domain-wall or binary encoding. While domain-wall encoding is known for its search efficiency, the benefit of switching to it during the search stage is not universal. The proposed stage-dependent strategy (OhDw) yields superior results—achieving lower residual errors and solutions closer to the global optimum—specifically when the problem involves finer discretization levels. This suggests that while one-hot encoding is essential for building an accurate surrogate, stage-dependent switching can refine the search process in complex, high-resolution landscapes.
This research provides a systematic way to decouple the requirements of surrogate modeling and combinatorial search in BBO. By demonstrating that different stages of the optimization pipeline have distinct encoding preferences, the authors offer a practical strategy for practitioners to improve the performance of Ising-machine-based optimization without needing to change the underlying surrogate model architecture. This is particularly relevant for high-dimensional or high-precision engineering and materials design problems where discretization choices significantly impact solution quality.
AI-generated third-party summary by ResearchPod. Not official content or an endorsement by the paper authors or affiliated organizations.