DeepAI AI Chat
Log In Sign Up

QROSS: QUBO Relaxation Parameter Optimisation via Learning Solver Surrogates

by   Tian Huang, et al.

An increasingly popular method for solving a constrained combinatorial optimisation problem is to first convert it into a quadratic unconstrained binary optimisation (QUBO) problem, and solve it using a standard QUBO solver. However, this relaxation introduces hyper-parameters that balance the objective and penalty terms for the constraints, and their chosen values significantly impact performance. Hence, tuning these parameters is an important problem. Existing generic hyper-parameter tuning methods require multiple expensive calls to a QUBO solver, making them impractical for performance critical applications when repeated solutions of similar combinatorial optimisation problems are required. In this paper, we propose the QROSS method, in which we build surrogate models of QUBO solvers via learning from solver data on a collection of instances of a problem. In this way, we are able capture the common structure of the instances and their interactions with the solver, and produce good choices of penalty parameters with fewer number of calls to the QUBO solver. We take the Traveling Salesman Problem (TSP) as a case study, where we demonstrate that our method can find better solutions with fewer calls to QUBO solver compared with conventional hyper-parameter tuning techniques. Moreover, with simple adaptation methods, QROSS is shown to generalise well to out-of-distribution datasets and different types of QUBO solvers.


page 1

page 2

page 3

page 4


Penalty Weights in QUBO Formulations: Permutation Problems

Optimisation algorithms designed to work on quantum computers or other s...

Multi-objective QUBO Solver: Bi-objective Quadratic Assignment

Quantum and quantum-inspired optimisation algorithms are designed to sol...

Gradient Backpropagation Through Combinatorial Algorithms: Identity with Projection Works

Embedding discrete solvers as differentiable layers has given modern dee...

Learning to Optimise General TSP Instances

The Travelling Salesman Problem (TSP) is a classical combinatorial optim...

A Study of Scalarisation Techniques for Multi-Objective QUBO Solving

In recent years, there has been significant research interest in solving...

Training Neural Networks using SAT solvers

We propose an algorithm to explore the global optimization method, using...