SWIFT-FMQA: Enhancing Factorization Machine with Quadratic-Optimization Annealing via Sliding Window
Mayumi Nakano, Yuya Seki, Shuta Kikuchi, Shu Tanaka

TL;DR
SWIFT-FMQA introduces a sliding window approach to improve factorization machine-based black-box optimization by emphasizing recent data, leading to more efficient solutions with fewer function evaluations.
Contribution
It proposes SWIFT-FMQA, a novel sliding window method that enhances FMQA's performance by maintaining recent data, addressing stagnation issues in iterative optimization.
Findings
Achieves lower-cost solutions with fewer evaluations.
Outperforms traditional FMQA in optimization tasks.
Effectively emphasizes recent data for better predictions.
Abstract
Black-box (BB) optimization problems aim to identify an input that maximizes or minimizes the output of a function (the BB function) whose input-output relationship is unknown. Factorization machine with quadratic-optimization annealing (FMQA) is a promising approach to this task, employing a factorization machine (FM) as a surrogate model to iteratively guide the solution search via an Ising machine. Although FMQA has demonstrated strong optimization performance across various applications, its performance often stagnates as the number of optimization iterations increases. One contributing factor to this stagnation is the growing number of data points in the dataset used to train FM. As more data are accumulated, the contribution of newly added data points tends to become diluted within the entire dataset. Based on this observation, we hypothesize that such dilution reduces the impact…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
