Improving FMQA via Initial Training Data Design Considering Marginal Bit Coverage in One-Hot Encoding

• URL: http://arxiv.org/abs/2605.04825v1
• Date: Wed, 06 May 2026 12:16:34 GMT
• Title: Improving FMQA via Initial Training Data Design Considering Marginal Bit Coverage in One-Hot Encoding
• Abstract summary: We propose a black-box optimization method that combines a factorization machine (FM) surrogate with QUBO-based search by an Ising machine.<n>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.<n>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.
• Score: 0.5387709967970504
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Quantum MeanFlow: single-shot generative sampling on NISQ hardware [0.30586855806896046]
  Flow matching is a generative method in which samples are generated by transporting a simple, known distribution to the target data distribution with a learned velocity field.<n>We introduce Quantum MeanFlow (QMF), the quantum analogue of the MeanFlow formulation, which allows single-step sample generation.<n>We show that while single-step QMF has lower image quality compared to multi-step QFM, it performs better than the single-step QFM sampling at every shot count.
  arXiv  Detail & Related papers  (2026-09-02T06:49:45Z)
• Transpiler Autotuning with Predictive Models for Quantum Circuit Optimization [1.039769242219222]
  We build a predictive model extension for the Qiskit transpilation pipeline that uses a machine learning model to automatically select combinations of transpiler passes aiming to achieve a maximum reduction in two-qubit gates.<n>Our empirical evaluation shows that the combinations selected by our model are never outperformed by Qiskit's optimization levels, achieve on average an additional 19.1$%$ - 32.4$%$ reduction in two-qubit gates, and for some circuits finds reductions of up to $95.8%$ in cases where Qiskit achieves no reduction at all.
  arXiv  Detail & Related papers  (2026-07-31T08:23:43Z)
• Formulation-Level Auto-Tuning for QUBO-Based Machine Learning: A Case Study Across Multiple Quantum-Inspired Annealers [0.0]
  This paper presents an Optuna-based formulation-level auto-tuning framework for support vector machines (SVMs)<n> continuous dual variables are discretized and converted into a quadratic unconstrained binary optimization (QUBO) model.<n>Experiments on linear and nonlinear classification tasks with 0-20% label noise show mean gains over grid search of approximately 0.8 and 2.1 percentage points, respectively.
  arXiv  Detail & Related papers  (2026-07-21T06:56:43Z)
• Stage-dependent integer-binary encoding in factorization-machine black-box optimization [0.612477318852572]
  Black-box optimization deals with problems where objective functions lack explicit analytical forms and are expensive to evaluate.<n>We propose a stage-dependent FMQA framework and derive conversion formulas between one-hot and domain-wall QUBO matrices.<n>We evaluate the OhDw variant, which employs one-hot encoding for learning and domain-wall encoding for search.
  arXiv  Detail & Related papers  (2026-06-22T11:36:27Z)
• Posterior Augmented Flow Matching [64.1559809786948]
  Posterior-Augmented Flow Matching (PAFM) is a generalization of flow matching (FM)<n>We show that PAFM improves over FM by up to 3.4 FID50K across different model scales.
  arXiv  Detail & Related papers  (2026-05-01T17:59:59Z)
• Hybrid Fourier Neural Operator for Surrogate Modeling of Laser Processing with a Quantum-Circuit Mixer [0.0]
  HQ-LP-FNO is a hybrid quantum-classical FNO that replaces a fraction of dense spectral blocks with a compact, mode-shared variational quantum circuit mixer.<n> evaluated on three-dimensional surrogate modeling of high-energy laser processing, coupling heat transfer, melt-pool convection, free-surface deformation, and phase change.
  arXiv  Detail & Related papers  (2026-04-06T16:28:49Z)
• Multi-Mode Quantum Annealing for Variational Autoencoders with General Boltzmann Priors [0.21485350418225238]
  Variational autoencoders (VAEs) learn compact latent representations of complex data.<n>Energy-based priors offer a principled way to move beyond factorized assumptions.<n>We present Boltzmann-machine--prior VAEs trained using quantum annealing--based sampling.
  arXiv  Detail & Related papers  (2026-04-01T13:59:40Z)
• MeanFlow Transformers with Representation Autoencoders [71.45823902973349]
  MeanFlow (MF) is a diffusion-motivated generative model that enables efficient few-step generation by learning long jumps directly from noise to data.<n>We develop an efficient training and sampling scheme for MF in the latent space of a Representation Autoencoder (RAE)<n>We achieve a 1-step FID of 2.03, outperforming vanilla MF's 3.43, while reducing sampling GFLOPS by 38% and total training cost by 83% on ImageNet 256.
  arXiv  Detail & Related papers  (2025-11-17T06:17:08Z)
• Enhancing Hybrid Methods in Parameterized Quantum Circuit Optimization [0.0]
  Quantum circuits (PQCs) play an essential role in the application of variational quantum algorithms (VQAs) in noisy quantum devices.<n>We introduce two new hybrid algorithms that are more robust and scalable.<n>We find that they are feasible for NISQ devices with different noise profiles.
  arXiv  Detail & Related papers  (2025-10-09T12:24:57Z)
• High-Frequency Prior-Driven Adaptive Masking for Accelerating Image Super-Resolution [87.56382172827526]
  High-frequency regions are most critical for reconstruction.<n>We propose a training-free adaptive masking module for acceleration.<n>Our method reduces FLOPs by 24--43% for state-of-the-art models.
  arXiv  Detail & Related papers  (2025-05-11T13:18:03Z)
• Federated Quantum Long Short-term Memory (FedQLSTM) [58.50321380769256]
  Quantum federated learning (QFL) can facilitate collaborative learning across multiple clients using quantum machine learning (QML) models. No prior work has focused on developing a QFL framework that utilizes temporal data to approximate functions. A novel QFL framework that is the first to integrate quantum long short-term memory (QLSTM) models with temporal data is proposed.
  arXiv  Detail & Related papers  (2023-12-21T21:40:47Z)
• Collaborative Intelligent Reflecting Surface Networks with Multi-Agent Reinforcement Learning [63.83425382922157]
  Intelligent reflecting surface (IRS) is envisioned to be widely applied in future wireless networks. In this paper, we investigate a multi-user communication system assisted by cooperative IRS devices with the capability of energy harvesting.
  arXiv  Detail & Related papers  (2022-03-26T20:37:14Z)
• Memory-Efficient Factorization Machines via Binarizing both Data and Model Coefficients [9.692334398809457]
  Subspace imating machine (SEFM) has been proposed to overcome the limitation of Factorization Machines (FM) We propose a new method called Binarized FM which constraints the model parameters to be binary values. Our proposed method achieves comparable accuracy with SEFM but with much less memory cost.
  arXiv  Detail & Related papers  (2021-08-17T03:30:52Z)
• Mixed Variable Bayesian Optimization with Frequency Modulated Kernels [96.78099706164747]
  We propose the frequency modulated (FM) kernel flexibly modeling dependencies among different types of variables. BO-FM outperforms competitors including Regularized evolution(RE) and BOHB.
  arXiv  Detail & Related papers  (2021-02-25T11:28:46Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.