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 条
  • [1] NURSE SCHEDULING BY COOPERATIVE GA WITH PENALTY COEFFICIENT ADJUSTMENT
    Ohki, Makoto
    Kinjo, Hideaki
    ECTA 2011/FCTA 2011: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION THEORY AND APPLICATIONS AND INTERNATIONAL CONFERENCE ON FUZZY COMPUTATION THEORY AND APPLICATIONS, 2011, : 255 - 258
  • [2] EXTENDED TRANSCONDUCTANCE ADJUSTMENT LINEARIZATION TECHNIQUE
    ADAMS, WJ
    RAMIREZANGULO, J
    ELECTRONICS LETTERS, 1991, 27 (10) : 842 - 844
  • [3] Application of Ising Machines and a Software Development for Ising Machines
    Tanahashi, Kotaro
    Takayanagi, Shinichi
    Motohashi, Tomomitsu
    Tanaka, Shu
    JOURNAL OF THE PHYSICAL SOCIETY OF JAPAN, 2019, 88 (06)
  • [4] MIDPOINT VALIDATION METHOD FOR SUPPORT VECTOR MACHINES WITH MARGIN ADJUSTMENT TECHNIQUE
    Tamura, Hiroki
    Tanno, Koichi
    INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2009, 5 (11A): : 4025 - 4032
  • [5] Analog errors in Ising machines
    Albash, Tameem
    Martin-Mayor, Victor
    Hen, Itay
    QUANTUM SCIENCE AND TECHNOLOGY, 2019, 4 (02)
  • [6] Gaussian optical Ising machines
    Clements, William R.
    Renema, Jelmer J.
    Wen, Y. Henry
    Chrzanowski, Helen M.
    Kolthammer, W. Steven
    Walmsley, Ian A.
    PHYSICAL REVIEW A, 2017, 96 (04)
  • [7] ESTIMATES OF THE EXACT PENALTY COEFFICIENT THRESHOLD
    PENOT, JP
    KHALADI, M
    UTILITAS MATHEMATICA, 1992, 42 : 147 - 161
  • [8] ON SOME ESTIMATES OF THE PENALTY COEFFICIENT IN METHODS OF EXACT PENALTY-FUNCTIONS
    ZHADAN, VG
    USSR COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 1984, 24 (04): : 124 - 128
  • [9] Digital Emulation of Oscillator Ising Machines
    Sreedhara, Shreesha
    Roychowdhury, Jaijeet
    Wabnig, Joachim
    Srinath, Pavan
    2023 DESIGN, AUTOMATION & TEST IN EUROPE CONFERENCE & EXHIBITION, DATE, 2023,
  • [10] EXTENDED ISING-MODEL
    BALBUENA, P
    DAWSON, KA
    PHYSICAL REVIEW B, 1988, 38 (16): : 11432 - 11443