Pith. sign in

REVIEW 3 cited by

Black-box optimization for integer-variable problems using Ising machines and factorization machines

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2209.01016 v1 pith:GJXW75EQ submitted 2022-09-01 cs.LG quant-ph

classification cs.LGquant-ph
keywords optimizationmachinesisingproblemsblack-boxapproachmethodsbinary
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Black-box optimization has potential in numerous applications such as hyperparameter optimization in machine learning and optimization in design of experiments. Ising machines are useful for binary optimization problems because variables can be represented by a single binary variable of Ising machines. However, conventional approaches using an Ising machine cannot handle black-box optimization problems with non-binary values. To overcome this limitation, we propose an approach for integer-variable black-box optimization problems by using Ising/annealing machines and factorization machines in cooperation with three different integer-encoding methods. The performance of our approach is numerically evaluated with different encoding methods using a simple problem of calculating the energy of the hydrogen molecule in the most stable state. The proposed approach can calculate the energy using any of the integer-encoding methods. However, one-hot encoding is useful for problems with a small size.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Factorization Machine with Quadratic-Optimization Annealing for RNA Inverse Folding and Evaluation of Binary-Integer Encoding and Nucleotide Assignment

    cs.LG 2026-02 conditional novelty 6.0 of 10

    In RNA inverse folding, FMQA with one-hot or domain-wall encoding finds lower-defect sequences with fewer evaluations than binary/unary encodings and than TPE, GA, and random search on the tested benchmarks.

  2. Effectiveness of Hybrid Optimization Method for Quantum Annealing Machines

    cond-mat.stat-mech 2025-07 conditional novelty 5.0 of 10

    For fully-connected random Ising models of 240 to 640 spins, solving a spin-reduced subproblem on a quantum annealer improves on preprocessing simulated annealing, and the optimal subproblem size grows with quantum an...

  3. Real-Time Black-Box Optimization for Dynamic Discrete Environments Using Embedded Ising Machines

    cs.AI 2025-06 conditional novelty 5.0 of 10

    RT-BBO extends factorization-machine black-box optimization to dynamic, discrete environments by adding sliding data windows, model weight decay, and an exploration incentive, and demonstrates high throughput on a sim...

Pith tools