Table of Contents
Fetching ...

$i$Trust: Trust-Region Optimisation with Ising Machines

Sayantan Pramanik, Kaumudibikash Goswami, Sourav Chatterjee, M Girish Chandra

TL;DR

This work presents iTrust, a trust-region optimization framework that leverages opto-electronic oscillator-based coherent Ising machines (CIMs) to solve unconstrained problems. The core idea is the Economical Coherent Ising Machine (ECIM), a clipped-transfer CIM augmented with a gradient-based energy function $E(s)$, a linear term $h$, and a box projection to enable trust-region steps without matrix inversion. The authors prove convergence of ECIM under convex and locally invex objectives, derive explicit iteration-complexity bounds, and integrate ECIM into a full iTrust algorithm that updates the parameters within a trust region using a surrogate model. This approach offers a Hessian-free alternative for second-order optimization with potential applications in machine learning, quantum ML, and variational quantum algorithms, and it opens avenues for further extensions to natural-gradient and zeroth-order methods.

Abstract

In this work, we present a heretofore unseen application of Ising machines to perform trust region-based optimisation with box constraints. This is done by considering a specific form of opto-electronic oscillator-based coherent Ising machines with clipped transfer functions, and proposing appropriate modifications to facilitate trust-region optimisation. The enhancements include the inclusion of non-symmetric coupling and linear terms, modulation of noise, and compatibility with convex-projections to improve its convergence. The convergence of the modified Ising machine has been shown under the reasonable assumptions of convexity or invexity. The mathematical structures of the modified Ising machine and trust-region methods have been exploited to design a new trust-region method to effectively solve unconstrained optimisation problems in many scenarios, such as machine learning and optimisation of parameters in variational quantum algorithms. Hence, the proposition is useful for both classical and quantum-classical hybrid scenarios. Finally, the convergence of the Ising machine-based trust-region method, has also been proven analytically, establishing the feasibility of the technique.

$i$Trust: Trust-Region Optimisation with Ising Machines

TL;DR

This work presents iTrust, a trust-region optimization framework that leverages opto-electronic oscillator-based coherent Ising machines (CIMs) to solve unconstrained problems. The core idea is the Economical Coherent Ising Machine (ECIM), a clipped-transfer CIM augmented with a gradient-based energy function , a linear term , and a box projection to enable trust-region steps without matrix inversion. The authors prove convergence of ECIM under convex and locally invex objectives, derive explicit iteration-complexity bounds, and integrate ECIM into a full iTrust algorithm that updates the parameters within a trust region using a surrogate model. This approach offers a Hessian-free alternative for second-order optimization with potential applications in machine learning, quantum ML, and variational quantum algorithms, and it opens avenues for further extensions to natural-gradient and zeroth-order methods.

Abstract

In this work, we present a heretofore unseen application of Ising machines to perform trust region-based optimisation with box constraints. This is done by considering a specific form of opto-electronic oscillator-based coherent Ising machines with clipped transfer functions, and proposing appropriate modifications to facilitate trust-region optimisation. The enhancements include the inclusion of non-symmetric coupling and linear terms, modulation of noise, and compatibility with convex-projections to improve its convergence. The convergence of the modified Ising machine has been shown under the reasonable assumptions of convexity or invexity. The mathematical structures of the modified Ising machine and trust-region methods have been exploited to design a new trust-region method to effectively solve unconstrained optimisation problems in many scenarios, such as machine learning and optimisation of parameters in variational quantum algorithms. Hence, the proposition is useful for both classical and quantum-classical hybrid scenarios. Finally, the convergence of the Ising machine-based trust-region method, has also been proven analytically, establishing the feasibility of the technique.
Paper Structure (11 sections, 8 theorems, 28 equations, 1 algorithm)

This paper contains 11 sections, 8 theorems, 28 equations, 1 algorithm.

Key Result

Lemma 1

If the set $\mathcal{C} \subset \mathbb{R}^n$ is convex, and $\boldsymbol{z} \in \mathbb{R}^n$, then $\forall \, \boldsymbol{x} \in \mathcal{C}$: and,

Theorems & Definitions (12)

  • Lemma 1
  • Theorem 1: Convergence with Fixed Step-Sizes
  • Corollary 1: Iteration Complexity with Fixed Step-Sizes
  • Theorem 2: Convergence with decreasing step-sizes
  • Lemma 2
  • Conjecture 1
  • Theorem 3: Convergence with Fixed Step-Sizes
  • Corollary 2: Iteration Complexity with Constant Step-Sizes
  • Remark 1
  • Remark 2
  • ...and 2 more