Global Optimization Through Heterogeneous Oscillator Ising Machines
Ahmed Allibhoy, Arthur N. Montanari, Fabio Pasqualetti, Adilson E. Motter
TL;DR
This work develops a signed-graph Laplacian framework to analyze oscillator Ising machines (OIMs) for solving Ising minimization problems, linking the energy landscape to the Hessian spectrum of the OIM energy. It shows that in frustration-free networks a suitable positive regularization $\\mu$ guarantees asymptotic stability of global minimizers, while in frustrated ensembles low-energy configurations are statistically more likely to be stable. Importantly, introducing heterogeneity in the regularization parameters $\\mu_i$ increases the Hessian variance at extreme energies, biasing dynamics toward globally optimal equilibria with a larger spectral gap. Numerical experiments corroborate the theory and motivate design guidelines that use parameter heterogeneity to achieve high-probability convergence to global optima.
Abstract
Oscillator Ising machines (OIMs) are networks of coupled oscillators that seek the minimum energy state of an Ising model. Since many NP-hard problems are equivalent to the minimization of an Ising Hamiltonian, OIMs have emerged as a promising computing paradigm for solving complex optimization problems that are intractable on existing digital computers. However, their performance is sensitive to the choice of tunable parameters, and convergence guarantees are mostly lacking. Here, we show that lower energy states are more likely to be stable, and that convergence to the global minimizer is often improved by introducing random heterogeneities in the regularization parameters. Our analysis relates the stability properties of Ising configurations to the spectral properties of a signed graph Laplacian. By examining the spectra of random ensembles of these graphs, we show that the probability of an equilibrium being asymptotically stable depends inversely on the value of the Ising Hamiltonian, biasing the system toward low-energy states. Our numerical results confirm our findings and demonstrate that heterogeneously designed OIMs efficiently converge to globally optimal solutions with high probability.
