Penalty Coefficient Adjustment Technique for Extended Ising Machines

被引:0
|
作者
Yin, Fang [1 ]
Tamura, Hirotaka [2 ]
Furue, Yuki [1 ]
Watanabe, Yasuhiro [3 ]
机构
[1] Fujitsu Ltd, Quantum Lab, Nakahara Ku, Kawasaki, Kanagawa 2118588, Japan
[2] DXR Lab Inc, Kohoku Ku, Yokohama, Kanagawa 2230066, Japan
[3] Fujitsu Ltd, Comp Lab, Nakahara Ku, Kawasaki, Kanagawa 2118588, Japan
来源
IEEE ACCESS | 2024年 / 12卷
关键词
Optimization; Monte Carlo methods; Search problems; Simulated annealing; Neurons; Costs; Annealing; Heuristic algorithms; Cost function; Convergence; Penalty coefficient adjustment; Ising machine; combinatorial optimization; MCMC; parallel tempering; QUBO; OPTIMIZATION ALGORITHM;
D O I
10.1109/ACCESS.2024.3494736
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We have developed an extended Ising machine that extends the energy function, which is restricted to a binary-quadratic form in conventional Ising machines, to include a variety of penalty functions representing inequality constraints and higher-order energy terms. Such an extension opens up the possibility of dealing with problems featuring many (e.g., thousands or more) constraints. However, for problems with so many constraints, it is often necessary to adjust the value of the penalty coefficient, which represents the ratio of the penalty function to the total cost function, in order to find a solution. In this paper, we propose a penalty coefficient adjustment technique that can be combined with the parallel trial-based Exchange Monte Carlo method, a search algorithm for the extended Ising machine. The proposed algorithm enables us to solve the inequality constraint problem, which previously had the difficulty of manually determining penalty coefficients by trial and error. It also improves the solution quality. In two of the five QPLIB instances we tested, the extended Ising machine with fixed penalty coefficients obtained either a previous or a new best-known solution depending on the random seed, while the proposed coefficient adjustment method obtained a new best-known solution with all ten random seeds used.
引用
收藏
页码:168303 / 168313
页数:11
相关论文
共 50 条
  • [31] Transforming generalized Ising models into Boltzmann machines
    Yoshioka, Nobuyuki
    Akagi, Yutaka
    Katsura, Hosho
    PHYSICAL REVIEW E, 2019, 99 (03)
  • [32] Photonic Ising machines for combinatorial optimization problems
    Gao, Yuan
    Chen, Guanyu
    Qi, Luo
    Fu, Wujie
    Yuan, Zifeng
    Danner, Aaron J.
    APPLIED PHYSICS REVIEWS, 2024, 11 (04):
  • [33] Coherent Ising machines on photonic integrated circuits
    Shi, Ruqi
    Van Vaerenbergh, Thomas
    Boehm, Fabian
    Bienstman, Peter
    2024 IEEE SILICON PHOTONICS CONFERENCE, SIPHOTONICS, 2024,
  • [34] Coherent Ising Machines with Error Correction Feedback
    Kako, Satoshi
    Leleu, Timothee
    Inui, Yoshitaka
    Khoyratee, Farad
    Reifenstein, Sam
    Yamamoto, Yoshihisa
    ADVANCED QUANTUM TECHNOLOGIES, 2020, 3 (11)
  • [35] EXTENDED UNIVERSALITY OF ISING-MODEL
    RITCHIE, DS
    BETTS, DD
    PHYSICAL REVIEW B, 1975, 11 (07): : 2559 - 2563
  • [36] Emulating Quantum Circuits With Generalized Ising Machines
    Chowdhury, Shuvro
    Camsari, Kerem
    Datta, Supriyo
    IEEE ACCESS, 2023, 11 : 116944 - 116955
  • [37] Equation Planting: A Tool for Benchmarking Ising Machines
    Hen, Itay
    PHYSICAL REVIEW APPLIED, 2019, 12 (01):
  • [38] Robustness analysis and parameter adjustment for DMC with penalty factor
    Luo, ZL
    Zhong, LJ
    Yu, JF
    DYNAMICS OF CONTINUOUS DISCRETE AND IMPULSIVE SYSTEMS-SERIES A-MATHEMATICAL ANALYSIS, 2006, 13 : 364 - 370
  • [39] LINEAR FINITE PENALTY METHOD WITH DESCENT VECTOR ADJUSTMENT
    PANIN, VM
    CYBERNETICS, 1988, 24 (01): : 60 - 68
  • [40] Principles for the adjustment of centerless superfinishing machines
    Zakharov O.V.
    Russian Engineering Research, 2011, 31 (5) : 465 - 468